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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.0K Mar 5 17:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 5 17:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 5 17:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 5 17:53 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.3K Mar 15 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Mar 5 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 5 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 5 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Mar 5 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:48 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 161K 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-17-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779625894385

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-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-24 12:31:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 12:31:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 12:31:35] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2026-05-24 12:31:35] [INFO ] Transformed 650 places.
[2026-05-24 12:31:35] [INFO ] Transformed 580 transitions.
[2026-05-24 12:31:35] [INFO ] Found NUPN structural information;
[2026-05-24 12:31:35] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 4 transitions.
[2026-05-24 12:31:36] [INFO ] Flatten gal took : 150 ms
RANDOM walk for 40000 steps (261 resets) in 1827 ms. (21 steps per ms) remains 13/16 properties
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 12:31:36] [INFO ] Flatten gal took : 86 ms
[2026-05-24 12:31:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15040246644975495672.gal : 30 ms
[2026-05-24 12:31:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9349575766031758096.prop : 3 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/ReachabilityCardinality15040246644975495672.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9349575766031758096.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (45 resets) in 549 ms. (72 steps per ms) remains 13/13 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality9349575766031758096.prop.
BEST_FIRST walk for 40002 steps (44 resets) in 603 ms. (66 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
BEST_FIRST walk for 40003 steps (46 resets) in 462 ms. (86 steps per ms) remains 13/13 properties
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
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :65 after 161
BEST_FIRST walk for 40004 steps (32 resets) in 218 ms. (182 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (43 resets) in 157 ms. (253 steps per ms) remains 12/13 properties
SDD proceeding with computation,13 properties remain. new max is 256
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD size :161 after 10780
BEST_FIRST walk for 40002 steps (32 resets) in 141 ms. (281 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (46 resets) in 174 ms. (228 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (40 resets) in 227 ms. (175 steps per ms) remains 11/12 properties
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (36 resets) in 231 ms. (172 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (53 resets) in 134 ms. (296 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (41 resets) in 121 ms. (327 steps per ms) remains 10/11 properties
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (47 resets) in 152 ms. (261 steps per ms) remains 10/10 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16708902433404501479.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6276379411792566404.kers'
[2026-05-24 12:31:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16708902433404501479.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6276379411792566404.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 576 rows 646 cols 1701 entries
Finished phase 1 with 458 SingleSign rule and 80 generalized
[2026-05-24 12:31:37] [INFO ] Computed 108 invariants in 3 ms
Computed 108 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-6276379411792566404.kers
Total runtime 9 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 167/167 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 358/525 variables, 82/249 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 358/607 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 2/609 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 14/539 variables, 4/613 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 14/627 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 107/646 variables, 20/647 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/646 variables, 107/754 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem BusinessProcesses-PT-17-ReachabilityFireability-2024-01 is UNSAT
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 12 (OVERLAPS) 576/1222 variables, 646/1400 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1222/1222 variables, and 1400 constraints, problems are : Problem set: 1 solved, 9 unsolved in 5037 ms.
Refiners :[Domain max(s): 646/646 constraints, Positive P Invariants (semi-flows): 86/86 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 646/646 constraints, PredecessorRefiner: 10/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 155/155 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 367/522 variables, 82/237 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/522 variables, 367/604 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 2/606 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 15/621 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/621 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 14/536 variables, 4/625 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 14/639 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 2/641 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/536 variables, 0/641 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 110/646 variables, 20/661 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 110/771 constraints. Problems are: Problem set: 1 solved, 9 unsolved
SMT process timed out in 10265ms, After SMT, problems are : Problem set: 1 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 155 out of 646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 646/646 places, 576/576 transitions.
Graph (complete) has 1312 edges and 646 vertex of which 642 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 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 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 642 transition count 532
Reduce places removed 43 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 62 rules applied. Total rules applied 106 place count 599 transition count 513
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 125 place count 580 transition count 513
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 125 place count 580 transition count 419
Deduced a syphon composed of 94 places in 4 ms
Ensure Unique test removed 10 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 323 place count 476 transition count 419
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 375 place count 424 transition count 367
Iterating global reduction 3 with 52 rules applied. Total rules applied 427 place count 424 transition count 367
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 427 place count 424 transition count 363
Deduced a syphon composed of 4 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 437 place count 418 transition count 363
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 533 place count 370 transition count 315
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 534 place count 370 transition count 314
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 535 place count 370 transition count 314
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 536 place count 369 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 537 place count 368 transition count 313
Applied a total of 537 rules in 207 ms. Remains 368 /646 variables (removed 278) and now considering 313/576 (removed 263) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 368/646 places, 313/576 transitions.
RANDOM walk for 40000 steps (554 resets) in 495 ms. (80 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (117 resets) in 223 ms. (178 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (115 resets) in 296 ms. (134 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (77 resets) in 140 ms. (283 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (113 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (77 resets) in 86 ms. (459 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (115 resets) in 177 ms. (224 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (79 resets) in 170 ms. (233 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (135 resets) in 155 ms. (256 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (122 resets) in 87 ms. (454 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 799930 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :7 out of 9
Probabilistic random walk after 799930 steps, saw 119769 distinct states, run finished after 3009 ms. (steps per millisecond=265 ) properties seen :7
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-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-1121034451825348500.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5825600793579422475.kers'
[2026-05-24 12:31:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1121034451825348500.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5825600793579422475.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 313 rows 367 cols 1139 entries
Finished phase 1 with 205 SingleSign rule and 71 generalized
[2026-05-24 12:31:51] [INFO ] Computed 92 invariants in 2 ms
Computed 92 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5825600793579422475.kers
Total runtime 3 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 207/279 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/293 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 69/362 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/364 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 313/677 variables, 364/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/677 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/681 variables, 4/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/681 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/681 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/681 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 681/681 variables, and 460 constraints, problems are : Problem set: 0 solved, 2 unsolved in 967 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 368/368 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/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 207/279 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 14/293 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 69/362 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 10/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 18/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/362 variables, 7/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/362 variables, 5/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/362 variables, 5/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/362 variables, 5/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/362 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/362 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/364 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/364 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 313/677 variables, 364/535 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/677 variables, 4/539 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/677 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 4/681 variables, 4/543 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/681 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/681 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/681 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 681/681 variables, and 544 constraints, problems are : Problem set: 0 solved, 2 unsolved in 11779 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 368/368 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 12768ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 277 ms.
Support contains 72 out of 368 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 368/368 places, 313/313 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 368 transition count 307
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 362 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 361 transition count 306
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 14 place count 361 transition count 285
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 45 rules applied. Total rules applied 59 place count 337 transition count 285
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 73 place count 323 transition count 271
Iterating global reduction 3 with 14 rules applied. Total rules applied 87 place count 323 transition count 271
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 97 rules applied. Total rules applied 184 place count 273 transition count 224
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 187 place count 273 transition count 224
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 189 place count 271 transition count 222
Applied a total of 189 rules in 63 ms. Remains 271 /368 variables (removed 97) and now considering 222/313 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 271/368 places, 222/313 transitions.
RANDOM walk for 40000 steps (1212 resets) in 202 ms. (197 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (245 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (189 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1174059 steps, run timeout after 3001 ms. (steps per millisecond=391 ) properties seen :1 out of 2
Probabilistic random walk after 1174059 steps, saw 182701 distinct states, run finished after 3001 ms. (steps per millisecond=391 ) properties seen :1
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6541280492885246418.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10152990209684481354.kers'
[2026-05-24 12:32:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6541280492885246418.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10152990209684481354.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 222 rows 267 cols 944 entries
Finished phase 1 with 144 SingleSign rule and 41 generalized
[2026-05-24 12:32:07] [INFO ] Computed 86 invariants in 3 ms
Computed 86 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10152990209684481354.kers
Total runtime 4 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 162/205 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/208 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 53/261 variables, 17/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/263 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/265 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 222/487 variables, 265/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/487 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/493 variables, 6/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/493 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/493 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/493 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 357 constraints, problems are : Problem set: 0 solved, 1 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 162/205 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/208 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 53/261 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/263 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/265 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 222/487 variables, 265/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/487 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/487 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/493 variables, 6/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/493 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/493 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/493 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 493/493 variables, and 360 constraints, problems are : Problem set: 0 solved, 1 unsolved in 497 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 853ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 43 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 222/222 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 271 transition count 218
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 267 transition count 218
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 8 place count 267 transition count 205
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 34 place count 254 transition count 205
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 251 transition count 202
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 251 transition count 202
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 66 place count 238 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 237 transition count 193
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 237 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 236 transition count 192
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 236 transition count 192
Applied a total of 72 rules in 45 ms. Remains 236 /271 variables (removed 35) and now considering 192/222 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 236/271 places, 192/222 transitions.
RANDOM walk for 40000 steps (1536 resets) in 208 ms. (191 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (308 resets) in 339 ms. (117 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1396009 steps, run timeout after 3001 ms. (steps per millisecond=465 ) properties seen :0 out of 1
Probabilistic random walk after 1396009 steps, saw 221590 distinct states, run finished after 3001 ms. (steps per millisecond=465 ) 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-4684167362503130015.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6945428033617639668.kers'
[2026-05-24 12:32:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4684167362503130015.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6945428033617639668.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 192 rows 232 cols 914 entries
Finished phase 1 with 123 SingleSign rule and 27 generalized
[2026-05-24 12:32:11] [INFO ] Computed 86 invariants in 1 ms
Computed 86 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6945428033617639668.kers
Total runtime 2 ms.
[2026-05-24 12:32:11] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 138/181 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/184 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 42/226 variables, 17/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/228 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/230 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/422 variables, 230/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 4/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/428 variables, 6/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/428 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/428 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/428 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 326 constraints, problems are : Problem set: 0 solved, 1 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 236/236 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 138/181 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/184 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/226 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/228 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/230 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 192/422 variables, 230/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 4/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/428 variables, 6/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/428 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/428 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/428 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 328 constraints, problems are : Problem set: 0 solved, 1 unsolved in 438 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 236/236 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 696ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 43 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 192/192 transitions.
Applied a total of 0 rules in 8 ms. Remains 236 /236 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 236/236 places, 192/192 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 192/192 transitions.
Applied a total of 0 rules in 7 ms. Remains 236 /236 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2026-05-24 12:32:12] [INFO ] Invariant cache hit.
[2026-05-24 12:32:13] [INFO ] Implicit Places using invariants in 517 ms returned [33, 35, 37, 39, 41, 43, 45, 47, 49, 70, 71, 72, 79, 86, 201, 205, 207]
[2026-05-24 12:32:13] [INFO ] Actually due to overlaps returned [33, 39, 43, 47, 70, 79, 86, 201, 205, 207]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 528 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 226/236 places, 192/192 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 221 transition count 181
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 221 transition count 181
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 220 transition count 177
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 220 transition count 177
Applied a total of 12 rules in 16 ms. Remains 220 /226 variables (removed 6) and now considering 177/192 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7094995938236377206.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13570048793292522961.kers'
[2026-05-24 12:32:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7094995938236377206.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13570048793292522961.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 177 rows 218 cols 804 entries
Finished phase 1 with 91 SingleSign rule and 53 generalized
[2026-05-24 12:32:13] [INFO ] Computed 76 invariants in 1 ms
Computed 76 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13570048793292522961.kers
Total runtime 1 ms.
[2026-05-24 12:32:13] [INFO ] Implicit Places using invariants in 285 ms returned [34, 36, 60, 61]
[2026-05-24 12:32:13] [INFO ] Actually due to overlaps returned [34, 60]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 304 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 218/236 places, 177/192 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 215 transition count 171
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 215 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 214 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 214 transition count 167
Applied a total of 8 rules in 24 ms. Remains 214 /218 variables (removed 4) and now considering 167/177 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7016990549891636332.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1059760702294516731.kers'
[2026-05-24 12:32:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7016990549891636332.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1059760702294516731.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 167 rows 212 cols 740 entries
Finished phase 1 with 92 SingleSign rule and 48 generalized
[2026-05-24 12:32:13] [INFO ] Computed 74 invariants in 1 ms
Computed 74 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1059760702294516731.kers
Total runtime 1 ms.
[2026-05-24 12:32:13] [INFO ] Implicit Places using invariants in 179 ms returned []
[2026-05-24 12:32:13] [INFO ] Invariant cache hit.
[2026-05-24 12:32:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-24 12:32:14] [INFO ] Implicit Places using invariants and state equation in 358 ms returned [62, 66, 140, 144, 145]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 544 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 209/236 places, 167/192 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 208 transition count 166
Applied a total of 2 rules in 9 ms. Remains 208 /209 variables (removed 1) and now considering 166/167 (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-18166734788854107068.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17698156252500160921.kers'
[2026-05-24 12:32:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18166734788854107068.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17698156252500160921.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 166 rows 208 cols 731 entries
Finished phase 1 with 107 SingleSign rule and 32 generalized
[2026-05-24 12:32:14] [INFO ] Computed 69 invariants in 1 ms
Computed 69 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17698156252500160921.kers
Total runtime 1 ms.
[2026-05-24 12:32:14] [INFO ] Implicit Places using invariants in 226 ms returned []
[2026-05-24 12:32:14] [INFO ] Invariant cache hit.
[2026-05-24 12:32:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-24 12:32:14] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 208/236 places, 166/192 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 2062 ms. Remains : 208/236 places, 166/192 transitions.
RANDOM walk for 40000 steps (1533 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (314 resets) in 235 ms. (169 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1491867 steps, run timeout after 3001 ms. (steps per millisecond=497 ) properties seen :0 out of 1
Probabilistic random walk after 1491867 steps, saw 234730 distinct states, run finished after 3001 ms. (steps per millisecond=497 ) properties seen :0
[2026-05-24 12:32:17] [INFO ] Invariant cache hit.
[2026-05-24 12:32:17] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 120/163 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/165 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/199 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/203 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 166/369 variables, 203/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 4/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/374 variables, 5/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/374 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/374 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 208/208 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 120/163 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2/165 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 34/199 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 16/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/203 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/203 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 166/369 variables, 203/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/369 variables, 4/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/369 variables, 4/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/369 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/369 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/369 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 5/374 variables, 5/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/374 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/374 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 327 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4138 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 208/208 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 4343ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 43 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 166/166 transitions.
Applied a total of 0 rules in 10 ms. Remains 208 /208 variables (removed 0) and now considering 166/166 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 208/208 places, 166/166 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 166/166 transitions.
Applied a total of 0 rules in 18 ms. Remains 208 /208 variables (removed 0) and now considering 166/166 (removed 0) transitions.
[2026-05-24 12:32:22] [INFO ] Invariant cache hit.
[2026-05-24 12:32:22] [INFO ] Implicit Places using invariants in 423 ms returned []
[2026-05-24 12:32:22] [INFO ] Invariant cache hit.
[2026-05-24 12:32:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-24 12:32:23] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
[2026-05-24 12:32:23] [INFO ] Redundant transitions in 4 ms returned []
Running 163 sub problems to find dead transitions.
[2026-05-24 12:32:23] [INFO ] Invariant cache hit.
[2026-05-24 12:32:23] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 2/207 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Problem TDEAD54 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD118 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 20/86 constraints. Problems are: Problem set: 4 solved, 159 unsolved
Problem TDEAD55 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD119 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 13/99 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/99 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 1/208 variables, 3/102 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 20/122 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 20/142 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 20/162 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 20/182 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 20/202 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 20/222 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/208 variables, 20/242 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/208 variables, 20/262 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/208 variables, 20/282 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/208 variables, 20/302 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/208 variables, 20/322 constraints. Problems are: Problem set: 8 solved, 155 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 208/374 variables, and 322 constraints, problems are : Problem set: 8 solved, 155 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/208 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 253/253 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 8/8 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/8 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 2/207 variables, 56/64 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 2/66 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 36/102 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/102 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 1/208 variables, 3/105 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 217/322 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 20/342 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 20/362 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 20/382 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 20/402 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 20/422 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 20/442 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/208 variables, 20/462 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/208 variables, 20/482 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/208 variables, 20/502 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/208 variables, 20/522 constraints. Problems are: Problem set: 8 solved, 155 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/208 variables, 20/542 constraints. Problems are: Problem set: 8 solved, 155 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 208/374 variables, and 561 constraints, problems are : Problem set: 8 solved, 155 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/208 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/163 constraints, Known Traps: 492/492 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60103ms problems are : Problem set: 8 solved, 155 unsolved
Search for dead transitions found 8 dead transitions in 60110ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 208/208 places, 158/166 transitions.
Applied a total of 0 rules in 14 ms. Remains 208 /208 variables (removed 0) and now considering 158/158 (removed 0) transitions.
[2026-05-24 12:33:23] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61041 ms. Remains : 208/208 places, 158/166 transitions.
RANDOM walk for 40000 steps (1512 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (321 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1700759 steps, run timeout after 3001 ms. (steps per millisecond=566 ) properties seen :0 out of 1
Probabilistic random walk after 1700759 steps, saw 266169 distinct states, run finished after 3001 ms. (steps per millisecond=566 ) 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-13333623021083145517.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9407424815464302090.kers'
[2026-05-24 12:33:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13333623021083145517.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9407424815464302090.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 158 rows 208 cols 683 entries
Finished phase 1 with 105 SingleSign rule and 32 generalized
[2026-05-24 12:33:26] [INFO ] Computed 71 invariants in 2 ms
Computed 71 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9407424815464302090.kers
Total runtime 3 ms.
[2026-05-24 12:33:26] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 120/163 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/165 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/201 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/203 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 158/361 variables, 203/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 4/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/366 variables, 5/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/366 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/366 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 208/208 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 120/163 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2/165 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 36/201 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/203 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 158/361 variables, 203/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 4/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/361 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/366 variables, 5/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/366 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/366 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 208/208 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 651ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 5518 steps, including 209 resets, run visited all 1 properties in 16 ms. (steps per millisecond=344 )
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-2024-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 20 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 111580 ms.

BK_STOP 1779626007070

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ 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-17"
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-17, 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-177946842100583"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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