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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 8.1K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.5K Mar 15 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:07 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 417K 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-02b-ReachabilityFireability-2024-00
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-01
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-02
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-03
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-04
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-05
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-06
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-07
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-08
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-09
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-10
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-11
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-12
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-13
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-14
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779471320553

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-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-22 17:35:21] [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 17:35:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 17:35:22] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2026-05-22 17:35:22] [INFO ] Transformed 1242 places.
[2026-05-22 17:35:22] [INFO ] Transformed 1621 transitions.
[2026-05-22 17:35:22] [INFO ] Found NUPN structural information;
[2026-05-22 17:35:22] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 252 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (158 resets) in 2031 ms. (19 steps per ms) remains 7/16 properties
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (30 resets) in 191 ms. (208 steps per ms) remains 7/7 properties
[2026-05-22 17:35:22] [INFO ] Flatten gal took : 262 ms
BEST_FIRST walk for 40004 steps (29 resets) in 419 ms. (95 steps per ms) remains 7/7 properties
[2026-05-22 17:35:23] [INFO ] Flatten gal took : 121 ms
BEST_FIRST walk for 40004 steps (33 resets) in 166 ms. (239 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (34 resets) in 159 ms. (250 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (35 resets) in 142 ms. (279 steps per ms) remains 7/7 properties
[2026-05-22 17:35:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5841497273948619154.gal : 112 ms
[2026-05-22 17:35:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18079617402333365459.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/ReachabilityCardinality5841497273948619154.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18079617402333365459.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (34 resets) in 210 ms. (189 steps per ms) remains 6/7 properties
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality18079617402333365459.prop.
BEST_FIRST walk for 40004 steps (25 resets) in 582 ms. (68 steps per ms) remains 6/6 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15658787863818571723.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15454248900287664409.kers'
[2026-05-22 17:35:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15658787863818571723.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15454248900287664409.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1621 rows 1242 cols 5041 entries
Finished phase 1 with 820 SingleSign rule and 301 generalized
[2026-05-22 17:35:23] [INFO ] Computed 121 invariants in 8 ms
Computed 121 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-15454248900287664409.kers
Total runtime 11 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 364/444 variables, 15/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 364/459 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 72/516 variables, 8/467 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 72/539 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 686/1202 variables, 81/620 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :8 after 14
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :14 after 47
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :47 after 194
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :194 after 321
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :321 after 964
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :964 after 14485
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :14485 after 399017
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :399017 after 1.00084e+07
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :1.00084e+07 after 6.03131e+09
At refinement iteration 9 (INCLUDED_ONLY) 0/1202 variables, 686/1306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1202 variables, 0/1306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 40/1242 variables, 17/1323 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1242 variables, 40/1363 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :6.03131e+09 after 7.20811e+13
At refinement iteration 13 (INCLUDED_ONLY) 0/1242 variables, 0/1363 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2863/2863 variables, and 2605 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5039 ms.
Refiners :[Domain max(s): 1242/1242 constraints, Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 98/98 constraints, State Equation: 1242/1242 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 364/444 variables, 15/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :7.20811e+13 after 7.24711e+13
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 364/459 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 72/516 variables, 8/467 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 72/539 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem ASLink-PT-02b-ReachabilityFireability-2024-14 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 686/1202 variables, 81/621 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1202 variables, 686/1307 constraints. Problems are: Problem set: 1 solved, 5 unsolved
SDD proceeding with computation,7 properties remain. new max is 32768
SDD size :7.24711e+13 after 7.27837e+13
SMT process timed out in 10196ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 51 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 264 transitions
Trivial Post-agglo rules discarded 264 transitions
Performed 264 trivial Post agglomeration. Transition count delta: 264
Iterating post reduction 0 with 264 rules applied. Total rules applied 264 place count 1242 transition count 1357
Reduce places removed 264 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 1 with 278 rules applied. Total rules applied 542 place count 978 transition count 1343
Reduce places removed 4 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 11 rules applied. Total rules applied 553 place count 974 transition count 1336
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 560 place count 967 transition count 1336
Performed 265 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 265 Pre rules applied. Total rules applied 560 place count 967 transition count 1071
Deduced a syphon composed of 265 places in 2 ms
Ensure Unique test removed 21 places
Reduce places removed 286 places and 0 transitions.
Iterating global reduction 4 with 551 rules applied. Total rules applied 1111 place count 681 transition count 1071
Discarding 3 places :
Implicit places reduction removed 3 places
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 4 with 16 rules applied. Total rules applied 1127 place count 678 transition count 1058
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 14 rules applied. Total rules applied 1141 place count 665 transition count 1057
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1142 place count 664 transition count 1057
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 7 Pre rules applied. Total rules applied 1142 place count 664 transition count 1050
Deduced a syphon composed of 7 places in 4 ms
Ensure Unique test removed 7 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 21 rules applied. Total rules applied 1163 place count 650 transition count 1050
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 7 Pre rules applied. Total rules applied 1163 place count 650 transition count 1043
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 1177 place count 643 transition count 1043
Discarding 37 places :
Symmetric choice reduction at 7 with 37 rule applications. Total rules 1214 place count 606 transition count 1006
Iterating global reduction 7 with 37 rules applied. Total rules applied 1251 place count 606 transition count 1006
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1252 place count 606 transition count 1005
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 13 Pre rules applied. Total rules applied 1252 place count 606 transition count 992
Deduced a syphon composed of 13 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 8 with 27 rules applied. Total rules applied 1279 place count 592 transition count 992
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1279 place count 592 transition count 991
Deduced a syphon composed of 1 places in 3 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 1282 place count 590 transition count 991
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1284 place count 588 transition count 979
Iterating global reduction 8 with 2 rules applied. Total rules applied 1286 place count 588 transition count 979
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 1286 place count 588 transition count 977
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1290 place count 586 transition count 977
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 8 with 130 rules applied. Total rules applied 1420 place count 521 transition count 912
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1421 place count 520 transition count 911
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 1423 place count 519 transition count 911
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1424 place count 518 transition count 910
Iterating global reduction 8 with 1 rules applied. Total rules applied 1425 place count 518 transition count 910
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1426 place count 518 transition count 909
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1428 place count 517 transition count 918
Free-agglomeration rule applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 1433 place count 517 transition count 913
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1438 place count 512 transition count 913
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1442 place count 512 transition count 909
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1446 place count 508 transition count 909
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1447 place count 507 transition count 908
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 11 with 4 rules applied. Total rules applied 1451 place count 504 transition count 907
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1452 place count 503 transition count 907
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 3 Pre rules applied. Total rules applied 1452 place count 503 transition count 904
Deduced a syphon composed of 3 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 7 rules applied. Total rules applied 1459 place count 499 transition count 904
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 13 with 2 rules applied. Total rules applied 1461 place count 497 transition count 904
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 1461 place count 497 transition count 903
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1463 place count 496 transition count 903
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 1469 place count 493 transition count 900
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1470 place count 492 transition count 899
Iterating global reduction 14 with 1 rules applied. Total rules applied 1471 place count 492 transition count 899
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1472 place count 492 transition count 898
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1473 place count 491 transition count 898
Applied a total of 1473 rules in 612 ms. Remains 491 /1242 variables (removed 751) and now considering 898/1621 (removed 723) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 620 ms. Remains : 491/1242 places, 898/1621 transitions.
RANDOM walk for 40000 steps (436 resets) in 390 ms. (102 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (160 resets) in 182 ms. (218 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (157 resets) in 286 ms. (139 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (168 resets) in 172 ms. (231 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (128 resets) in 174 ms. (228 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (149 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
SDD proceeding with computation,7 properties remain. new max is 65536
SDD size :7.27837e+13 after 8.14381e+13
Interrupted probabilistic random walk after 367956 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 5
Probabilistic random walk after 367956 steps, saw 79337 distinct states, run finished after 3007 ms. (steps per millisecond=122 ) 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-13262420000116485932.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14096476157830743032.kers'
[2026-05-22 17:35:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13262420000116485932.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14096476157830743032.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 898 rows 486 cols 3459 entries
Finished phase 1 with 153 SingleSign rule and 257 generalized
[2026-05-22 17:35:37] [INFO ] Computed 81 invariants in 5 ms
Computed 81 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-14096476157830743032.kers
Total runtime 6 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 145/196 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 28/224 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/225 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/226 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 239/465 variables, 42/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 10/475 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/475 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/476 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/476 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 15/491 variables, 13/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/491 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 898/1389 variables, 491/572 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1389 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/1389 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1389/1389 variables, and 572 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1421 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 145/196 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 28/224 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/225 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/226 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 239/465 variables, 42/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/465 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 10/475 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/475 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/475 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 1/476 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/476 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 15/491 variables, 13/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/491 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem ASLink-PT-02b-ReachabilityFireability-2024-01 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02b-ReachabilityFireability-2024-07 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02b-ReachabilityFireability-2024-09 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02b-ReachabilityFireability-2024-11 is UNSAT
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 20 (OVERLAPS) 898/1389 variables, 491/575 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1389 variables, 0/575 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1389 variables, 0/575 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1389/1389 variables, and 575 constraints, problems are : Problem set: 4 solved, 1 unsolved in 3374 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4826ms problems are : Problem set: 4 solved, 1 unsolved
Parikh walk visited 0 properties in 124 ms.
Support contains 40 out of 491 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 898/898 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 491 transition count 891
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 484 transition count 891
Applied a total of 14 rules in 23 ms. Remains 484 /491 variables (removed 7) and now considering 891/898 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 484/491 places, 891/898 transitions.
RANDOM walk for 40000 steps (499 resets) in 370 ms. (107 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (159 resets) in 236 ms. (168 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 700737 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :0 out of 1
Probabilistic random walk after 700737 steps, saw 144964 distinct states, run finished after 3001 ms. (steps per millisecond=233 ) 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-6004011676744607396.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9734262065167904116.kers'
[2026-05-22 17:35:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6004011676744607396.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9734262065167904116.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 1 ms.
// Phase 1: matrix 891 rows 479 cols 3445 entries
Finished phase 1 with 144 SingleSign rule and 259 generalized
[2026-05-22 17:35:45] [INFO ] Computed 81 invariants in 16 ms
Computed 81 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-9734262065167904116.kers
Total runtime 17 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 122/162 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/190 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/191 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/192 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 229/421 variables, 40/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 35/456 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/457 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/457 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 27/484 variables, 15/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/484 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 891/1375 variables, 484/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1375 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1375 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1375/1375 variables, and 565 constraints, problems are : Problem set: 0 solved, 1 unsolved in 703 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 484/484 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 122/162 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/190 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/191 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/192 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 229/421 variables, 40/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 35/456 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/457 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/457 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 27/484 variables, 15/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/484 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/484 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 891/1375 variables, 484/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1375 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1375 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1375/1375 variables, and 567 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1520 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 484/484 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2256ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 278 ms.
Support contains 40 out of 484 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 484/484 places, 891/891 transitions.
Applied a total of 0 rules in 15 ms. Remains 484 /484 variables (removed 0) and now considering 891/891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 484/484 places, 891/891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 484/484 places, 891/891 transitions.
Applied a total of 0 rules in 15 ms. Remains 484 /484 variables (removed 0) and now considering 891/891 (removed 0) transitions.
[2026-05-22 17:35:48] [INFO ] Invariant cache hit.
[2026-05-22 17:35:49] [INFO ] Implicit Places using invariants in 714 ms returned [1, 19, 33, 69, 140, 144, 155, 156, 158, 177, 195, 283, 289, 302, 303, 304, 344, 346, 350, 368, 369, 370, 371, 385, 391, 397, 403, 410, 422, 428, 434, 440, 447]
[2026-05-22 17:35:49] [INFO ] Actually due to overlaps returned [344, 304, 158, 177, 350, 33, 155, 302, 368, 156, 303, 346, 369, 1, 283, 69, 195, 370, 447, 19, 289, 371, 385, 391, 397, 403, 410, 422, 428, 434, 440]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 746 ms to find 31 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 453/484 places, 891/891 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 452 transition count 846
Reduce places removed 45 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 50 rules applied. Total rules applied 96 place count 407 transition count 841
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 402 transition count 841
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 101 place count 402 transition count 828
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 128 place count 388 transition count 828
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 137 place count 379 transition count 819
Iterating global reduction 3 with 9 rules applied. Total rules applied 146 place count 379 transition count 819
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 149 place count 376 transition count 813
Iterating global reduction 3 with 3 rules applied. Total rules applied 152 place count 376 transition count 813
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 153 place count 375 transition count 812
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 375 transition count 812
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 155 place count 374 transition count 810
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 374 transition count 810
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 212 place count 346 transition count 782
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 213 place count 345 transition count 781
Iterating global reduction 3 with 1 rules applied. Total rules applied 214 place count 345 transition count 781
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 215 place count 345 transition count 780
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 219 place count 343 transition count 782
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 227 place count 343 transition count 774
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 235 place count 335 transition count 774
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 236 place count 335 transition count 773
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 242 place count 335 transition count 773
Applied a total of 242 rules in 144 ms. Remains 335 /453 variables (removed 118) and now considering 773/891 (removed 118) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3864778355823538618.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10066389610838078473.kers'
[2026-05-22 17:35:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3864778355823538618.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10066389610838078473.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 773 rows 333 cols 3061 entries
Finished phase 1 with 109 SingleSign rule and 178 generalized
[2026-05-22 17:35:49] [INFO ] Computed 48 invariants in 8 ms
Computed 48 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-10066389610838078473.kers
Total runtime 12 ms.
[2026-05-22 17:35:49] [INFO ] Implicit Places using invariants in 330 ms returned [77, 99, 107, 113, 114, 206, 209, 212, 219, 319, 323, 326, 329, 332]
[2026-05-22 17:35:49] [INFO ] Actually due to overlaps returned [206, 212, 323, 326, 329, 332, 77, 99, 107, 113, 114, 219, 319]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 333 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 322/484 places, 773/891 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 322 transition count 769
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 318 transition count 769
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 15 place count 311 transition count 760
Iterating global reduction 2 with 7 rules applied. Total rules applied 22 place count 311 transition count 760
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 311 transition count 758
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 26 place count 309 transition count 756
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 309 transition count 756
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 30 place count 307 transition count 754
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 307 transition count 754
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 306 transition count 753
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 306 transition count 753
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 305 transition count 752
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 305 transition count 752
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 44 place count 301 transition count 748
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 45 place count 301 transition count 747
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 50 place count 301 transition count 742
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 55 place count 296 transition count 742
Applied a total of 55 rules in 133 ms. Remains 296 /322 variables (removed 26) and now considering 742/773 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8118123478490673653.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6151272451658497240.kers'
[2026-05-22 17:35:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8118123478490673653.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6151272451658497240.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 742 rows 294 cols 2942 entries
Finished phase 1 with 107 SingleSign rule and 154 generalized
[2026-05-22 17:35:49] [INFO ] Computed 35 invariants in 4 ms
Computed 35 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6151272451658497240.kers
Total runtime 5 ms.
[2026-05-22 17:35:50] [INFO ] Implicit Places using invariants in 222 ms returned []
[2026-05-22 17:35:50] [INFO ] Invariant cache hit.
[2026-05-22 17:35:50] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 899 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 296/484 places, 742/891 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2284 ms. Remains : 296/484 places, 742/891 transitions.
RANDOM walk for 40000 steps (599 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (205 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 655872 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :0 out of 1
Probabilistic random walk after 655872 steps, saw 209287 distinct states, run finished after 3001 ms. (steps per millisecond=218 ) properties seen :0
[2026-05-22 17:35:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 88/128 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 135/263 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/279 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 17/296 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 742/1038 variables, 296/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1038 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1038 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1038/1038 variables, and 331 constraints, problems are : Problem set: 0 solved, 1 unsolved in 475 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 88/128 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 135/263 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 16/279 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 17/296 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 742/1038 variables, 296/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1038 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1038 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1038 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1038/1038 variables, and 333 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1482 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1966ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 40 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 742/742 transitions.
Applied a total of 0 rules in 10 ms. Remains 296 /296 variables (removed 0) and now considering 742/742 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 296/296 places, 742/742 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 742/742 transitions.
Applied a total of 0 rules in 9 ms. Remains 296 /296 variables (removed 0) and now considering 742/742 (removed 0) transitions.
[2026-05-22 17:35:55] [INFO ] Invariant cache hit.
[2026-05-22 17:35:56] [INFO ] Implicit Places using invariants in 179 ms returned []
[2026-05-22 17:35:56] [INFO ] Invariant cache hit.
[2026-05-22 17:35:56] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
[2026-05-22 17:35:56] [INFO ] Redundant transitions in 51 ms returned []
Running 722 sub problems to find dead transitions.
[2026-05-22 17:35:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 23/28 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 722 unsolved
SMT process timed out in 30299ms, After SMT, problems are : Problem set: 0 solved, 722 unsolved
Search for dead transitions found 0 dead transitions in 30310ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31208 ms. Remains : 296/296 places, 742/742 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 296 transition count 740
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 294 transition count 740
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 294 transition count 740
Applied a total of 5 rules in 35 ms. Remains 294 /296 variables (removed 2) and now considering 740/742 (removed 2) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4727256313644987329.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7664225755695415784.kers'
[2026-05-22 17:36:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4727256313644987329.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7664225755695415784.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 740 rows 292 cols 2941 entries
Finished phase 1 with 95 SingleSign rule and 164 generalized
[2026-05-22 17:36:27] [INFO ] Computed 35 invariants in 4 ms
Computed 35 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7664225755695415784.kers
Total runtime 5 ms.
[2026-05-22 17:36:27] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 17:36:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2026-05-22 17:36:27] [INFO ] [Nat]Absence check using 9 positive and 26 generalized place invariants in 7 ms returned sat
[2026-05-22 17:36:27] [INFO ] After 322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 17:36:27] [INFO ] After 507ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 17:36:28] [INFO ] After 762ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-22 17:36:28] [INFO ] Flatten gal took : 40 ms
[2026-05-22 17:36:28] [INFO ] Flatten gal took : 29 ms
[2026-05-22 17:36:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11540066148218705066.gal : 7 ms
[2026-05-22 17:36:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3612580196594086776.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/ReachabilityCardinality11540066148218705066.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3612580196594086776.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3612580196594086776.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 156
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :156 after 2128
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2128 after 2344
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2344 after 3077
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3077 after 3137
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3137 after 15974
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :15974 after 38256
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :38256 after 148434
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :148434 after 1.08461e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.08461e+06 after 5.72774e+06
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :5.72774e+06 after 2.0618e+07
Detected timeout of ITS tools.
[2026-05-22 17:36:43] [INFO ] Flatten gal took : 25 ms
[2026-05-22 17:36:43] [INFO ] Applying decomposition
[2026-05-22 17:36:43] [INFO ] Flatten gal took : 92 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/graph15887511236774575225.txt' '-o' '/tmp/graph15887511236774575225.bin' '-w' '/tmp/graph15887511236774575225.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15887511236774575225.bin' '-l' '-1' '-v' '-w' '/tmp/graph15887511236774575225.weights' '-q' '0' '-e' '0.001'
[2026-05-22 17:36:43] [INFO ] Decomposing Gal with order
[2026-05-22 17:36:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 17:36:43] [INFO ] Removed a total of 1451 redundant transitions.
[2026-05-22 17:36:43] [INFO ] Flatten gal took : 128 ms
[2026-05-22 17:36:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 23 ms.
[2026-05-22 17:36:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14915844217168091398.gal : 8 ms
[2026-05-22 17:36:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7066808222802353438.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/ReachabilityCardinality14915844217168091398.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7066808222802353438.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/ReachabilityCardinality7066808222802353438.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 312
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :312 after 4576
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4576 after 9048
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :9048 after 360524
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :360524 after 491909
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :491909 after 687461
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :687461 after 4.09352e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.33725e+07 after 1.93972e+07
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4.06121e+07 after 4.85605e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8.11823e+07 after 1.01865e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.01865e+08 after 1.35724e+08
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31796 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 17:36:59] [INFO ] Flatten gal took : 61 ms
[2026-05-22 17:36:59] [INFO ] Applying decomposition
[2026-05-22 17:36:59] [INFO ] Flatten gal took : 36 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/graph9305541363317443783.txt' '-o' '/tmp/graph9305541363317443783.bin' '-w' '/tmp/graph9305541363317443783.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9305541363317443783.bin' '-l' '-1' '-v' '-w' '/tmp/graph9305541363317443783.weights' '-q' '0' '-e' '0.001'
[2026-05-22 17:36:59] [INFO ] Decomposing Gal with order
[2026-05-22 17:36:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 17:36:59] [INFO ] Removed a total of 1307 redundant transitions.
[2026-05-22 17:36:59] [INFO ] Flatten gal took : 98 ms
[2026-05-22 17:36:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 27 ms.
[2026-05-22 17:36:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7257783514429667207.gal : 12 ms
[2026-05-22 17:36:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14465843976955772063.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/ReachabilityCardinality7257783514429667207.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14465843976955772063.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/ReachabilityCardinality14465843976955772063.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 1.10161e+10
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.10161e+10 after 1.51242e+11
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.51242e+11 after 1.27185e+15
Detected timeout of ITS tools.
[2026-05-22 18:07:00] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin746657634663571723
[2026-05-22 18:07:00] [INFO ] Applying decomposition
[2026-05-22 18:07:00] [INFO ] Flatten gal took : 16 ms
[2026-05-22 18:07:00] [INFO ] Computing symmetric may disable matrix : 742 transitions.
[2026-05-22 18:07:00] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:07:00] [INFO ] Computing symmetric may enable matrix : 742 transitions.
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/graph14249551136322359306.txt' '-o' '/tmp/graph14249551136322359306.bin' '-w' '/tmp/graph14249551136322359306.weights'
[2026-05-22 18:07:00] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14249551136322359306.bin' '-l' '-1' '-v' '-w' '/tmp/graph14249551136322359306.weights' '-q' '0' '-e' '0.001'
[2026-05-22 18:07:00] [INFO ] Decomposing Gal with order
[2026-05-22 18:07:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 18:07:00] [INFO ] Removed a total of 1429 redundant transitions.
[2026-05-22 18:07:00] [INFO ] Flatten gal took : 54 ms
[2026-05-22 18:07:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 8 ms.
[2026-05-22 18:07:00] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability16072111756985429242.gal : 7 ms
[2026-05-22 18:07:00] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability495300537264026652.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/ReachabilityFireability16072111756985429242.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability495300537264026652.prop' '--nowitness'
[2026-05-22 18:07:00] [INFO ] Computing Do-Not-Accords matrix : 742 transitions.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
[2026-05-22 18:07:00] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:07:00] [INFO ] Built C files in 221ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin746657634663571723
Running compilation step : cd /tmp/ltsmin746657634663571723;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Loading property file /tmp/ReachabilityFireability495300537264026652.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 5096
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :5096 after 17784
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :17784 after 64066
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :64066 after 182446
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :182446 after 442261
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :442261 after 830718
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.84835e+06 after 3.0285e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.38361e+07 after 1.58608e+07
Compilation finished in 2275 ms.
Running link step : cd /tmp/ltsmin746657634663571723;'gcc' '-shared' '-o' 'gal.so' 'model.o'
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.10736e+07 after 3.23734e+07
Link finished in 107 ms.
Running LTSmin : cd /tmp/ltsmin746657634663571723;'/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' 'ASLinkPT02bReachabilityFireability202402==true'
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8.60629e+07 after 1.31255e+08
Reachability property ASLink-PT-02b-ReachabilityFireability-2024-02 is true.
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-02 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 8193 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,1.01794e+09,22.084,540656,11445,13628,411333,284481,1038,3.10655e+06,342,3.18927e+06,0
Total reachable state count : 1017938631

Verifying 1 reachability properties.
Reachability property ASLink-PT-02b-ReachabilityFireability-2024-02 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-02b-ReachabilityFireability-2024-02,1,22.5969,540656,97,102,411333,284481,1255,3.10655e+06,378,3.18927e+06,0
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1921146 ms.

BK_STOP 1779473243068

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

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