MCC'2026- Execution of r034-tall-177946842000567

About the Execution of ITS-Tools for BusinessProcesses-PT-15

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
936.523	398005.00	853689.00	6266.70	FFTTTTFTFTTTTFTF	normal

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-177946842000567.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842000567
=====================================================================

--------------------
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-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779624066500

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
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
ReachabilityFireability PT
Running Version 202604301425
[2026-05-24 12:01:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 12:01:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 12:01:07] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2026-05-24 12:01:07] [INFO ] Transformed 630 places.
[2026-05-24 12:01:07] [INFO ] Transformed 566 transitions.
[2026-05-24 12:01:07] [INFO ] Found NUPN structural information;
[2026-05-24 12:01:07] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 4 transitions.
[2026-05-24 12:01:08] [INFO ] Flatten gal took : 180 ms
RANDOM walk for 40000 steps (267 resets) in 1979 ms. (20 steps per ms) remains 13/16 properties
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 12:01:08] [INFO ] Flatten gal took : 70 ms
BEST_FIRST walk for 40003 steps (48 resets) in 300 ms. (132 steps per ms) remains 13/13 properties
[2026-05-24 12:01:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9335766840141220442.gal : 84 ms
BEST_FIRST walk for 40004 steps (46 resets) in 236 ms. (168 steps per ms) remains 13/13 properties
[2026-05-24 12:01:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1308227052489434852.prop : 7 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/ReachabilityCardinality9335766840141220442.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1308227052489434852.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1308227052489434852.prop.
BEST_FIRST walk for 40004 steps (58 resets) in 747 ms. (53 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (46 resets) in 156 ms. (254 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :19 after 30
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :30 after 65
BEST_FIRST walk for 40004 steps (48 resets) in 283 ms. (140 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :65 after 113
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :113 after 8179
BEST_FIRST walk for 40004 steps (48 resets) in 171 ms. (232 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (65 resets) in 169 ms. (235 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (46 resets) in 157 ms. (253 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (46 resets) in 878 ms. (45 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (47 resets) in 140 ms. (283 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (46 resets) in 198 ms. (201 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (55 resets) in 215 ms. (185 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (48 resets) in 142 ms. (279 steps per ms) remains 13/13 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16701975528590242185.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4411884747820091258.kers'
[2026-05-24 12:01:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16701975528590242185.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4411884747820091258.kers]
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 12:01:09] [INFO ] Computed 102 invariants in 3 ms
Computed 102 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4411884747820091258.kers
Total runtime 5 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 212/212 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 326/538 variables, 84/296 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/538 variables, 326/622 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 88/626 variables, 18/640 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SMT process timed out in 5130ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 212 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 562/562 transitions.
Graph (complete) has 1275 edges and 626 vertex of which 622 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 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 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 622 transition count 527
Reduce places removed 34 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 47 rules applied. Total rules applied 82 place count 588 transition count 514
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 95 place count 575 transition count 514
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 95 place count 575 transition count 447
Deduced a syphon composed of 67 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 139 rules applied. Total rules applied 234 place count 503 transition count 447
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 281 place count 456 transition count 400
Iterating global reduction 3 with 47 rules applied. Total rules applied 328 place count 456 transition count 400
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 398 place count 421 transition count 365
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 401 place count 421 transition count 365
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 402 place count 420 transition count 364
Applied a total of 402 rules in 176 ms. Remains 420 /626 variables (removed 206) and now considering 364/562 (removed 198) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 420/626 places, 364/562 transitions.
RANDOM walk for 40000 steps (406 resets) in 504 ms. (79 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (88 resets) in 200 ms. (199 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (80 resets) in 171 ms. (232 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (103 resets) in 264 ms. (150 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (80 resets) in 170 ms. (233 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (80 resets) in 189 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (84 resets) in 112 ms. (354 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (108 resets) in 165 ms. (240 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (83 resets) in 134 ms. (296 steps per ms) remains 12/13 properties
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (76 resets) in 219 ms. (181 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (85 resets) in 87 ms. (454 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (82 resets) in 181 ms. (219 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (95 resets) in 167 ms. (238 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (82 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 505660 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :4 out of 12
Probabilistic random walk after 505660 steps, saw 84026 distinct states, run finished after 3006 ms. (steps per millisecond=168 ) properties seen :4
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-00 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-10955629034334423305.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1058752974709690195.kers'
[2026-05-24 12:01:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10955629034334423305.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1058752974709690195.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 420 cols 1261 entries
Finished phase 1 with 251 SingleSign rule and 75 generalized
[2026-05-24 12:01:19] [INFO ] Computed 94 invariants in 2 ms
Computed 94 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1058752974709690195.kers
Total runtime 4 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 169/378 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem BusinessProcesses-PT-15-ReachabilityFireability-2024-06 is UNSAT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 39/417 variables, 19/94 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 364/781 variables, 417/511 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/781 variables, 0/511 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 3/784 variables, 3/514 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/784 variables, 0/514 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/784 variables, 0/514 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 784/784 variables, and 514 constraints, problems are : Problem set: 1 solved, 7 unsolved in 7893 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 8/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 171/378 variables, 75/75 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 20/95 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 6/101 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem BusinessProcesses-PT-15-ReachabilityFireability-2024-10 is UNSAT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-15-ReachabilityFireability-2024-12 is UNSAT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 39/417 variables, 19/120 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem BusinessProcesses-PT-15-ReachabilityFireability-2024-08 is UNSAT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 20/140 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 20/160 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 20/180 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 20/200 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Problem BusinessProcesses-PT-15-ReachabilityFireability-2024-11 is UNSAT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 13/213 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 6/219 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 20/239 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 20/259 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/417 variables, 20/279 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/417 variables, 1/280 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 2/282 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/417 variables, 0/282 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 364/781 variables, 417/699 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/781 variables, 1/700 constraints. Problems are: Problem set: 5 solved, 3 unsolved
Problem BusinessProcesses-PT-15-ReachabilityFireability-2024-13 is UNSAT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 20 (INCLUDED_ONLY) 0/781 variables, 4/704 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/781 variables, 1/705 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/781 variables, 1/706 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/781 variables, 0/706 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 3/784 variables, 3/709 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/784 variables, 14/723 constraints. Problems are: Problem set: 6 solved, 2 unsolved
SMT process timed out in 52994ms, After SMT, problems are : Problem set: 6 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 364/364 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 420 transition count 350
Reduce places removed 14 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 18 rules applied. Total rules applied 32 place count 406 transition count 346
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 402 transition count 346
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 36 place count 402 transition count 298
Deduced a syphon composed of 48 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 105 rules applied. Total rules applied 141 place count 345 transition count 298
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 164 place count 322 transition count 275
Iterating global reduction 3 with 23 rules applied. Total rules applied 187 place count 322 transition count 275
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 93 rules applied. Total rules applied 280 place count 275 transition count 229
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 281 place count 275 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 282 place count 274 transition count 228
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 283 place count 274 transition count 228
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 284 place count 273 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 285 place count 272 transition count 227
Applied a total of 285 rules in 99 ms. Remains 272 /420 variables (removed 148) and now considering 227/364 (removed 137) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 272/420 places, 227/364 transitions.
RANDOM walk for 40000 steps (852 resets) in 378 ms. (105 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (244 resets) in 229 ms. (173 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (175 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 886467 steps, run timeout after 3001 ms. (steps per millisecond=295 ) properties seen :0 out of 2
Probabilistic random walk after 886467 steps, saw 132997 distinct states, run finished after 3001 ms. (steps per millisecond=295 ) 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-15879653094763088093.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15899823151860143228.kers'
[2026-05-24 12:02:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15879653094763088093.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15899823151860143228.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 227 rows 270 cols 940 entries
Finished phase 1 with 148 SingleSign rule and 41 generalized
[2026-05-24 12:02:15] [INFO ] Computed 83 invariants in 1 ms
Computed 83 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15899823151860143228.kers
Total runtime 2 ms.
[2026-05-24 12:02:15] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 146/227 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/229 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/267 variables, 18/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/269 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 227/496 variables, 269/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/499 variables, 3/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/499 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/499 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 358 constraints, problems are : Problem set: 0 solved, 2 unsolved in 760 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 272/272 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 146/227 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 7/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/229 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 38/267 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/269 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 12/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 6/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/269 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 227/496 variables, 269/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/496 variables, 3/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/496 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/496 variables, 4/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/496 variables, 20/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/496 variables, 20/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/496 variables, 11/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/496 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/496 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/496 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/496 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/496 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 3/499 variables, 3/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/499 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/499 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/499 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 469 constraints, problems are : Problem set: 0 solved, 2 unsolved in 13682 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 272/272 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 106/106 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 14459ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 318 ms.
Support contains 81 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 227/227 transitions.
Applied a total of 0 rules in 8 ms. Remains 272 /272 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 272/272 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 227/227 transitions.
Applied a total of 0 rules in 7 ms. Remains 272 /272 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2026-05-24 12:02:30] [INFO ] Invariant cache hit.
[2026-05-24 12:02:30] [INFO ] Implicit Places using invariants in 208 ms returned [29, 42, 44, 46, 51, 53, 55, 79, 81, 82, 83, 84, 95, 101, 210, 230]
[2026-05-24 12:02:30] [INFO ] Actually due to overlaps returned [29, 42, 51, 53, 79, 81, 82, 83, 95, 101, 210, 230]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 220 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 260/272 places, 227/227 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 257 transition count 224
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 257 transition count 224
Applied a total of 6 rules in 11 ms. Remains 257 /260 variables (removed 3) and now considering 224/227 (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-8106886297136457850.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8314093718537763256.kers'
[2026-05-24 12:02:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8106886297136457850.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8314093718537763256.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 224 rows 257 cols 894 entries
Finished phase 1 with 159 SingleSign rule and 27 generalized
[2026-05-24 12:02:30] [INFO ] Computed 71 invariants in 1 ms
Computed 71 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8314093718537763256.kers
Total runtime 2 ms.
[2026-05-24 12:02:30] [INFO ] Implicit Places using invariants in 141 ms returned [42, 44]
[2026-05-24 12:02:30] [INFO ] Actually due to overlaps returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 142 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 256/272 places, 224/227 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 255 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 255 transition count 223
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 7 place count 255 transition count 223
Applied a total of 7 rules in 20 ms. Remains 255 /256 variables (removed 1) and now considering 223/224 (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-11502734379048165347.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15118741762475138522.kers'
[2026-05-24 12:02:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11502734379048165347.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15118741762475138522.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 223 rows 255 cols 899 entries
Finished phase 1 with 159 SingleSign rule and 26 generalized
[2026-05-24 12:02:30] [INFO ] Computed 70 invariants in 1 ms
Computed 70 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15118741762475138522.kers
Total runtime 1 ms.
[2026-05-24 12:02:30] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-24 12:02:30] [INFO ] Invariant cache hit.
[2026-05-24 12:02:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-24 12:02:31] [INFO ] Implicit Places using invariants and state equation in 426 ms returned [82, 84]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 554 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 253/272 places, 223/227 transitions.
Applied a total of 0 rules in 15 ms. Remains 253 /253 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 970 ms. Remains : 253/272 places, 223/227 transitions.
RANDOM walk for 40000 steps (850 resets) in 209 ms. (190 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (231 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (174 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1079722 steps, run timeout after 3001 ms. (steps per millisecond=359 ) properties seen :0 out of 2
Probabilistic random walk after 1079722 steps, saw 158937 distinct states, run finished after 3001 ms. (steps per millisecond=359 ) 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-11100572572606537995.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2699833044992301288.kers'
[2026-05-24 12:02:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11100572572606537995.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2699833044992301288.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 223 rows 253 cols 894 entries
Finished phase 1 with 159 SingleSign rule and 26 generalized
[2026-05-24 12:02:34] [INFO ] Computed 68 invariants in 1 ms
Computed 68 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2699833044992301288.kers
Total runtime 3 ms.
[2026-05-24 12:02:34] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 132/213 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/215 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/250 variables, 11/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 223/473 variables, 250/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/476 variables, 3/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/476 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/476 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 324 constraints, problems are : Problem set: 0 solved, 2 unsolved in 676 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 253/253 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 132/213 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/215 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 35/250 variables, 11/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 15/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 223/473 variables, 250/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/473 variables, 3/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/473 variables, 9/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/473 variables, 20/414 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/473 variables, 20/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/473 variables, 10/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/473 variables, 3/447 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/473 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/473 variables, 7/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/473 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 3/476 variables, 3/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/476 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/476 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/476 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 476/476 variables, and 459 constraints, problems are : Problem set: 0 solved, 2 unsolved in 16444 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 253/253 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 131/131 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 17136ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 232 ms.
Support contains 81 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 223/223 transitions.
Applied a total of 0 rules in 6 ms. Remains 253 /253 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 253/253 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 223/223 transitions.
Applied a total of 0 rules in 6 ms. Remains 253 /253 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2026-05-24 12:02:51] [INFO ] Invariant cache hit.
[2026-05-24 12:02:51] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-24 12:02:51] [INFO ] Invariant cache hit.
[2026-05-24 12:02:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-24 12:02:52] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2026-05-24 12:02:52] [INFO ] Redundant transitions in 13 ms returned []
Running 220 sub problems to find dead transitions.
[2026-05-24 12:02:52] [INFO ] Invariant cache hit.
[2026-05-24 12:02:52] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 2/252 variables, 57/63 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 1/253 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 20/141 constraints. Problems are: Problem set: 9 solved, 211 unsolved
Problem TDEAD99 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 20/161 constraints. Problems are: Problem set: 12 solved, 208 unsolved
Problem TDEAD86 is UNSAT
Problem TDEAD86 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/253 variables, 20/181 constraints. Problems are: Problem set: 13 solved, 207 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/253 variables, 20/201 constraints. Problems are: Problem set: 13 solved, 207 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/253 variables, 20/221 constraints. Problems are: Problem set: 13 solved, 207 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/253 variables, 20/241 constraints. Problems are: Problem set: 13 solved, 207 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 253/476 variables, and 257 constraints, problems are : Problem set: 13 solved, 207 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/253 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 189/189 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 6/6 constraints. Problems are: Problem set: 13 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/6 constraints. Problems are: Problem set: 13 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 2/252 variables, 57/63 constraints. Problems are: Problem set: 13 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 2/65 constraints. Problems are: Problem set: 13 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 43/108 constraints. Problems are: Problem set: 13 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/108 constraints. Problems are: Problem set: 13 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 1/253 variables, 3/111 constraints. Problems are: Problem set: 13 solved, 207 unsolved
Problem TDEAD119 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 146/257 constraints. Problems are: Problem set: 14 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 20/277 constraints. Problems are: Problem set: 14 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 20/297 constraints. Problems are: Problem set: 14 solved, 206 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 20/317 constraints. Problems are: Problem set: 14 solved, 206 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/253 variables, 20/337 constraints. Problems are: Problem set: 14 solved, 206 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/253 variables, 20/357 constraints. Problems are: Problem set: 14 solved, 206 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/253 variables, 20/377 constraints. Problems are: Problem set: 14 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 253/476 variables, and 380 constraints, problems are : Problem set: 14 solved, 206 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/253 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/220 constraints, Known Traps: 312/312 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60074ms problems are : Problem set: 14 solved, 206 unsolved
Search for dead transitions found 14 dead transitions in 60076ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 253/253 places, 209/223 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 252 transition count 209
Applied a total of 1 rules in 15 ms. Remains 252 /253 variables (removed 1) and now considering 209/209 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9368670241118623777.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14433227783180856760.kers'
[2026-05-24 12:03:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9368670241118623777.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14433227783180856760.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 209 rows 252 cols 808 entries
Finished phase 1 with 160 SingleSign rule and 22 generalized
[2026-05-24 12:03:52] [INFO ] Computed 70 invariants in 2 ms
Computed 70 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14433227783180856760.kers
Total runtime 3 ms.
[2026-05-24 12:03:52] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-24 12:03:52] [INFO ] Invariant cache hit.
[2026-05-24 12:03:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-24 12:03:52] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 252/253 places, 209/223 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61175 ms. Remains : 252/253 places, 209/223 transitions.
RANDOM walk for 40000 steps (863 resets) in 219 ms. (181 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (235 resets) in 352 ms. (113 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (178 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1116713 steps, run timeout after 3001 ms. (steps per millisecond=372 ) properties seen :0 out of 2
Probabilistic random walk after 1116713 steps, saw 163968 distinct states, run finished after 3001 ms. (steps per millisecond=372 ) properties seen :0
[2026-05-24 12:03:56] [INFO ] Invariant cache hit.
[2026-05-24 12:03:56] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 131/212 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/214 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 35/249 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 209/458 variables, 249/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/461 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/461 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 325 constraints, problems are : Problem set: 0 solved, 2 unsolved in 891 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 252/252 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 131/212 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/214 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 35/249 variables, 13/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 209/458 variables, 249/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/458 variables, 3/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/458 variables, 20/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/458 variables, 20/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/458 variables, 17/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/458 variables, 4/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/458 variables, 20/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/458 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/458 variables, 17/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/458 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 3/461 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/461 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/461 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 461/461 variables, and 493 constraints, problems are : Problem set: 0 solved, 2 unsolved in 20135 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 252/252 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 164/164 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 21035ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 332 ms.
Support contains 81 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 209/209 transitions.
Applied a total of 0 rules in 12 ms. Remains 252 /252 variables (removed 0) and now considering 209/209 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 252/252 places, 209/209 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 209/209 transitions.
Applied a total of 0 rules in 11 ms. Remains 252 /252 variables (removed 0) and now considering 209/209 (removed 0) transitions.
[2026-05-24 12:04:17] [INFO ] Invariant cache hit.
[2026-05-24 12:04:17] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-24 12:04:17] [INFO ] Invariant cache hit.
[2026-05-24 12:04:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-24 12:04:18] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2026-05-24 12:04:18] [INFO ] Redundant transitions in 11 ms returned []
Running 206 sub problems to find dead transitions.
[2026-05-24 12:04:18] [INFO ] Invariant cache hit.
[2026-05-24 12:04:18] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 2/251 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 10/97 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (OVERLAPS) 1/252 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Problem TDEAD98 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD108 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/252 variables, 20/220 constraints. Problems are: Problem set: 2 solved, 204 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 20/240 constraints. Problems are: Problem set: 2 solved, 204 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 15 (INCLUDED_ONLY) 0/252 variables, 20/260 constraints. Problems are: Problem set: 2 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 252/461 variables, and 260 constraints, problems are : Problem set: 2 solved, 204 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/252 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 190/190 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 2/251 variables, 57/65 constraints. Problems are: Problem set: 2 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 2/67 constraints. Problems are: Problem set: 2 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 34/101 constraints. Problems are: Problem set: 2 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/101 constraints. Problems are: Problem set: 2 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 1/252 variables, 3/104 constraints. Problems are: Problem set: 2 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 156/260 constraints. Problems are: Problem set: 2 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 20/280 constraints. Problems are: Problem set: 2 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 20/300 constraints. Problems are: Problem set: 2 solved, 204 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 20/320 constraints. Problems are: Problem set: 2 solved, 204 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD190 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 20/340 constraints. Problems are: Problem set: 4 solved, 202 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 20/360 constraints. Problems are: Problem set: 4 solved, 202 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/252 variables, 20/380 constraints. Problems are: Problem set: 4 solved, 202 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 20/400 constraints. Problems are: Problem set: 4 solved, 202 unsolved
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/252 variables, 20/420 constraints. Problems are: Problem set: 7 solved, 199 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/252 variables, 20/440 constraints. Problems are: Problem set: 7 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 252/461 variables, and 440 constraints, problems are : Problem set: 7 solved, 199 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/252 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/206 constraints, Known Traps: 370/370 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60087ms problems are : Problem set: 7 solved, 199 unsolved
Search for dead transitions found 7 dead transitions in 60089ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 252/252 places, 202/209 transitions.
Applied a total of 0 rules in 10 ms. Remains 252 /252 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2026-05-24 12:05:18] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 60750 ms. Remains : 252/252 places, 202/209 transitions.
RANDOM walk for 40000 steps (851 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (239 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (181 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1060873 steps, run timeout after 3001 ms. (steps per millisecond=353 ) properties seen :0 out of 2
Probabilistic random walk after 1060873 steps, saw 156297 distinct states, run finished after 3001 ms. (steps per millisecond=353 ) 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-18149521583576014572.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8917248034964291307.kers'
[2026-05-24 12:05:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18149521583576014572.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8917248034964291307.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 202 rows 252 cols 766 entries
Finished phase 1 with 159 SingleSign rule and 23 generalized
[2026-05-24 12:05:21] [INFO ] Computed 70 invariants in 3 ms
Computed 70 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8917248034964291307.kers
Total runtime 3 ms.
[2026-05-24 12:05:21] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 129/210 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/212 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/249 variables, 14/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 202/451 variables, 249/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/451 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/451 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/454 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/454 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 325 constraints, problems are : Problem set: 0 solved, 2 unsolved in 645 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 252/252 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 129/210 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/212 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 37/249 variables, 14/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 202/451 variables, 249/369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 3/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/451 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/451 variables, 20/412 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/451 variables, 20/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/451 variables, 20/452 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/451 variables, 10/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/451 variables, 10/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/451 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/451 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/451 variables, 10/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/451 variables, 2/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/451 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/451 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 3/454 variables, 3/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/454 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/454 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/454 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 454/454 variables, and 492 constraints, problems are : Problem set: 0 solved, 2 unsolved in 21585 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 252/252 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 164/164 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 22244ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 660 ms.
Support contains 81 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 202/202 transitions.
Applied a total of 0 rules in 11 ms. Remains 252 /252 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 252/252 places, 202/202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 252 /252 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2026-05-24 12:05:44] [INFO ] Invariant cache hit.
[2026-05-24 12:05:44] [INFO ] Implicit Places using invariants in 115 ms returned []
[2026-05-24 12:05:44] [INFO ] Invariant cache hit.
[2026-05-24 12:05:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-24 12:05:44] [INFO ] Implicit Places using invariants and state equation in 334 ms returned [34, 37]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 452 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 250/252 places, 202/202 transitions.
Applied a total of 0 rules in 10 ms. Remains 250 /250 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 469 ms. Remains : 250/252 places, 202/202 transitions.
RANDOM walk for 40000 steps (857 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (232 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (178 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1028143 steps, run timeout after 3001 ms. (steps per millisecond=342 ) properties seen :0 out of 2
Probabilistic random walk after 1028143 steps, saw 151620 distinct states, run finished after 3001 ms. (steps per millisecond=342 ) 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-305202963947972489.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6018971947888243879.kers'
[2026-05-24 12:05:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-305202963947972489.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6018971947888243879.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 202 rows 250 cols 762 entries
Finished phase 1 with 159 SingleSign rule and 23 generalized
[2026-05-24 12:05:47] [INFO ] Computed 68 invariants in 1 ms
Computed 68 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6018971947888243879.kers
Total runtime 3 ms.
[2026-05-24 12:05:47] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 118/199 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/201 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 46/247 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 202/449 variables, 247/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/452 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/452 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 321 constraints, problems are : Problem set: 0 solved, 2 unsolved in 648 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 250/250 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 118/199 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/201 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 46/247 variables, 14/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 20/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 20/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 202/449 variables, 247/496 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/449 variables, 3/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/449 variables, 3/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/449 variables, 7/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/449 variables, 6/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/449 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/449 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 3/452 variables, 3/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/452 variables, 2/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/452 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/452 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/452 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 524 constraints, problems are : Problem set: 0 solved, 2 unsolved in 23117 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 250/250 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 200/200 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 23784ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 275 ms.
Support contains 81 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 250 /250 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 250/250 places, 202/202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 250 /250 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2026-05-24 12:06:11] [INFO ] Invariant cache hit.
[2026-05-24 12:06:12] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-24 12:06:12] [INFO ] Invariant cache hit.
[2026-05-24 12:06:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-24 12:06:12] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2026-05-24 12:06:12] [INFO ] Redundant transitions in 3 ms returned []
Running 199 sub problems to find dead transitions.
[2026-05-24 12:06:12] [INFO ] Invariant cache hit.
[2026-05-24 12:06:12] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 2/249 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 8/72 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (OVERLAPS) 1/250 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 20/163 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 20/203 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 20/243 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/250 variables, 20/263 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 250/452 variables, and 263 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 0/250 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 195/195 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 2/249 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 35/99 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (OVERLAPS) 1/250 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 160/263 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 20/283 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 20/303 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 20/323 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 20/343 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 20/363 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 20/383 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 20/403 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 20/423 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/250 variables, 20/443 constraints. Problems are: Problem set: 0 solved, 199 unsolved
SMT process timed out in 60062ms, After SMT, problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60677 ms. Remains : 250/250 places, 202/202 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 5 ms. Remains 250 /250 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Running SMT prover for 2 properties.
[2026-05-24 12:07:12] [INFO ] Invariant cache hit.
[2026-05-24 12:07:12] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-24 12:07:12] [INFO ] [Nat]Absence check using 54 positive place invariants in 8 ms returned sat
[2026-05-24 12:07:12] [INFO ] [Nat]Absence check using 54 positive and 14 generalized place invariants in 8 ms returned sat
[2026-05-24 12:07:12] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-24 12:07:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2026-05-24 12:07:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 775 ms
TRAPS : Iteration 1
[2026-05-24 12:07:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 218 ms
TRAPS : Iteration 2
[2026-05-24 12:07:14] [INFO ] After 1957ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-24 12:07:15] [INFO ] After 2350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-24 12:07:15] [INFO ] Flatten gal took : 23 ms
[2026-05-24 12:07:15] [INFO ] Flatten gal took : 16 ms
[2026-05-24 12:07:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality596447744892755617.gal : 8 ms
[2026-05-24 12:07:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8091895716969721894.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/ReachabilityCardinality596447744892755617.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8091895716969721894.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 ...327
Loading property file /tmp/ReachabilityCardinality8091895716969721894.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 30
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :30 after 89
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :89 after 190
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :190 after 605
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :605 after 4459
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4459 after 33875
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :33875 after 276975
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :276975 after 6.84337e+06
Detected timeout of ITS tools.
[2026-05-24 12:07:30] [INFO ] Flatten gal took : 30 ms
[2026-05-24 12:07:30] [INFO ] Applying decomposition
[2026-05-24 12:07:30] [INFO ] Flatten gal took : 16 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/graph1015742496191807281.txt' '-o' '/tmp/graph1015742496191807281.bin' '-w' '/tmp/graph1015742496191807281.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1015742496191807281.bin' '-l' '-1' '-v' '-w' '/tmp/graph1015742496191807281.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:07:30] [INFO ] Decomposing Gal with order
[2026-05-24 12:07:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:07:30] [INFO ] Removed a total of 92 redundant transitions.
[2026-05-24 12:07:30] [INFO ] Flatten gal took : 76 ms
[2026-05-24 12:07:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 16 ms.
[2026-05-24 12:07:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1226616214569820605.gal : 6 ms
[2026-05-24 12:07:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8619889816529513759.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1226616214569820605.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8619889816529513759.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality8619889816529513759.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 65
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :65 after 160
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :160 after 25479
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :25479 after 34523
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :171441 after 9.91705e+07
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.65977e+09,0.231642,13480,1461,332,16925,3566,1083,25110,181,7975,0
Total reachable state count : 4659773873

Verifying 2 reachability properties.
Reachability property BusinessProcesses-PT-15-ReachabilityFireability-2024-02 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-15-ReachabilityFireability-2024-02,165888,0.235507,13596,119,55,16925,3566,1220,25110,192,7975,408
Reachability property BusinessProcesses-PT-15-ReachabilityFireability-2024-05 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-15-ReachabilityFireability-2024-05,6912,0.240932,13596,117,55,16925,3566,1316,25110,206,7975,3379
Over-approximation ignoring read arcs solved 0 properties in 18085 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 12:07:30] [INFO ] Flatten gal took : 21 ms
[2026-05-24 12:07:30] [INFO ] Applying decomposition
[2026-05-24 12:07:30] [INFO ] Flatten gal took : 20 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/graph1096719937720767000.txt' '-o' '/tmp/graph1096719937720767000.bin' '-w' '/tmp/graph1096719937720767000.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1096719937720767000.bin' '-l' '-1' '-v' '-w' '/tmp/graph1096719937720767000.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:07:30] [INFO ] Decomposing Gal with order
[2026-05-24 12:07:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:07:30] [INFO ] Removed a total of 272 redundant transitions.
[2026-05-24 12:07:31] [INFO ] Flatten gal took : 43 ms
[2026-05-24 12:07:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 9 ms.
[2026-05-24 12:07:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17782386534385431500.gal : 9 ms
[2026-05-24 12:07:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4437146457636422809.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/ReachabilityCardinality17782386534385431500.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4437146457636422809.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality4437146457636422809.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 156
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :156 after 660
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :3.02004e+19 after 2.59202e+20
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,8.87325e+25,13.2641,268732,10981,76,377744,1255,1577,1.1147e+06,90,4856,0
Total reachable state count : 88732470684590941229023232

Verifying 2 reachability properties.
Reachability property BusinessProcesses-PT-15-ReachabilityFireability-2024-02 is true.
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

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-ReachabilityFireability-2024-02,5.64222e+12,13.3025,268768,268,23,377744,1255,1730,1.1147e+06,96,4856,1674
Reachability property BusinessProcesses-PT-15-ReachabilityFireability-2024-05 is true.
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

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-ReachabilityFireability-2024-05,1.57946e+18,13.3416,268768,265,23,377744,1255,1827,1.1147e+06,97,4856,16958
All properties solved without resorting to model-checking.
Total runtime 396801 ms.

BK_STOP 1779624464505

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-15, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-tall-177946842000567"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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