About the Execution of ITS-Tools for BusinessProcesses-PT-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 821.720 | 171093.00 | 378245.00 | 264.80 | TFTTFFTTFTTTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r034-tall-177946842100591.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-18, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100591
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 8.9K Mar 5 17:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Mar 5 17:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Mar 5 17:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K 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 3.9K Mar 15 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Mar 5 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Mar 5 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K 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 177K 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-18-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-18-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1779627862845
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-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-24 13:04:24] [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 13:04:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 13:04:24] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2026-05-24 13:04:24] [INFO ] Transformed 717 places.
[2026-05-24 13:04:24] [INFO ] Transformed 642 transitions.
[2026-05-24 13:04:24] [INFO ] Found NUPN structural information;
[2026-05-24 13:04:24] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 13 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (213 resets) in 1390 ms. (28 steps per ms) remains 7/15 properties
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 13:04:24] [INFO ] Flatten gal took : 150 ms
BEST_FIRST walk for 40003 steps (36 resets) in 309 ms. (129 steps per ms) remains 7/7 properties
[2026-05-24 13:04:24] [INFO ] Flatten gal took : 92 ms
BEST_FIRST walk for 40004 steps (33 resets) in 254 ms. (156 steps per ms) remains 7/7 properties
[2026-05-24 13:04:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality148646256174708394.gal : 53 ms
[2026-05-24 13:04:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2848380113253112102.prop : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality148646256174708394.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2848380113253112102.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
BEST_FIRST walk for 40004 steps (36 resets) in 573 ms. (69 steps per ms) remains 7/7 properties
Loading property file /tmp/ReachabilityCardinality2848380113253112102.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :36 after 92
BEST_FIRST walk for 40002 steps (42 resets) in 1052 ms. (37 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (35 resets) in 141 ms. (281 steps per ms) remains 7/7 properties
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :92 after 181
BEST_FIRST walk for 40003 steps (39 resets) in 138 ms. (287 steps per ms) remains 7/7 properties
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :181 after 5.89807e+13
BEST_FIRST walk for 40004 steps (43 resets) in 255 ms. (156 steps per ms) remains 7/7 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-853635474747801179.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-445922153574634467.kers'
[2026-05-24 13:04:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-853635474747801179.kers, --Pflows, --basisKERS=/tmp/petrispot-output-445922153574634467.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 627 rows 702 cols 1830 entries
Finished phase 1 with 503 SingleSign rule and 85 generalized
[2026-05-24 13:04:25] [INFO ] Computed 114 invariants in 4 ms
Computed 114 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-445922153574634467.kers
Total runtime 6 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 142/142 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem BusinessProcesses-PT-18-ReachabilityFireability-2024-12 is UNSAT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 446/588 variables, 97/239 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 446/685 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 1/686 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/588 variables, 0/686 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 11/599 variables, 4/690 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/599 variables, 11/701 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/599 variables, 0/701 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem BusinessProcesses-PT-18-ReachabilityFireability-2024-08 is UNSAT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 103/702 variables, 12/713 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/702 variables, 103/816 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/702 variables, 0/816 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem BusinessProcesses-PT-18-ReachabilityFireability-2024-01 is UNSAT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 12 (OVERLAPS) 627/1329 variables, 702/1518 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1329 variables, 0/1518 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1329/1329 variables, and 1518 constraints, problems are : Problem set: 3 solved, 4 unsolved in 5040 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 101/101 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 7/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 91/91 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 478/569 variables, 96/187 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/569 variables, 478/665 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/569 variables, 18/683 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/569 variables, 2/685 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/569 variables, 3/688 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 0/688 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/585 variables, 5/693 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/585 variables, 16/709 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 3/712 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/585 variables, 1/713 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/585 variables, 0/713 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 117/702 variables, 13/726 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/702 variables, 117/843 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 702/1329 variables, and 845 constraints, problems are : Problem set: 3 solved, 4 unsolved in 5015 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 101/101 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/702 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10165ms problems are : Problem set: 3 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 91 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 627/627 transitions.
Graph (complete) has 1418 edges and 702 vertex of which 693 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 693 transition count 545
Reduce places removed 81 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 94 rules applied. Total rules applied 176 place count 612 transition count 532
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 189 place count 599 transition count 532
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 189 place count 599 transition count 419
Deduced a syphon composed of 113 places in 3 ms
Ensure Unique test removed 14 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 429 place count 472 transition count 419
Discarding 74 places :
Symmetric choice reduction at 3 with 74 rule applications. Total rules 503 place count 398 transition count 345
Iterating global reduction 3 with 74 rules applied. Total rules applied 577 place count 398 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 578 place count 398 transition count 344
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 578 place count 398 transition count 337
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 595 place count 388 transition count 337
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 763 place count 304 transition count 253
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 765 place count 303 transition count 256
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 768 place count 303 transition count 256
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 769 place count 302 transition count 255
Applied a total of 769 rules in 194 ms. Remains 302 /702 variables (removed 400) and now considering 255/627 (removed 372) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 302/702 places, 255/627 transitions.
RANDOM walk for 40000 steps (797 resets) in 780 ms. (51 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (149 resets) in 145 ms. (273 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (155 resets) in 180 ms. (221 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (178 resets) in 301 ms. (132 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (144 resets) in 186 ms. (213 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 666017 steps, run timeout after 3001 ms. (steps per millisecond=221 ) properties seen :0 out of 4
Probabilistic random walk after 666017 steps, saw 112864 distinct states, run finished after 3006 ms. (steps per millisecond=221 ) 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-4456765029071459983.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2699573685429001585.kers'
[2026-05-24 13:04:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4456765029071459983.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2699573685429001585.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 255 rows 302 cols 1051 entries
Finished phase 1 with 140 SingleSign rule and 73 generalized
[2026-05-24 13:04:39] [INFO ] Computed 89 invariants in 1 ms
Computed 89 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2699573685429001585.kers
Total runtime 2 ms.
[2026-05-24 13:04:39] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 163/254 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/258 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 39/297 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 255/552 variables, 297/386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 3/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 5/557 variables, 5/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/557 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/557 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 394 constraints, problems are : Problem set: 0 solved, 4 unsolved in 711 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 302/302 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 163/254 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 4/258 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 39/297 variables, 14/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/297 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 255/552 variables, 297/400 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/552 variables, 3/403 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/552 variables, 9/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/552 variables, 2/416 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/552 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem BusinessProcesses-PT-18-ReachabilityFireability-2024-06 is UNSAT
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 18 (OVERLAPS) 5/557 variables, 5/421 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/557 variables, 1/422 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/557 variables, 20/442 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/557 variables, 20/462 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/557 variables, 20/482 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/557 variables, 6/488 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/557 variables, 0/488 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 0/557 variables, 0/488 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 488 constraints, problems are : Problem set: 1 solved, 3 unsolved in 15677 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 302/302 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 89/89 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 16416ms problems are : Problem set: 1 solved, 3 unsolved
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 198 ms.
Support contains 64 out of 302 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 302/302 places, 255/255 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 302 transition count 248
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 295 transition count 248
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 14 place count 295 transition count 238
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 37 place count 282 transition count 238
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 41 place count 278 transition count 234
Iterating global reduction 2 with 4 rules applied. Total rules applied 45 place count 278 transition count 234
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 277 transition count 233
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 277 transition count 233
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 81 place count 260 transition count 216
Applied a total of 81 rules in 35 ms. Remains 260 /302 variables (removed 42) and now considering 216/255 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 260/302 places, 216/255 transitions.
RANDOM walk for 40000 steps (1055 resets) in 216 ms. (184 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (281 resets) in 282 ms. (141 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1257536 steps, run timeout after 3001 ms. (steps per millisecond=419 ) properties seen :0 out of 1
Probabilistic random walk after 1257536 steps, saw 202143 distinct states, run finished after 3001 ms. (steps per millisecond=419 ) 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-12584704404956384347.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-422794702661573548.kers'
[2026-05-24 13:04:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12584704404956384347.kers, --Pflows, --basisKERS=/tmp/petrispot-output-422794702661573548.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 216 rows 260 cols 963 entries
Finished phase 1 with 101 SingleSign rule and 73 generalized
[2026-05-24 13:04:59] [INFO ] Computed 86 invariants in 7 ms
Computed 86 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-422794702661573548.kers
Total runtime 8 ms.
[2026-05-24 13:04:59] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 135/199 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/219 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/256 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 216/472 variables, 256/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 3/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/476 variables, 4/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/476 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/476 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 349 constraints, problems are : Problem set: 0 solved, 1 unsolved in 344 ms.
Refiners :[Positive P Invariants (semi-flows): 72/72 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 260/260 constraints, ReadFeed: 3/3 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/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 135/199 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 20/219 variables, 10/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 37/256 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 216/472 variables, 256/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 3/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 10/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/472 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/476 variables, 4/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/476 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/476 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 476/476 variables, and 385 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3518 ms.
Refiners :[Positive P Invariants (semi-flows): 72/72 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 260/260 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3893ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 64 out of 260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 216/216 transitions.
Applied a total of 0 rules in 11 ms. Remains 260 /260 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 260/260 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 216/216 transitions.
Applied a total of 0 rules in 7 ms. Remains 260 /260 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2026-05-24 13:05:03] [INFO ] Invariant cache hit.
[2026-05-24 13:05:03] [INFO ] Implicit Places using invariants in 187 ms returned [18, 46, 48, 50, 52, 54, 56, 58, 82, 84, 187, 225]
[2026-05-24 13:05:03] [INFO ] Actually due to overlaps returned [18, 46, 52, 56, 82, 84, 187, 225]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 200 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 252/260 places, 216/216 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 250 transition count 214
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 250 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 249 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 249 transition count 210
Applied a total of 6 rules in 17 ms. Remains 249 /252 variables (removed 3) and now considering 210/216 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5465921072457164073.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11282408147944212807.kers'
[2026-05-24 13:05:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5465921072457164073.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11282408147944212807.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 210 rows 249 cols 902 entries
Finished phase 1 with 120 SingleSign rule and 51 generalized
[2026-05-24 13:05:03] [INFO ] Computed 78 invariants in 1 ms
Computed 78 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11282408147944212807.kers
Total runtime 1 ms.
[2026-05-24 13:05:03] [INFO ] Implicit Places using invariants in 158 ms returned [46, 48]
[2026-05-24 13:05:03] [INFO ] Actually due to overlaps returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 163 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 248/260 places, 210/216 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 247 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 247 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 246 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 246 transition count 205
Applied a total of 4 rules in 16 ms. Remains 246 /248 variables (removed 2) and now considering 205/210 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3951584891876259834.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15803794835441611909.kers'
[2026-05-24 13:05:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3951584891876259834.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15803794835441611909.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 205 rows 246 cols 867 entries
Finished phase 1 with 126 SingleSign rule and 43 generalized
[2026-05-24 13:05:03] [INFO ] Computed 77 invariants in 1 ms
Computed 77 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15803794835441611909.kers
Total runtime 1 ms.
[2026-05-24 13:05:03] [INFO ] Implicit Places using invariants in 145 ms returned []
[2026-05-24 13:05:03] [INFO ] Invariant cache hit.
[2026-05-24 13:05:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-24 13:05:04] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 246/260 places, 205/216 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1168 ms. Remains : 246/260 places, 205/216 transitions.
RANDOM walk for 40000 steps (1047 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (281 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1282293 steps, run timeout after 3001 ms. (steps per millisecond=427 ) properties seen :0 out of 1
Probabilistic random walk after 1282293 steps, saw 205505 distinct states, run finished after 3001 ms. (steps per millisecond=427 ) properties seen :0
[2026-05-24 13:05:07] [INFO ] Invariant cache hit.
[2026-05-24 13:05:07] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/189 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/209 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/242 variables, 10/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 205/447 variables, 242/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/451 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/451 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/451 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/451 variables, and 326 constraints, problems are : Problem set: 0 solved, 1 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 246/246 constraints, ReadFeed: 3/3 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/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 125/189 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 20/209 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/242 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 205/447 variables, 242/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/447 variables, 20/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/447 variables, 13/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/451 variables, 4/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/451 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/451 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 451/451 variables, and 372 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4759 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 246/246 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5244ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 64 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 205/205 transitions.
Applied a total of 0 rules in 6 ms. Remains 246 /246 variables (removed 0) and now considering 205/205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 246/246 places, 205/205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 205/205 transitions.
Applied a total of 0 rules in 6 ms. Remains 246 /246 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2026-05-24 13:05:12] [INFO ] Invariant cache hit.
[2026-05-24 13:05:12] [INFO ] Implicit Places using invariants in 154 ms returned []
[2026-05-24 13:05:12] [INFO ] Invariant cache hit.
[2026-05-24 13:05:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-24 13:05:13] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
[2026-05-24 13:05:13] [INFO ] Redundant transitions in 6 ms returned []
Running 202 sub problems to find dead transitions.
[2026-05-24 13:05:13] [INFO ] Invariant cache hit.
[2026-05-24 13:05:13] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 2/245 variables, 67/74 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Problem TDEAD179 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD185 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 20/114 constraints. Problems are: Problem set: 3 solved, 199 unsolved
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 13/127 constraints. Problems are: Problem set: 8 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 1/128 constraints. Problems are: Problem set: 8 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/128 constraints. Problems are: Problem set: 8 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 1/246 variables, 3/131 constraints. Problems are: Problem set: 8 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 20/151 constraints. Problems are: Problem set: 8 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 20/171 constraints. Problems are: Problem set: 8 solved, 194 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 20/191 constraints. Problems are: Problem set: 8 solved, 194 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 20/211 constraints. Problems are: Problem set: 8 solved, 194 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 20/231 constraints. Problems are: Problem set: 8 solved, 194 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 20/251 constraints. Problems are: Problem set: 8 solved, 194 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 20/271 constraints. Problems are: Problem set: 8 solved, 194 unsolved
SMT process timed out in 30106ms, After SMT, problems are : Problem set: 8 solved, 194 unsolved
Search for dead transitions found 8 dead transitions in 30112ms
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 : 246/246 places, 197/205 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 244 transition count 197
Applied a total of 2 rules in 11 ms. Remains 244 /246 variables (removed 2) and now considering 197/197 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5949929332510548089.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15009490344506253117.kers'
[2026-05-24 13:05:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5949929332510548089.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15009490344506253117.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 197 rows 244 cols 815 entries
Finished phase 1 with 126 SingleSign rule and 41 generalized
[2026-05-24 13:05:43] [INFO ] Computed 77 invariants in 1 ms
Computed 77 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15009490344506253117.kers
Total runtime 2 ms.
[2026-05-24 13:05:43] [INFO ] Implicit Places using invariants in 138 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 139 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 243/246 places, 197/205 transitions.
Applied a total of 0 rules in 14 ms. Remains 243 /243 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 31111 ms. Remains : 243/246 places, 197/205 transitions.
RANDOM walk for 40000 steps (1044 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (278 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1433907 steps, run timeout after 3001 ms. (steps per millisecond=477 ) properties seen :0 out of 1
Probabilistic random walk after 1433907 steps, saw 230482 distinct states, run finished after 3001 ms. (steps per millisecond=477 ) 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-8907537848086735980.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16101814137262262632.kers'
[2026-05-24 13:05:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8907537848086735980.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16101814137262262632.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 197 rows 243 cols 811 entries
Finished phase 1 with 128 SingleSign rule and 39 generalized
[2026-05-24 13:05:47] [INFO ] Computed 76 invariants in 4 ms
Computed 76 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16101814137262262632.kers
Total runtime 4 ms.
[2026-05-24 13:05:47] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/191 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/211 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/239 variables, 9/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 197/436 variables, 239/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/440 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/440 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 243/243 constraints, ReadFeed: 3/3 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/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/191 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 20/211 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/239 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 197/436 variables, 239/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/440 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/440 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 332 constraints, problems are : Problem set: 0 solved, 1 unsolved in 841 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 243/243 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1386ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 64 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 197/197 transitions.
Applied a total of 0 rules in 5 ms. Remains 243 /243 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 243/243 places, 197/197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 197/197 transitions.
Applied a total of 0 rules in 6 ms. Remains 243 /243 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2026-05-24 13:05:48] [INFO ] Invariant cache hit.
[2026-05-24 13:05:48] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-24 13:05:48] [INFO ] Invariant cache hit.
[2026-05-24 13:05:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-24 13:05:49] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 857 ms to find 0 implicit places.
[2026-05-24 13:05:49] [INFO ] Redundant transitions in 11 ms returned []
Running 194 sub problems to find dead transitions.
[2026-05-24 13:05:49] [INFO ] Invariant cache hit.
[2026-05-24 13:05:49] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 2/242 variables, 67/73 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 8/121 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 1/243 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/243 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/243 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 15 (INCLUDED_ONLY) 0/243 variables, 20/284 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 243/440 variables, and 284 constraints, problems are : Problem set: 0 solved, 194 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/243 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 208/208 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 2/242 variables, 67/73 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 56/129 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 1/243 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 152/284 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 20/304 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 20/324 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 20/344 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 20/364 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 20/384 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 20/404 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/243 variables, 20/424 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/243 variables, 20/444 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/243 variables, 20/464 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/243 variables, 20/484 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/243 variables, 20/504 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 243/440 variables, and 504 constraints, problems are : Problem set: 0 solved, 194 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/243 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/194 constraints, Known Traps: 428/428 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60948 ms. Remains : 243/243 places, 197/197 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 6 ms. Remains 243 /243 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-24 13:06:49] [INFO ] Invariant cache hit.
[2026-05-24 13:06:49] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 13:06:49] [INFO ] [Nat]Absence check using 67 positive place invariants in 16 ms returned sat
[2026-05-24 13:06:49] [INFO ] [Nat]Absence check using 67 positive and 9 generalized place invariants in 3 ms returned sat
[2026-05-24 13:06:49] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 13:06:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
TRAPS : Iteration 1
[2026-05-24 13:06:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
TRAPS : Iteration 2
[2026-05-24 13:06:49] [INFO ] After 434ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 13:06:49] [INFO ] After 532ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-24 13:06:49] [INFO ] Flatten gal took : 18 ms
[2026-05-24 13:06:50] [INFO ] Flatten gal took : 14 ms
[2026-05-24 13:06:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6191046284955848137.gal : 3 ms
[2026-05-24 13:06:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6361418907840017836.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6191046284955848137.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6361418907840017836.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/ReachabilityCardinality6361418907840017836.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 11
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :12 after 62
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :62 after 108
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :108 after 1102
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1102 after 6582
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6582 after 22180
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :22180 after 94212
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :94212 after 570924
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :570924 after 4.19682e+06
Detected timeout of ITS tools.
[2026-05-24 13:07:05] [INFO ] Flatten gal took : 13 ms
[2026-05-24 13:07:05] [INFO ] Applying decomposition
[2026-05-24 13:07:05] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17974152792919816451.txt' '-o' '/tmp/graph17974152792919816451.bin' '-w' '/tmp/graph17974152792919816451.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17974152792919816451.bin' '-l' '-1' '-v' '-w' '/tmp/graph17974152792919816451.weights' '-q' '0' '-e' '0.001'
[2026-05-24 13:07:05] [INFO ] Decomposing Gal with order
[2026-05-24 13:07:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 13:07:05] [INFO ] Removed a total of 128 redundant transitions.
[2026-05-24 13:07:05] [INFO ] Flatten gal took : 74 ms
[2026-05-24 13:07:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 14 ms.
[2026-05-24 13:07:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16363904415054876643.gal : 5 ms
[2026-05-24 13:07:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13939425980095992691.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16363904415054876643.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13939425980095992691.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality13939425980095992691.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :48 after 210
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.94661e+08 after 3.4238e+08
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.4238e+08 after 1.10005e+09
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.32511e+10,0.801889,32360,1862,175,59540,841,910,108066,151,2239,0
Total reachable state count : 43251109668
Verifying 1 reachability properties.
Reachability property BusinessProcesses-PT-18-ReachabilityFireability-2024-07 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-18-ReachabilityFireability-2024-07,3072,0.828047,32416,117,43,59540,841,1076,108066,172,2239,10525
Over-approximation ignoring read arcs solved 0 properties in 16793 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 13:07:06] [INFO ] Flatten gal took : 29 ms
[2026-05-24 13:07:06] [INFO ] Applying decomposition
[2026-05-24 13:07:06] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13219987972209884388.txt' '-o' '/tmp/graph13219987972209884388.bin' '-w' '/tmp/graph13219987972209884388.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13219987972209884388.bin' '-l' '-1' '-v' '-w' '/tmp/graph13219987972209884388.weights' '-q' '0' '-e' '0.001'
[2026-05-24 13:07:06] [INFO ] Decomposing Gal with order
[2026-05-24 13:07:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 13:07:06] [INFO ] Removed a total of 288 redundant transitions.
[2026-05-24 13:07:06] [INFO ] Flatten gal took : 47 ms
[2026-05-24 13:07:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 9 ms.
[2026-05-24 13:07:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11644894886480009286.gal : 11 ms
[2026-05-24 13:07:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14580081211017605931.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11644894886480009286.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14580081211017605931.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality14580081211017605931.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 7.80042e+20
Reachability property BusinessProcesses-PT-18-ReachabilityFireability-2024-07 is true.
FORMULA BusinessProcesses-PT-18-ReachabilityFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.3139e+27,5.53878,122852,6635,58,247643,631,1351,515533,61,1179,0
Total reachable state count : 1313903547431918551162683392
Verifying 1 reachability properties.
Reachability property BusinessProcesses-PT-18-ReachabilityFireability-2024-07 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-18-ReachabilityFireability-2024-07,4.09858e+21,7.36126,122852,335,17,247643,631,1672,515533,81,1179,0
All properties solved without resorting to model-checking.
Total runtime 169874 ms.
BK_STOP 1779628033938
--------------------
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-18"
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-18, 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-177946842100591"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-18.tgz
mv BusinessProcesses-PT-18 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 '
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 ;