Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r082-smll-177946993700374.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 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 DES-PT-10b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993700374
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 6.1K Mar 6 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 6 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 6 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Mar 6 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 15 08:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 15 08:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 6 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Mar 6 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 6 18:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 6 18:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:57 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 79K 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 DES-PT-10b-ReachabilityCardinality-2024-00
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-01
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-02
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-03
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-04
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-05
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-06
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-07
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-08
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-09
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-10
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-11
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-12
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-13
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-14
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779678160397

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-25 03:02:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 03:02:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 03:02:43] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2026-05-25 03:02:43] [INFO ] Transformed 320 places.
[2026-05-25 03:02:43] [INFO ] Transformed 271 transitions.
[2026-05-25 03:02:43] [INFO ] Found NUPN structural information;
[2026-05-25 03:02:43] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 431 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 51 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-10b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (332 resets) in 3127 ms. (12 steps per ms) remains 4/12 properties
FORMULA DES-PT-10b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (46 resets) in 356 ms. (112 steps per ms) remains 4/4 properties
[2026-05-25 03:02:45] [INFO ] Flatten gal took : 214 ms
[2026-05-25 03:02:45] [INFO ] Flatten gal took : 76 ms
[2026-05-25 03:02:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2227526883814862112.gal : 67 ms
[2026-05-25 03:02:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5307588712042920233.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2227526883814862112.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5307588712042920233.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (57 resets) in 1455 ms. (27 steps per ms) remains 3/4 properties
FORMULA DES-PT-10b-ReachabilityCardinality-2024-08 FALSE 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 ...328
Loading property file /tmp/ReachabilityCardinality5307588712042920233.prop.
BEST_FIRST walk for 40003 steps (43 resets) in 1111 ms. (35 steps per ms) remains 3/3 properties
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :4 after 13
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :13 after 15
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :15 after 19
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :19 after 89
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :89 after 227
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :227 after 3799
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :3799 after 81955
BEST_FIRST walk for 40003 steps (43 resets) in 262 ms. (152 steps per ms) remains 3/3 properties
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :81955 after 244663
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16292660337766503331.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11328642294437869252.kers'
[2026-05-25 03:02:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16292660337766503331.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11328642294437869252.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 271 rows 320 cols 827 entries
Finished phase 1 with 171 SingleSign rule and 84 generalized
[2026-05-25 03:02:46] [INFO ] Computed 65 invariants in 2 ms
Computed 65 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11328642294437869252.kers
Total runtime 4 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 217/268 variables, 39/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 217/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 5/273 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 5/316 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 47/320 variables, 22/338 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 47/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 271/591 variables, 320/705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/591 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/591 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 591/591 variables, and 705 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3230 ms.
Refiners :[Domain max(s): 320/320 constraints, Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 217/268 variables, 39/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 217/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 4/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 5/273 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 5/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem DES-PT-10b-ReachabilityCardinality-2024-13 is UNSAT
FORMULA DES-PT-10b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (OVERLAPS) 47/320 variables, 22/342 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 47/389 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/320 variables, 6/395 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/320 variables, 0/395 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 271/591 variables, 320/715 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/591 variables, 1/716 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/591 variables, 0/716 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/591 variables, 0/716 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 591/591 variables, and 716 constraints, problems are : Problem set: 1 solved, 2 unsolved in 3479 ms.
Refiners :[Domain max(s): 320/320 constraints, Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6851ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 1068 ms.
Support contains 36 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 271/271 transitions.
Graph (complete) has 621 edges and 320 vertex of which 314 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 314 transition count 255
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 303 transition count 253
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 301 transition count 253
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 28 place count 301 transition count 246
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 42 place count 294 transition count 246
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 56 place count 280 transition count 232
Iterating global reduction 3 with 14 rules applied. Total rules applied 70 place count 280 transition count 232
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 81 place count 269 transition count 221
Iterating global reduction 3 with 11 rules applied. Total rules applied 92 place count 269 transition count 221
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 12 rules applied. Total rules applied 104 place count 269 transition count 209
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 107 place count 267 transition count 208
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 107 place count 267 transition count 207
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 109 place count 266 transition count 207
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 5 with 116 rules applied. Total rules applied 225 place count 208 transition count 149
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 233 place count 204 transition count 155
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 235 place count 204 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 237 place count 202 transition count 153
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 238 place count 202 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 239 place count 201 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 240 place count 200 transition count 151
Applied a total of 240 rules in 420 ms. Remains 200 /320 variables (removed 120) and now considering 151/271 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 457 ms. Remains : 200/320 places, 151/271 transitions.
RANDOM walk for 40000 steps (785 resets) in 967 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (141 resets) in 436 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (141 resets) in 652 ms. (61 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 731547 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :0 out of 2
Probabilistic random walk after 731547 steps, saw 137431 distinct states, run finished after 3010 ms. (steps per millisecond=243 ) 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-8453024145047059432.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8460355669532678130.kers'
[2026-05-25 03:02:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8453024145047059432.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8460355669532678130.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 151 rows 191 cols 606 entries
Finished phase 1 with 62 SingleSign rule and 74 generalized
[2026-05-25 03:02:58] [INFO ] Computed 64 invariants in 1 ms
Computed 64 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8460355669532678130.kers
Total runtime 2 ms.
[2026-05-25 03:02:58] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 111/147 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/151 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/189 variables, 22/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/195 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/199 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 151/350 variables, 199/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 12/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/350 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/351 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/351 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/351 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 276 constraints, problems are : Problem set: 0 solved, 2 unsolved in 592 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 200/200 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 111/147 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/151 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 38/189 variables, 22/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/195 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/199 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 151/350 variables, 199/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 12/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/350 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/350 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/351 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/351 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/351 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/351 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 285 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2022 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 200/200 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 2667ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
FORMULA DES-PT-10b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 143 ms.
Support contains 33 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 151/151 transitions.
Graph (complete) has 477 edges and 200 vertex of which 195 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) 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 0 with 2 rules applied. Total rules applied 3 place count 195 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 194 transition count 148
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 194 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 193 transition count 147
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 7 place count 193 transition count 147
Applied a total of 7 rules in 49 ms. Remains 193 /200 variables (removed 7) and now considering 147/151 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 193/200 places, 147/151 transitions.
RANDOM walk for 40000 steps (780 resets) in 255 ms. (156 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (135 resets) in 321 ms. (124 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1140148 steps, run timeout after 3001 ms. (steps per millisecond=379 ) properties seen :0 out of 1
Probabilistic random walk after 1140148 steps, saw 211252 distinct states, run finished after 3016 ms. (steps per millisecond=378 ) 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-9876293673981191634.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12491343900941255782.kers'
[2026-05-25 03:03:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9876293673981191634.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12491343900941255782.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 147 rows 184 cols 592 entries
Finished phase 1 with 90 SingleSign rule and 42 generalized
[2026-05-25 03:03:04] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12491343900941255782.kers
Total runtime 2 ms.
[2026-05-25 03:03:04] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/111 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/115 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/176 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/182 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 147/329 variables, 182/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 13/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/329 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/340 variables, 11/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/340 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/340 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 920 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 193/193 constraints, ReadFeed: 13/13 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/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/111 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :244663 after 1.654e+08
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4/115 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 61/176 variables, 23/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/182 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 147/329 variables, 182/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/329 variables, 13/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/340 variables, 11/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/340 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/340 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 272 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1373 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 193/193 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2327ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 119 ms.
Support contains 33 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 147/147 transitions.
Applied a total of 0 rules in 9 ms. Remains 193 /193 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 193/193 places, 147/147 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 147/147 transitions.
Applied a total of 0 rules in 8 ms. Remains 193 /193 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2026-05-25 03:03:06] [INFO ] Invariant cache hit.
[2026-05-25 03:03:07] [INFO ] Implicit Places using invariants in 261 ms returned []
[2026-05-25 03:03:07] [INFO ] Invariant cache hit.
[2026-05-25 03:03:07] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 03:03:07] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
[2026-05-25 03:03:07] [INFO ] Redundant transitions in 4 ms returned []
Running 143 sub problems to find dead transitions.
[2026-05-25 03:03:07] [INFO ] Invariant cache hit.
[2026-05-25 03:03:07] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 3/192 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 143 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 147/339 variables, 192/253 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 13/266 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 1/340 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 143 unsolved
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1.654e+08 after 3.85919e+08
At refinement iteration 12 (OVERLAPS) 0/340 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 268 constraints, problems are : Problem set: 0 solved, 143 unsolved in 17968 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 193/193 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 3/192 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 15/77 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (OVERLAPS) 147/339 variables, 192/269 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 13/282 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 143/425 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 4/429 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/339 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 339/340 variables, and 430 constraints, problems are : Problem set: 0 solved, 143 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 192/193 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48076ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 48079ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48812 ms. Remains : 193/193 places, 147/147 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 456 edges and 193 vertex of which 192 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
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 2 place count 192 transition count 147
Applied a total of 2 rules in 15 ms. Remains 192 /193 variables (removed 1) and now considering 147/147 (removed 0) 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-2674494957437569465.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15193178896227544314.kers'
[2026-05-25 03:03:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2674494957437569465.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15193178896227544314.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 147 rows 183 cols 593 entries
Finished phase 1 with 79 SingleSign rule and 53 generalized
[2026-05-25 03:03:55] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15193178896227544314.kers
Total runtime 2 ms.
[2026-05-25 03:03:55] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 03:03:55] [INFO ] [Nat]Absence check using 37 positive place invariants in 10 ms returned sat
[2026-05-25 03:03:55] [INFO ] [Nat]Absence check using 37 positive and 23 generalized place invariants in 11 ms returned sat
[2026-05-25 03:03:55] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 03:03:56] [INFO ] After 235ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 03:03:56] [INFO ] After 379ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-25 03:03:56] [INFO ] Flatten gal took : 44 ms
[2026-05-25 03:03:56] [INFO ] Flatten gal took : 45 ms
[2026-05-25 03:03:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2167864074510189907.gal : 6 ms
[2026-05-25 03:03:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6477659650823253603.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/ReachabilityCardinality2167864074510189907.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6477659650823253603.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6477659650823253603.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 11
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :11 after 21
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :21 after 117
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :117 after 2991
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2991 after 5801
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5801 after 15328
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :15328 after 238034
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :238034 after 6.21632e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6.21632e+06 after 8.88932e+07
Detected timeout of ITS tools.
[2026-05-25 03:04:11] [INFO ] Flatten gal took : 23 ms
[2026-05-25 03:04:11] [INFO ] Applying decomposition
[2026-05-25 03:04:11] [INFO ] Flatten gal took : 18 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/graph2317797111443091407.txt' '-o' '/tmp/graph2317797111443091407.bin' '-w' '/tmp/graph2317797111443091407.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2317797111443091407.bin' '-l' '-1' '-v' '-w' '/tmp/graph2317797111443091407.weights' '-q' '0' '-e' '0.001'
[2026-05-25 03:04:11] [INFO ] Decomposing Gal with order
[2026-05-25 03:04:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 03:04:11] [INFO ] Removed a total of 59 redundant transitions.
[2026-05-25 03:04:11] [INFO ] Flatten gal took : 102 ms
[2026-05-25 03:04:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 14 ms.
[2026-05-25 03:04:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10546819321385118060.gal : 8 ms
[2026-05-25 03:04:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11816296434058874395.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/ReachabilityCardinality10546819321385118060.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11816296434058874395.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 ...309
Loading property file /tmp/ReachabilityCardinality11816296434058874395.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :10 after 34
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :34 after 1026
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1026 after 530046
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :6.98729e+06 after 2.57464e+07
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :9.01576e+07 after 2.26717e+12
Reachability property DES-PT-10b-ReachabilityCardinality-2024-12 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 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,4.61014e+14,12.2033,95588,10772,404,275244,2391,409,216520,175,8142,0
Total reachable state count : 461014047445926

Verifying 1 reachability properties.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31157 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 03:04:26] [INFO ] Flatten gal took : 19 ms
[2026-05-25 03:04:26] [INFO ] Applying decomposition
[2026-05-25 03:04:26] [INFO ] Flatten gal took : 19 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/graph5796671796144594864.txt' '-o' '/tmp/graph5796671796144594864.bin' '-w' '/tmp/graph5796671796144594864.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5796671796144594864.bin' '-l' '-1' '-v' '-w' '/tmp/graph5796671796144594864.weights' '-q' '0' '-e' '0.001'
[2026-05-25 03:04:26] [INFO ] Decomposing Gal with order
[2026-05-25 03:04:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 03:04:26] [INFO ] Removed a total of 32 redundant transitions.
[2026-05-25 03:04:26] [INFO ] Flatten gal took : 46 ms
[2026-05-25 03:04:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2026-05-25 03:04:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8629253288084935735.gal : 11 ms
[2026-05-25 03:04:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7373625761725650380.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/ReachabilityCardinality8629253288084935735.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7373625761725650380.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality7373625761725650380.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 25
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :25 after 1123
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1123 after 600409
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :600409 after 3.10718e+08
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3.10718e+08 after 4.25525e+11
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.99163e+17 after 2.65306e+17
Detected timeout of ITS tools.
[2026-05-25 03:34:27] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8479600173827706322
[2026-05-25 03:34:27] [INFO ] Computing symmetric may disable matrix : 147 transitions.
[2026-05-25 03:34:27] [INFO ] Applying decomposition
[2026-05-25 03:34:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 03:34:27] [INFO ] Computing symmetric may enable matrix : 147 transitions.
[2026-05-25 03:34:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 03:34:27] [INFO ] Flatten gal took : 15 ms
[2026-05-25 03:34:27] [INFO ] Computing Do-Not-Accords matrix : 147 transitions.
[2026-05-25 03:34:27] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 03:34:27] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8479600173827706322
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/graph1936606243785457566.txt' '-o' '/tmp/graph1936606243785457566.bin' '-w' '/tmp/graph1936606243785457566.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1936606243785457566.bin' '-l' '-1' '-v' '-w' '/tmp/graph1936606243785457566.weights' '-q' '0' '-e' '0.001'
Running compilation step : cd /tmp/ltsmin8479600173827706322;'/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'
[2026-05-25 03:34:27] [INFO ] Decomposing Gal with order
[2026-05-25 03:34:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 03:34:27] [INFO ] Removed a total of 89 redundant transitions.
[2026-05-25 03:34:27] [INFO ] Flatten gal took : 33 ms
[2026-05-25 03:34:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 7 ms.
[2026-05-25 03:34:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7768333277927167136.gal : 6 ms
[2026-05-25 03:34:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11142990791058475440.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/ReachabilityCardinality7768333277927167136.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11142990791058475440.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/ReachabilityCardinality11142990791058475440.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 24
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :24 after 54
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :54 after 342
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :342 after 2.65035e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.65035e+06 after 1.79623e+07
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.79623e+07 after 2.2189e+10
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.2189e+10 after 2.27804e+11
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.27804e+11 after 3.90446e+11
Compilation finished in 669 ms.
Running link step : cd /tmp/ltsmin8479600173827706322;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin8479600173827706322;'/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' 'DESPT10bReachabilityCardinality202412==true'
Reachability property DES-PT-10b-ReachabilityCardinality-2024-12 is true.
FORMULA DES-PT-10b-ReachabilityCardinality-2024-12 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 513 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,3.76303e+14,22.5732,43856,3635,544,100595,4414,389,85975,175,24717,0
Total reachable state count : 376303097447890

Verifying 1 reachability properties.
Reachability property DES-PT-10b-ReachabilityCardinality-2024-12 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
DES-PT-10b-ReachabilityCardinality-2024-12,2304,43.3465,44096,75,88,100595,4414,531,85975,208,24717,0
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1947390 ms.

BK_STOP 1779680110711

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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 ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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