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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 6.2K Mar 5 17:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 5 17:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 5 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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 3.8K Mar 15 07:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 5 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Mar 5 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 5 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Mar 5 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:46 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 146K 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-12-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779619837963

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-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-24 10:50:39] [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 10:50:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 10:50:39] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2026-05-24 10:50:39] [INFO ] Transformed 586 places.
[2026-05-24 10:50:39] [INFO ] Transformed 525 transitions.
[2026-05-24 10:50:39] [INFO ] Found NUPN structural information;
[2026-05-24 10:50:39] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 4 transitions.
RANDOM walk for 40000 steps (292 resets) in 1596 ms. (25 steps per ms) remains 11/16 properties
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 10:50:39] [INFO ] Flatten gal took : 140 ms
[2026-05-24 10:50:39] [INFO ] Flatten gal took : 60 ms
BEST_FIRST walk for 40003 steps (54 resets) in 569 ms. (70 steps per ms) remains 11/11 properties
[2026-05-24 10:50:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1240123644623195780.gal : 50 ms
BEST_FIRST walk for 40003 steps (49 resets) in 214 ms. (186 steps per ms) remains 11/11 properties
[2026-05-24 10:50:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1977439815692425304.prop : 11 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/ReachabilityCardinality1240123644623195780.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1977439815692425304.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/ReachabilityCardinality1977439815692425304.prop.
BEST_FIRST walk for 40003 steps (64 resets) in 513 ms. (77 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (64 resets) in 273 ms. (145 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (49 resets) in 212 ms. (187 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :6 after 7
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :8 after 11
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :11 after 61
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :61 after 201
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :201 after 336
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :336 after 381
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :381 after 3788
BEST_FIRST walk for 40004 steps (51 resets) in 374 ms. (106 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (51 resets) in 145 ms. (274 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (51 resets) in 313 ms. (127 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (54 resets) in 137 ms. (289 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (52 resets) in 138 ms. (287 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (53 resets) in 121 ms. (327 steps per ms) remains 11/11 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12866093115116979517.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6500377378161235481.kers'
[2026-05-24 10:50:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12866093115116979517.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6500377378161235481.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 521 rows 582 cols 1552 entries
Finished phase 1 with 411 SingleSign rule and 73 generalized
[2026-05-24 10:50:40] [INFO ] Computed 98 invariants in 3 ms
Computed 98 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6500377378161235481.kers
Total runtime 4 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/256 variables, 256/256 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/256 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 255/511 variables, 76/332 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 255/587 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :3788 after 39961
Problem BusinessProcesses-PT-12-ReachabilityFireability-2024-06 is UNSAT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 71/582 variables, 21/609 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 71/680 constraints. Problems are: Problem set: 1 solved, 10 unsolved
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :2.8345e+06 after 4.54137e+06
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :4.54137e+06 after 6.26726e+07
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 0/680 constraints. Problems are: Problem set: 1 solved, 10 unsolved
SMT process timed out in 5219ms, After SMT, problems are : Problem set: 1 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 230 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 521/521 transitions.
Graph (complete) has 1186 edges and 582 vertex of which 579 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 579 transition count 502
Reduce places removed 19 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 32 rules applied. Total rules applied 52 place count 560 transition count 489
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 65 place count 547 transition count 489
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 65 place count 547 transition count 432
Deduced a syphon composed of 57 places in 3 ms
Ensure Unique test removed 3 places
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 117 rules applied. Total rules applied 182 place count 487 transition count 432
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 216 place count 453 transition count 398
Iterating global reduction 3 with 34 rules applied. Total rules applied 250 place count 453 transition count 398
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 316 place count 420 transition count 365
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 317 place count 419 transition count 364
Applied a total of 317 rules in 173 ms. Remains 419 /582 variables (removed 163) and now considering 364/521 (removed 157) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 419/582 places, 364/521 transitions.
RANDOM walk for 40000 steps (450 resets) in 684 ms. (58 steps per ms) remains 8/10 properties
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (93 resets) in 177 ms. (224 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (82 resets) in 137 ms. (289 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (112 resets) in 190 ms. (209 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (107 resets) in 197 ms. (202 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (88 resets) in 301 ms. (132 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (87 resets) in 248 ms. (160 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (93 resets) in 66 ms. (597 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (91 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10275228097969783665.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18095957581612976109.kers'
[2026-05-24 10:50:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10275228097969783665.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18095957581612976109.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 419 cols 1228 entries
Finished phase 1 with 264 SingleSign rule and 63 generalized
[2026-05-24 10:50:46] [INFO ] Computed 92 invariants in 2 ms
Computed 92 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18095957581612976109.kers
Total runtime 2 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 153/378 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 39/417 variables, 23/92 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 364/781 variables, 417/509 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/781 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem BusinessProcesses-PT-12-ReachabilityFireability-2024-00 is UNSAT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 2/783 variables, 2/511 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/783 variables, 0/511 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/783 variables, 0/511 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 783/783 variables, and 511 constraints, problems are : Problem set: 1 solved, 7 unsolved in 10118 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 419/419 constraints, PredecessorRefiner: 8/4 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/193 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem BusinessProcesses-PT-12-ReachabilityFireability-2024-07 is UNSAT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 176/369 variables, 69/69 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/369 variables, 11/80 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/369 variables, 2/82 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/82 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem BusinessProcesses-PT-12-ReachabilityFireability-2024-04 is UNSAT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-12-ReachabilityFireability-2024-05 is UNSAT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 47/416 variables, 22/104 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 20/124 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 20/144 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 20/164 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 20/184 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 20/204 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 20/224 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 20/244 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 20/264 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/416 variables, 20/284 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/416 variables, 20/304 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/416 variables, 18/322 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/416 variables, 14/336 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/416 variables, 14/350 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/783 variables, and 366 constraints, problems are : Problem set: 4 solved, 4 unsolved in 45009 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 22/23 constraints, State Equation: 0/419 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 275/275 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55193ms problems are : Problem set: 4 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 100 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 364/364 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 419 transition count 342
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 397 transition count 342
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 44 place count 397 transition count 313
Deduced a syphon composed of 29 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 63 rules applied. Total rules applied 107 place count 363 transition count 313
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 131 place count 339 transition count 289
Iterating global reduction 2 with 24 rules applied. Total rules applied 155 place count 339 transition count 289
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 155 place count 339 transition count 288
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 157 place count 338 transition count 288
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 109 rules applied. Total rules applied 266 place count 282 transition count 235
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 268 place count 281 transition count 239
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 272 place count 281 transition count 239
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 274 place count 279 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 275 place count 278 transition count 237
Applied a total of 275 rules in 93 ms. Remains 278 /419 variables (removed 141) and now considering 237/364 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 278/419 places, 237/364 transitions.
RANDOM walk for 40000 steps (924 resets) in 615 ms. (64 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (160 resets) in 192 ms. (207 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (184 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (168 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (165 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 934960 steps, run timeout after 3001 ms. (steps per millisecond=311 ) properties seen :2 out of 4
Probabilistic random walk after 934960 steps, saw 147036 distinct states, run finished after 3006 ms. (steps per millisecond=311 ) properties seen :2
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-13 TRUE 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-6650244757509406380.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4244559309375788204.kers'
[2026-05-24 10:51:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6650244757509406380.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4244559309375788204.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 237 rows 276 cols 966 entries
Finished phase 1 with 133 SingleSign rule and 62 generalized
[2026-05-24 10:51:45] [INFO ] Computed 83 invariants in 1 ms
Computed 83 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4244559309375788204.kers
Total runtime 1 ms.
[2026-05-24 10:51:45] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 127/225 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/231 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 42/273 variables, 19/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/274 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 237/511 variables, 274/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/511 variables, 4/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/511 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/515 variables, 4/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/515 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/515 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 515/515 variables, and 365 constraints, problems are : Problem set: 0 solved, 2 unsolved in 957 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 278/278 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 127/225 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 6/231 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 42/273 variables, 19/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 7/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 12/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 7/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 6/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/274 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/274 variables, 6/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/274 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/274 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/274 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 237/511 variables, 274/413 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/511 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/511 variables, 9/426 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/511 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/511 variables, 3/431 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/511 variables, 2/433 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/511 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/511 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem BusinessProcesses-PT-12-ReachabilityFireability-2024-10 is UNSAT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 27 (OVERLAPS) 4/515 variables, 4/438 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/515 variables, 1/439 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/515 variables, 1/440 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/515 variables, 2/442 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/515 variables, 1/443 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/515 variables, 0/443 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/515 variables, 0/443 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 515/515 variables, and 443 constraints, problems are : Problem set: 1 solved, 1 unsolved in 9399 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 278/278 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 10370ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 6762 steps, including 211 resets, run visited all 1 properties in 21 ms. (steps per millisecond=322 )
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 29 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 76911 ms.

BK_STOP 1779619916007

--------------------
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-12"
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-12, 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-177946842000543"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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