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.r034-tall-177946842000566.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 BusinessProcesses-PT-15, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842000566
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.6K Mar 5 17:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 5 17:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 5 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 5 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Mar 5 17:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 5 17:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Mar 5 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 5 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 157K 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 BusinessProcesses-PT-15-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779623966044

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-24 11:59:27] [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-24 11:59:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 11:59:27] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2026-05-24 11:59:27] [INFO ] Transformed 630 places.
[2026-05-24 11:59:27] [INFO ] Transformed 566 transitions.
[2026-05-24 11:59:27] [INFO ] Found NUPN structural information;
[2026-05-24 11:59:27] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (269 resets) in 1395 ms. (28 steps per ms) remains 6/12 properties
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 11:59:28] [INFO ] Flatten gal took : 156 ms
BEST_FIRST walk for 40003 steps (48 resets) in 254 ms. (156 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (47 resets) in 263 ms. (151 steps per ms) remains 6/6 properties
[2026-05-24 11:59:28] [INFO ] Flatten gal took : 122 ms
BEST_FIRST walk for 40002 steps (48 resets) in 145 ms. (273 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (46 resets) in 175 ms. (227 steps per ms) remains 5/6 properties
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2026-05-24 11:59:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2733872104302667535.gal : 52 ms
[2026-05-24 11:59:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8184253818620620209.prop : 30 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/ReachabilityCardinality2733872104302667535.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8184253818620620209.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (47 resets) in 411 ms. (97 steps per ms) remains 5/5 properties

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
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17952692974971511475.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5804312948299989512.kers'
[2026-05-24 11:59:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17952692974971511475.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5804312948299989512.kers]
Loading property file /tmp/ReachabilityCardinality8184253818620620209.prop.
Culled 0 columns in 0 ms.
// Phase 1: matrix 562 rows 626 cols 1658 entries
Finished phase 1 with 446 SingleSign rule and 78 generalized
[2026-05-24 11:59:28] [INFO ] Computed 102 invariants in 4 ms
Computed 102 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-5804312948299989512.kers
Total runtime 7 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
SDD proceeding with computation,5 properties remain. new max is 4
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD size :1 after 5
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :19 after 30
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :30 after 65
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :65 after 113
At refinement iteration 2 (OVERLAPS) 332/377 variables, 61/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 332/438 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :113 after 8179
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 110/487 variables, 23/461 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 110/571 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 137/624 variables, 17/588 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/624 variables, 137/725 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/624 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2/626 variables, 1/726 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/626 variables, 2/728 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/626 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 562/1188 variables, 626/1354 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1188 variables, 0/1354 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/1188 variables, 0/1354 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1188/1188 variables, and 1354 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3283 ms.
Refiners :[Domain max(s): 626/626 constraints, Positive P Invariants (semi-flows): 84/84 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 332/377 variables, 61/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 332/438 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 4/442 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 110/487 variables, 23/465 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 110/575 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 11/586 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 137/624 variables, 17/603 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/624 variables, 137/740 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SMT process timed out in 8556ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 45 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 562/562 transitions.
Graph (trivial) has 308 edges and 626 vertex of which 4 / 626 are part of one of the 1 SCC in 1393 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1271 edges and 623 vertex of which 619 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 116 place count 619 transition count 443
Reduce places removed 114 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 123 rules applied. Total rules applied 239 place count 505 transition count 434
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 248 place count 496 transition count 434
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 248 place count 496 transition count 351
Deduced a syphon composed of 83 places in 1 ms
Ensure Unique test removed 14 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 428 place count 399 transition count 351
Discarding 67 places :
Symmetric choice reduction at 3 with 67 rule applications. Total rules 495 place count 332 transition count 284
Iterating global reduction 3 with 67 rules applied. Total rules applied 562 place count 332 transition count 284
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 562 place count 332 transition count 278
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 576 place count 324 transition count 278
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 750 place count 237 transition count 191
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 752 place count 237 transition count 189
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 754 place count 235 transition count 189
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 759 place count 235 transition count 189
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 760 place count 235 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 761 place count 234 transition count 188
Applied a total of 761 rules in 1566 ms. Remains 234 /626 variables (removed 392) and now considering 188/562 (removed 374) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1572 ms. Remains : 234/626 places, 188/562 transitions.
RANDOM walk for 40000 steps (1413 resets) in 920 ms. (43 steps per ms) remains 3/5 properties
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (260 resets) in 161 ms. (246 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (265 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (264 resets) in 182 ms. (218 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15442362467292650657.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15926260638370168683.kers'
[2026-05-24 11:59:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15442362467292650657.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15926260638370168683.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 188 rows 221 cols 830 entries
Finished phase 1 with 130 SingleSign rule and 21 generalized
[2026-05-24 11:59:38] [INFO ] Computed 83 invariants in 1 ms
Computed 83 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15926260638370168683.kers
Total runtime 5 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 109/144 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 23/167 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 43/210 variables, 15/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 4/214 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 4/218 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 188/406 variables, 218/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 16/422 variables, 16/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 7/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/422 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 317 constraints, problems are : Problem set: 0 solved, 3 unsolved in 585 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 234/234 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/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 109/144 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 23/167 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 43/210 variables, 15/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 4/214 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 15/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 10/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/214 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/214 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/214 variables, 20/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/214 variables, 12/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/214 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 4/218 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/218 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/218 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/218 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/218 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/218 variables, 7/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/218 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/218 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 188/406 variables, 218/449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/406 variables, 2/451 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/406 variables, 2/453 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/406 variables, 4/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/406 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 16/422 variables, 16/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/422 variables, 7/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/422 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/422 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/422 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 0/422 variables, 2/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/422 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 0/422 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 485 constraints, problems are : Problem set: 0 solved, 3 unsolved in 17541 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 164/164 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 18157ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 318 ms.
Support contains 35 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 188/188 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 234 transition count 184
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 230 transition count 184
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 230 transition count 182
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 226 transition count 182
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 218 transition count 176
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 217 transition count 175
Applied a total of 29 rules in 24 ms. Remains 217 /234 variables (removed 17) and now considering 175/188 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 217/234 places, 175/188 transitions.
RANDOM walk for 40000 steps (1549 resets) in 221 ms. (180 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (291 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (287 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (289 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1461064 steps, run timeout after 3001 ms. (steps per millisecond=486 ) properties seen :2 out of 3
Probabilistic random walk after 1461064 steps, saw 243761 distinct states, run finished after 3006 ms. (steps per millisecond=486 ) properties seen :2
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5693374388605604585.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15920083026420331906.kers'
[2026-05-24 12:00:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5693374388605604585.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15920083026420331906.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 0 ms.
// Phase 1: matrix 175 rows 197 cols 741 entries
Finished phase 1 with 98 SingleSign rule and 40 generalized
[2026-05-24 12:00:00] [INFO ] Computed 79 invariants in 1 ms
Computed 79 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15920083026420331906.kers
Total runtime 5 ms.
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) 97/130 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/140 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/182 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/186 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/189 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 175/364 variables, 189/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/364 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 28/392 variables, 28/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 13/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/392 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/392 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 296 constraints, problems are : Problem set: 0 solved, 1 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 217/217 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) 97/130 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/140 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 42/182 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/186 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/189 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 175/364 variables, 189/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/364 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/364 variables, 4/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 28/392 variables, 28/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/392 variables, 13/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/392 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/392 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/392 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 312 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1152 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 1418ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 33 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 175/175 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 217 transition count 174
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 216 transition count 174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 215 transition count 173
Applied a total of 4 rules in 20 ms. Remains 215 /217 variables (removed 2) and now considering 173/175 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 215/217 places, 173/175 transitions.
RANDOM walk for 40000 steps (1537 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (286 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1496213 steps, run timeout after 3001 ms. (steps per millisecond=498 ) properties seen :0 out of 1
Probabilistic random walk after 1496213 steps, saw 258513 distinct states, run finished after 3001 ms. (steps per millisecond=498 ) 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-15467664676536069143.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10925433558581132561.kers'
[2026-05-24 12:00:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15467664676536069143.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10925433558581132561.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 0 ms.
// Phase 1: matrix 173 rows 195 cols 737 entries
Finished phase 1 with 97 SingleSign rule and 39 generalized
[2026-05-24 12:00:05] [INFO ] Computed 79 invariants in 4 ms
Computed 79 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-10925433558581132561.kers
Total runtime 5 ms.
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) 96/129 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/139 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 44/183 variables, 17/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/187 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 173/360 variables, 187/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 28/388 variables, 28/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 13/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/388 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 294 constraints, problems are : Problem set: 0 solved, 1 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 215/215 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) 96/129 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 10/139 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 44/183 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/187 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 173/360 variables, 187/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/360 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 28/388 variables, 28/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/388 variables, 13/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/388 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/388 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/388 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 949ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 33 out of 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 173/173 transitions.
Applied a total of 0 rules in 6 ms. Remains 215 /215 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 215/215 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 173/173 transitions.
Applied a total of 0 rules in 6 ms. Remains 215 /215 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2026-05-24 12:00:06] [INFO ] Invariant cache hit.
[2026-05-24 12:00:06] [INFO ] Implicit Places using invariants in 193 ms returned [26, 28, 30, 32, 34, 36, 38, 40, 42, 54, 57, 58, 62, 74, 168]
[2026-05-24 12:00:06] [INFO ] Actually due to overlaps returned [26, 32, 36, 40, 54, 57, 62, 74, 168]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 202 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 206/215 places, 173/173 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 200 transition count 161
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 200 transition count 161
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 197 transition count 149
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 197 transition count 149
Applied a total of 18 rules in 16 ms. Remains 197 /206 variables (removed 9) and now considering 149/173 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9112480034526414719.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3420662870342743707.kers'
[2026-05-24 12:00:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9112480034526414719.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3420662870342743707.kers]
Culling duplicate invariants (modulo rational): removing 19 columns.
Culled 19 columns in 0 ms.
// Phase 1: matrix 149 rows 178 cols 588 entries
Finished phase 1 with 114 SingleSign rule and 13 generalized
[2026-05-24 12:00:06] [INFO ] Computed 70 invariants in 0 ms
Computed 70 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3420662870342743707.kers
Total runtime 1 ms.
[2026-05-24 12:00:06] [INFO ] Implicit Places using invariants in 131 ms returned [27, 29]
[2026-05-24 12:00:06] [INFO ] Actually due to overlaps returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 133 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 196/215 places, 149/173 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 194 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 194 transition count 144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 193 transition count 140
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 193 transition count 140
Applied a total of 6 rules in 13 ms. Remains 193 /196 variables (removed 3) and now considering 140/149 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7379863081155322646.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17042496080444512771.kers'
[2026-05-24 12:00:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7379863081155322646.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17042496080444512771.kers]
Culling duplicate invariants (modulo rational): removing 19 columns.
Culled 19 columns in 0 ms.
// Phase 1: matrix 140 rows 174 cols 542 entries
Finished phase 1 with 113 SingleSign rule and 11 generalized
[2026-05-24 12:00:06] [INFO ] Computed 69 invariants in 0 ms
Computed 69 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17042496080444512771.kers
Total runtime 1 ms.
[2026-05-24 12:00:06] [INFO ] Implicit Places using invariants in 106 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 107 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 192/215 places, 140/173 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 191 transition count 139
Applied a total of 2 rules in 12 ms. Remains 191 /192 variables (removed 1) and now considering 139/140 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15364279418409275448.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9609119874042130891.kers'
[2026-05-24 12:00:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15364279418409275448.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9609119874042130891.kers]
Culling duplicate invariants (modulo rational): removing 19 columns.
Culled 19 columns in 0 ms.
// Phase 1: matrix 139 rows 172 cols 532 entries
Finished phase 1 with 116 SingleSign rule and 7 generalized
[2026-05-24 12:00:06] [INFO ] Computed 68 invariants in 0 ms
Computed 68 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9609119874042130891.kers
Total runtime 1 ms.
[2026-05-24 12:00:06] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-24 12:00:06] [INFO ] Invariant cache hit.
[2026-05-24 12:00:07] [INFO ] Implicit Places using invariants and state equation in 382 ms returned [53, 85, 87, 91, 93, 96, 97, 99, 101, 106, 108, 110, 118, 119, 121, 123, 125, 127, 129]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 485 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 172/215 places, 139/173 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 172 transition count 136
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 169 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 167 transition count 134
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 12 place count 165 transition count 132
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 165 transition count 132
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 3 with 12 rules applied. Total rules applied 26 place count 159 transition count 126
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 159 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 28 place count 158 transition count 125
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 29 place count 158 transition count 125
Applied a total of 29 rules in 44 ms. Remains 158 /172 variables (removed 14) and now considering 125/139 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15871859078888098444.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14189315679926019893.kers'
[2026-05-24 12:00:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15871859078888098444.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14189315679926019893.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 125 rows 151 cols 454 entries
Finished phase 1 with 102 SingleSign rule and 7 generalized
[2026-05-24 12:00:07] [INFO ] Computed 49 invariants in 1 ms
Computed 49 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14189315679926019893.kers
Total runtime 1 ms.
[2026-05-24 12:00:07] [INFO ] Implicit Places using invariants in 76 ms returned [155]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 157/215 places, 125/173 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 156 transition count 124
Applied a total of 2 rules in 6 ms. Remains 156 /157 variables (removed 1) and now considering 124/125 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5759963159309686335.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4366370752466775342.kers'
[2026-05-24 12:00:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5759963159309686335.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4366370752466775342.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 124 rows 149 cols 450 entries
Finished phase 1 with 102 SingleSign rule and 6 generalized
[2026-05-24 12:00:07] [INFO ] Computed 48 invariants in 0 ms
Computed 48 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4366370752466775342.kers
Total runtime 1 ms.
[2026-05-24 12:00:07] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-24 12:00:07] [INFO ] Invariant cache hit.
[2026-05-24 12:00:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-24 12:00:07] [INFO ] Implicit Places using invariants and state equation in 333 ms returned [3, 6, 17, 18, 19, 26, 27, 28, 29, 31, 33, 35, 36, 37, 38, 39, 42]
Discarding 17 places :
Implicit Place search using SMT with State Equation took 417 ms to find 17 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 139/215 places, 124/173 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 137 transition count 116
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 137 transition count 116
Applied a total of 4 rules in 13 ms. Remains 137 /139 variables (removed 2) and now considering 116/124 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10866032982481265717.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16757030616921554945.kers'
[2026-05-24 12:00:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10866032982481265717.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16757030616921554945.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 116 rows 135 cols 368 entries
Finished phase 1 with 100 SingleSign rule and 6 generalized
[2026-05-24 12:00:07] [INFO ] Computed 31 invariants in 0 ms
Computed 31 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16757030616921554945.kers
Total runtime 1 ms.
[2026-05-24 12:00:07] [INFO ] Implicit Places using invariants in 69 ms returned [15, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 70 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 135/215 places, 116/173 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 135 transition count 114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 114
Applied a total of 4 rules in 30 ms. Remains 133 /135 variables (removed 2) and now considering 114/116 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-977300414321244601.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17975299903355065211.kers'
[2026-05-24 12:00:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-977300414321244601.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17975299903355065211.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 114 rows 131 cols 348 entries
Finished phase 1 with 99 SingleSign rule and 5 generalized
[2026-05-24 12:00:07] [INFO ] Computed 29 invariants in 0 ms
Computed 29 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17975299903355065211.kers
Total runtime 1 ms.
[2026-05-24 12:00:07] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-24 12:00:07] [INFO ] Invariant cache hit.
[2026-05-24 12:00:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 12:00:07] [INFO ] Implicit Places using invariants and state equation in 125 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 197 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 132/215 places, 114/173 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 129 transition count 111
Applied a total of 6 rules in 14 ms. Remains 129 /132 variables (removed 3) and now considering 111/114 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2261327100018755934.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12729455788237375630.kers'
[2026-05-24 12:00:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2261327100018755934.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12729455788237375630.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 111 rows 128 cols 342 entries
Finished phase 1 with 96 SingleSign rule and 5 generalized
[2026-05-24 12:00:07] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12729455788237375630.kers
Total runtime 1 ms.
[2026-05-24 12:00:07] [INFO ] Implicit Places using invariants in 63 ms returned [115, 120, 125]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 64 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 126/215 places, 111/173 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 109
Applied a total of 4 rules in 7 ms. Remains 124 /126 variables (removed 2) and now considering 109/111 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8582637920436794786.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7852991613260800608.kers'
[2026-05-24 12:00:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8582637920436794786.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7852991613260800608.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 109 rows 123 cols 332 entries
Finished phase 1 with 96 SingleSign rule and 3 generalized
[2026-05-24 12:00:08] [INFO ] Computed 25 invariants in 0 ms
Computed 25 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7852991613260800608.kers
Total runtime 0 ms.
[2026-05-24 12:00:08] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-24 12:00:08] [INFO ] Invariant cache hit.
[2026-05-24 12:00:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 12:00:08] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 124/215 places, 109/173 transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 2063 ms. Remains : 124/215 places, 109/173 transitions.
RANDOM walk for 40000 steps (1555 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (296 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2702376 steps, run timeout after 3001 ms. (steps per millisecond=900 ) properties seen :0 out of 1
Probabilistic random walk after 2702376 steps, saw 427988 distinct states, run finished after 3001 ms. (steps per millisecond=900 ) properties seen :0
[2026-05-24 12:00:11] [INFO ] Invariant cache hit.
[2026-05-24 12:00:11] [INFO ] State equation strengthened by 1 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) 57/90 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/100 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/108 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 106/214 variables, 108/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/233 variables, 16/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/233 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 124/124 constraints, ReadFeed: 1/1 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/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/90 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/100 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/108 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 106/214 variables, 108/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 19/233 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/233 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/233 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/233 variables, 4/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/233 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/233 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 699 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 124/124 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 862ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 33 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 124/124 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2026-05-24 12:00:12] [INFO ] Invariant cache hit.
[2026-05-24 12:00:12] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-24 12:00:12] [INFO ] Invariant cache hit.
[2026-05-24 12:00:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 12:00:12] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2026-05-24 12:00:12] [INFO ] Redundant transitions in 2 ms returned []
Running 104 sub problems to find dead transitions.
[2026-05-24 12:00:12] [INFO ] Invariant cache hit.
[2026-05-24 12:00:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 4/124 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 109/233 variables, 124/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 19/198 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 13 (OVERLAPS) 0/233 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 201 constraints, problems are : Problem set: 0 solved, 104 unsolved in 12291 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 124/124 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 4/124 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 14/74 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 109/233 variables, 124/198 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 104/303 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 3/306 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/233 variables, 6/315 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/233 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/233 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/233 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 233/233 variables, and 319 constraints, problems are : Problem set: 0 solved, 104 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 124/124 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 42323ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 42325ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42808 ms. Remains : 124/124 places, 109/109 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 254 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 123 transition count 106
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 120 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 119 transition count 105
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 9 place count 119 transition count 102
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 15 place count 116 transition count 102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 19 place count 114 transition count 100
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 114 transition count 99
Applied a total of 20 rules in 10 ms. Remains 114 /124 variables (removed 10) and now considering 99/109 (removed 10) 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-10314132192102766050.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14608838677322809642.kers'
[2026-05-24 12:00:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10314132192102766050.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14608838677322809642.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 99 rows 111 cols 301 entries
Finished phase 1 with 87 SingleSign rule and 3 generalized
[2026-05-24 12:00:54] [INFO ] Computed 24 invariants in 0 ms
Computed 24 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14608838677322809642.kers
Total runtime 1 ms.
[2026-05-24 12:00:54] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 12:00:54] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2026-05-24 12:00:54] [INFO ] [Nat]Absence check using 21 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-24 12:00:55] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 12:00:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-24 12:00:55] [INFO ] After 32ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 12:00:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 348 ms
TRAPS : Iteration 1
[2026-05-24 12:00:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
TRAPS : Iteration 2
[2026-05-24 12:00:55] [INFO ] After 614ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 12:00:55] [INFO ] After 744ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-24 12:00:55] [INFO ] Flatten gal took : 8 ms
[2026-05-24 12:00:55] [INFO ] Flatten gal took : 6 ms
[2026-05-24 12:00:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11488894723590496439.gal : 2 ms
[2026-05-24 12:00:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12247035231270492977.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/ReachabilityCardinality11488894723590496439.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12247035231270492977.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 ...330
Loading property file /tmp/ReachabilityCardinality12247035231270492977.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 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :13 after 25
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :25 after 293
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :293 after 530
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :530 after 783
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :783 after 1263
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1263 after 74881
Invariant property BusinessProcesses-PT-15-ReachabilityCardinality-2024-11 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 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,1.53891e+06,0.152475,9172,2,3078,16,25806,6,0,546,16793,0
Total reachable state count : 1538912

Verifying 1 reachability properties.
Invariant property BusinessProcesses-PT-15-ReachabilityCardinality-2024-11 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-15-ReachabilityCardinality-2024-11,816,0.188559,9308,2,232,16,25806,7,0,629,16793,0
Over-approximation ignoring read arcs solved 0 properties in 1018 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 12:00:55] [INFO ] Flatten gal took : 28 ms
[2026-05-24 12:00:55] [INFO ] Applying decomposition
[2026-05-24 12:00:55] [INFO ] Flatten gal took : 24 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/graph8229050586825207751.txt' '-o' '/tmp/graph8229050586825207751.bin' '-w' '/tmp/graph8229050586825207751.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8229050586825207751.bin' '-l' '-1' '-v' '-w' '/tmp/graph8229050586825207751.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:00:56] [INFO ] Decomposing Gal with order
[2026-05-24 12:00:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:00:56] [INFO ] Removed a total of 275 redundant transitions.
[2026-05-24 12:00:56] [INFO ] Flatten gal took : 87 ms
[2026-05-24 12:00:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 13 ms.
[2026-05-24 12:00:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16992691730114670626.gal : 12 ms
[2026-05-24 12:00:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12087798370602631002.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/ReachabilityCardinality16992691730114670626.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12087798370602631002.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/ReachabilityCardinality12087798370602631002.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 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 4411
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :4411 after 5152
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :5152 after 6833
Invariant property BusinessProcesses-PT-15-ReachabilityCardinality-2024-11 does not hold.
FORMULA BusinessProcesses-PT-15-ReachabilityCardinality-2024-11 FALSE 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 65 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.85831e+23,1.73909,54940,5726,56,103011,882,1343,198048,74,2063,0
Total reachable state count : 485831245376205444415488

Verifying 1 reachability properties.
Invariant property BusinessProcesses-PT-15-ReachabilityCardinality-2024-11 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-15-ReachabilityCardinality-2024-11,3.89732e+20,2.08773,54940,451,30,103011,882,1505,198048,88,2063,0
All properties solved without resorting to model-checking.
Total runtime 91269 ms.

BK_STOP 1779624058482

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="BusinessProcesses-PT-15"
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 BusinessProcesses-PT-15, 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 r034-tall-177946842000566"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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