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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 880K
-rw-r--r-- 1 mcc users 8.4K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.9K Mar 15 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 16K Mar 15 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K 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 357K 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-03a-ReachabilityFireability-2024-00
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-2024-01
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-2024-02
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-2024-03
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-2024-04
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-2024-05
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-2024-06
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-2024-07
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-2024-08
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-2024-09
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-2024-10
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-2024-11
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-2024-12
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-2024-13
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-2024-14
FORMULA_NAME ASLink-PT-03a-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779472174241

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-03a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-22 17:49:35] [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:49:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 17:49:36] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2026-05-22 17:49:36] [INFO ] Transformed 821 places.
[2026-05-22 17:49:36] [INFO ] Transformed 1281 transitions.
[2026-05-22 17:49:36] [INFO ] Found NUPN structural information;
[2026-05-22 17:49:36] [INFO ] Parsed PT model containing 821 places and 1281 transitions and 4839 arcs in 291 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 13 transitions
Reduce redundant transitions removed 13 transitions.
RANDOM walk for 40000 steps (346 resets) in 1977 ms. (20 steps per ms) remains 14/16 properties
FORMULA ASLink-PT-03a-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-22 17:49:36] [INFO ] Flatten gal took : 153 ms
[2026-05-22 17:49:36] [INFO ] Flatten gal took : 79 ms
BEST_FIRST walk for 40002 steps (76 resets) in 678 ms. (58 steps per ms) remains 14/14 properties
[2026-05-22 17:49:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7690091463277798015.gal : 81 ms
[2026-05-22 17:49:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16478959392474070517.prop : 6 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/ReachabilityCardinality7690091463277798015.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16478959392474070517.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/ReachabilityCardinality16478959392474070517.prop.
BEST_FIRST walk for 40003 steps (72 resets) in 1426 ms. (28 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (74 resets) in 342 ms. (116 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (77 resets) in 253 ms. (157 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (74 resets) in 277 ms. (143 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (64 resets) in 284 ms. (140 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (87 resets) in 220 ms. (181 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 6
BEST_FIRST walk for 40003 steps (77 resets) in 187 ms. (212 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :6 after 10
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :10 after 34
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :34 after 60
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :60 after 93
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :93 after 186
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :186 after 34646
BEST_FIRST walk for 40003 steps (74 resets) in 382 ms. (104 steps per ms) remains 13/14 properties
FORMULA ASLink-PT-03a-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (83 resets) in 174 ms. (228 steps per ms) remains 13/13 properties
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :34646 after 3.13649e+07
BEST_FIRST walk for 40003 steps (76 resets) in 134 ms. (296 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (57 resets) in 153 ms. (259 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (72 resets) in 169 ms. (235 steps per ms) remains 13/13 properties
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :3.13649e+07 after 1.11459e+09
BEST_FIRST walk for 40003 steps (76 resets) in 187 ms. (212 steps per ms) remains 13/13 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5242066367085985969.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11492327510756447395.kers'
[2026-05-22 17:49:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5242066367085985969.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11492327510756447395.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 1268 rows 809 cols 4789 entries
Finished phase 1 with 297 SingleSign rule and 368 generalized
[2026-05-22 17:49:38] [INFO ] Computed 156 invariants in 8 ms
Computed 156 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-11492327510756447395.kers
Total runtime 9 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 273/273 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem ASLink-PT-03a-ReachabilityFireability-2024-01 is UNSAT
FORMULA ASLink-PT-03a-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 146/419 variables, 26/302 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/419 variables, 146/448 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/419 variables, 2/450 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 0/450 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 19/438 variables, 7/457 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 19/476 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/476 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Problem ASLink-PT-03a-ReachabilityFireability-2024-13 is UNSAT
FORMULA ASLink-PT-03a-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (OVERLAPS) 372/810 variables, 113/589 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/810 variables, 372/961 constraints. Problems are: Problem set: 2 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 810/2089 variables, and 961 constraints, problems are : Problem set: 2 solved, 11 unsolved in 5034 ms.
Refiners :[Domain max(s): 810/821 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 118/123 constraints, State Equation: 0/821 constraints, PredecessorRefiner: 13/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 244/244 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 2/246 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/246 constraints. Problems are: Problem set: 2 solved, 11 unsolved
Problem ASLink-PT-03a-ReachabilityFireability-2024-02 is UNSAT
FORMULA ASLink-PT-03a-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 157/401 variables, 25/271 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 157/428 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 1/429 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/429 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 21/422 variables, 8/437 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 21/458 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 0/458 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Problem ASLink-PT-03a-ReachabilityFireability-2024-09 is UNSAT
FORMULA ASLink-PT-03a-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (OVERLAPS) 386/808 variables, 113/571 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/808 variables, 386/957 constraints. Problems are: Problem set: 4 solved, 9 unsolved
Problem ASLink-PT-03a-ReachabilityFireability-2024-03 is UNSAT
FORMULA ASLink-PT-03a-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-03a-ReachabilityFireability-2024-06 is UNSAT
FORMULA ASLink-PT-03a-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 12 (INCLUDED_ONLY) 0/808 variables, 7/964 constraints. Problems are: Problem set: 6 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 808/2089 variables, and 964 constraints, problems are : Problem set: 6 solved, 7 unsolved in 5011 ms.
Refiners :[Domain max(s): 808/821 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 116/123 constraints, State Equation: 0/821 constraints, PredecessorRefiner: 8/3 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10192ms problems are : Problem set: 6 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 160 out of 821 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 821/821 places, 1268/1268 transitions.
Ensure Unique test removed 11 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 805 transition count 1220
Reduce places removed 48 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 52 rules applied. Total rules applied 116 place count 757 transition count 1216
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 120 place count 753 transition count 1216
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 120 place count 753 transition count 1154
Deduced a syphon composed of 62 places in 2 ms
Ensure Unique test removed 22 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 266 place count 669 transition count 1154
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 268 place count 668 transition count 1153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 269 place count 667 transition count 1153
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 271 place count 665 transition count 1146
Iterating global reduction 5 with 2 rules applied. Total rules applied 273 place count 665 transition count 1146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 276 place count 664 transition count 1144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 277 place count 663 transition count 1144
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 311 place count 646 transition count 1127
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 314 place count 646 transition count 1124
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 317 place count 643 transition count 1124
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 319 place count 643 transition count 1124
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 323 place count 643 transition count 1124
Applied a total of 323 rules in 370 ms. Remains 643 /821 variables (removed 178) and now considering 1124/1268 (removed 144) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 391 ms. Remains : 643/821 places, 1124/1268 transitions.
RANDOM walk for 40000 steps (460 resets) in 919 ms. (43 steps per ms) remains 6/7 properties
FORMULA ASLink-PT-03a-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (129 resets) in 198 ms. (201 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (120 resets) in 280 ms. (142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (127 resets) in 181 ms. (219 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (126 resets) in 253 ms. (157 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (121 resets) in 164 ms. (242 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (127 resets) in 189 ms. (210 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-17836696445551987938.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1575739805040375412.kers'
[2026-05-22 17:49:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17836696445551987938.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1575739805040375412.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 1124 rows 641 cols 4434 entries
Finished phase 1 with 156 SingleSign rule and 371 generalized
[2026-05-22 17:49:49] [INFO ] Computed 116 invariants in 7 ms
Computed 116 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-1575739805040375412.kers
Total runtime 8 ms.
[2026-05-22 17:49:49] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 157/263 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 57/320 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 300/620 variables, 69/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/620 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 23/643 variables, 15/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1124/1767 variables, 643/759 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1767 variables, 7/766 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1767 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/1767 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1767/1767 variables, and 766 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2955 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 85/85 constraints, State Equation: 643/643 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 6/3 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/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 157/263 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 57/320 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 300/620 variables, 69/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/620 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/620 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 23/643 variables, 15/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/643 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem ASLink-PT-03a-ReachabilityFireability-2024-05 is UNSAT
FORMULA ASLink-PT-03a-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-03a-ReachabilityFireability-2024-07 is UNSAT
FORMULA ASLink-PT-03a-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-03a-ReachabilityFireability-2024-11 is UNSAT
FORMULA ASLink-PT-03a-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-03a-ReachabilityFireability-2024-12 is UNSAT
FORMULA ASLink-PT-03a-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 12 (OVERLAPS) 1124/1767 variables, 643/763 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1767 variables, 7/770 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1767 variables, 1/771 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1767 variables, 0/771 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1767 variables, 0/771 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1767/1767 variables, and 771 constraints, problems are : Problem set: 4 solved, 2 unsolved in 7719 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 85/85 constraints, State Equation: 643/643 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10718ms problems are : Problem set: 4 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
FORMULA ASLink-PT-03a-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 270 ms.
Support contains 2 out of 643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 643/643 places, 1124/1124 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 641 transition count 1105
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 40 place count 622 transition count 1105
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 40 place count 622 transition count 1099
Deduced a syphon composed of 6 places in 6 ms
Ensure Unique test removed 4 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 56 place count 612 transition count 1099
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 608 transition count 1077
Ensure Unique test removed 1 places
Iterating global reduction 2 with 5 rules applied. Total rules applied 65 place count 607 transition count 1077
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 607 transition count 1075
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 606 transition count 1075
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 69 place count 605 transition count 1067
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 605 transition count 1067
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 604 transition count 1059
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 604 transition count 1059
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 73 place count 603 transition count 1051
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 place count 603 transition count 1051
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 75 place count 602 transition count 1043
Iterating global reduction 4 with 1 rules applied. Total rules applied 76 place count 602 transition count 1043
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 77 place count 601 transition count 1035
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 601 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 79 place count 600 transition count 1027
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 600 transition count 1027
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 81 place count 599 transition count 1019
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 599 transition count 1019
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 598 transition count 1011
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 598 transition count 1011
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 597 transition count 1003
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 597 transition count 1003
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 87 place count 596 transition count 995
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 596 transition count 995
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 89 place count 595 transition count 987
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 595 transition count 987
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 91 place count 594 transition count 979
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 594 transition count 979
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 593 transition count 971
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 593 transition count 971
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 95 place count 592 transition count 963
Iterating global reduction 4 with 1 rules applied. Total rules applied 96 place count 592 transition count 963
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 97 place count 591 transition count 955
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 591 transition count 955
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 590 transition count 947
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 590 transition count 947
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 108 place count 586 transition count 943
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 110 place count 586 transition count 943
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 585 transition count 942
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 117 place count 579 transition count 942
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 117 place count 579 transition count 930
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 25 rules applied. Total rules applied 142 place count 566 transition count 930
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 5 with 4 rules applied. Total rules applied 146 place count 562 transition count 930
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 146 place count 562 transition count 929
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 148 place count 561 transition count 929
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 156 place count 557 transition count 925
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 159 place count 554 transition count 922
Iterating global reduction 6 with 3 rules applied. Total rules applied 162 place count 554 transition count 922
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 165 place count 554 transition count 919
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 168 place count 551 transition count 919
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 171 place count 551 transition count 919
Applied a total of 171 rules in 516 ms. Remains 551 /643 variables (removed 92) and now considering 919/1124 (removed 205) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 516 ms. Remains : 551/643 places, 919/1124 transitions.
RANDOM walk for 40000 steps (551 resets) in 215 ms. (185 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (152 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 419592 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 1
Probabilistic random walk after 419592 steps, saw 163637 distinct states, run finished after 3017 ms. (steps per millisecond=139 ) 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-13436366064685144652.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2201428042252007866.kers'
[2026-05-22 17:50:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13436366064685144652.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2201428042252007866.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 919 rows 542 cols 3594 entries
Finished phase 1 with 169 SingleSign rule and 284 generalized
[2026-05-22 17:50:04] [INFO ] Computed 98 invariants in 6 ms
Computed 98 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-2201428042252007866.kers
Total runtime 9 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/21 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 64/85 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/151 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/179 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/183 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 110/293 variables, 27/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/293 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 45/338 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/338 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 11/349 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/349 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/484 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/484 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 11/495 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/495 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 55/550 variables, 23/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/550 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1/551 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/551 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 919/1470 variables, 551/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1470 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1470 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1470/1470 variables, and 649 constraints, problems are : Problem set: 0 solved, 1 unsolved in 811 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 551/551 constraints, PredecessorRefiner: 1/1 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/21 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 64/85 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/151 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/179 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/183 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 110/293 variables, 27/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/293 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 45/338 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/338 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 11/349 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/349 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 135/484 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/484 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 11/495 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/495 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 55/550 variables, 23/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/550 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1/551 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/551 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 919/1470 variables, 551/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1470 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1470 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/1470 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1470/1470 variables, and 650 constraints, problems are : Problem set: 0 solved, 1 unsolved in 705 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 551/551 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1560ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 2 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 919/919 transitions.
Applied a total of 0 rules in 14 ms. Remains 551 /551 variables (removed 0) and now considering 919/919 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 551/551 places, 919/919 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 919/919 transitions.
Applied a total of 0 rules in 29 ms. Remains 551 /551 variables (removed 0) and now considering 919/919 (removed 0) transitions.
[2026-05-22 17:50:05] [INFO ] Invariant cache hit.
[2026-05-22 17:50:06] [INFO ] Implicit Places using invariants in 540 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 150, 168, 186, 255, 259, 260, 271, 272, 273, 291, 309, 378, 382, 383, 386, 397, 398, 399, 417, 419, 422, 440, 441, 442, 443, 455, 461, 467, 473, 479, 485, 491, 497, 503, 509, 515]
[2026-05-22 17:50:06] [INFO ] Actually due to overlaps returned [417, 399, 30, 48, 150, 168, 273, 291, 422, 149, 272, 398, 441, 148, 271, 397, 419, 440, 0, 259, 260, 382, 383, 18, 19, 66, 186, 309, 443, 485, 503, 515, 386, 442, 455, 461, 467, 473, 479, 491, 497, 509]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 553 ms to find 42 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 509/551 places, 919/919 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 506 transition count 842
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 157 place count 429 transition count 842
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 157 place count 429 transition count 823
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 196 place count 409 transition count 823
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 208 place count 405 transition count 815
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 216 place count 397 transition count 815
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 231 place count 382 transition count 800
Iterating global reduction 4 with 15 rules applied. Total rules applied 246 place count 382 transition count 800
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 249 place count 382 transition count 797
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 249 place count 382 transition count 796
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 251 place count 381 transition count 796
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 254 place count 378 transition count 793
Iterating global reduction 5 with 3 rules applied. Total rules applied 257 place count 378 transition count 793
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 258 place count 377 transition count 792
Iterating global reduction 5 with 1 rules applied. Total rules applied 259 place count 377 transition count 792
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 260 place count 376 transition count 791
Iterating global reduction 5 with 1 rules applied. Total rules applied 261 place count 376 transition count 791
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 325 place count 344 transition count 759
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 328 place count 344 transition count 756
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 331 place count 341 transition count 753
Iterating global reduction 6 with 3 rules applied. Total rules applied 334 place count 341 transition count 753
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 337 place count 341 transition count 750
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 343 place count 341 transition count 744
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 350 place count 334 transition count 744
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 360 place count 334 transition count 744
Applied a total of 360 rules in 234 ms. Remains 334 /509 variables (removed 175) and now considering 744/919 (removed 175) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14114904590247728049.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-967245440258906872.kers'
[2026-05-22 17:50:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14114904590247728049.kers, --Pflows, --basisKERS=/tmp/petrispot-output-967245440258906872.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 744 rows 333 cols 3028 entries
Finished phase 1 with 137 SingleSign rule and 150 generalized
[2026-05-22 17:50:06] [INFO ] Computed 47 invariants in 4 ms
Computed 47 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-967245440258906872.kers
Total runtime 5 ms.
[2026-05-22 17:50:06] [INFO ] Implicit Places using invariants in 258 ms returned [72, 89, 95, 98, 100, 101, 104, 105, 157, 174, 180, 183, 185, 190, 191, 243, 260, 266, 269, 271]
[2026-05-22 17:50:06] [INFO ] Actually due to overlaps returned [104, 190, 105, 191, 89, 95, 100, 101, 174, 180, 185, 260, 266, 271, 72, 157, 243]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 262 ms to find 17 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 317/551 places, 744/919 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 305 transition count 732
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 305 transition count 732
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 302 transition count 729
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 302 transition count 729
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 42 place count 296 transition count 723
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 51 place count 296 transition count 714
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 60 place count 287 transition count 714
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 287 transition count 711
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 66 place count 284 transition count 711
Applied a total of 66 rules in 70 ms. Remains 284 /317 variables (removed 33) and now considering 711/744 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-290490767889098325.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8658375344575549269.kers'
[2026-05-22 17:50:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-290490767889098325.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8658375344575549269.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 711 rows 284 cols 2905 entries
Finished phase 1 with 101 SingleSign rule and 153 generalized
[2026-05-22 17:50:07] [INFO ] Computed 30 invariants in 3 ms
Computed 30 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-8658375344575549269.kers
Total runtime 10 ms.
[2026-05-22 17:50:07] [INFO ] Implicit Places using invariants in 400 ms returned []
[2026-05-22 17:50:07] [INFO ] Invariant cache hit.
[2026-05-22 17:50:08] [INFO ] Implicit Places using invariants and state equation in 832 ms returned []
Implicit Place search using SMT with State Equation took 1236 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 284/551 places, 711/919 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2385 ms. Remains : 284/551 places, 711/919 transitions.
RANDOM walk for 40000 steps (860 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (288 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 808 steps, run visited all 1 properties in 6 ms. (steps per millisecond=134 )
Probabilistic random walk after 808 steps, saw 577 distinct states, run finished after 11 ms. (steps per millisecond=73 ) properties seen :1
FORMULA ASLink-PT-03a-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 32484 ms.

BK_STOP 1779472208368

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-03a"
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-03a, 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-177944366200319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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