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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.1K Mar 5 17:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 5 17:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 5 17:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 5 17:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Mar 15 07:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Mar 5 17:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Mar 5 17:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 5 17:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 5 17:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 07:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q3m032-ReachabilityFireability-2024-00
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityFireability-2024-01
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityFireability-2024-02
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityFireability-2024-03
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityFireability-2024-04
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityFireability-2024-05
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityFireability-2024-06
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityFireability-2024-07
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityFireability-2024-08
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityFireability-2024-09
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityFireability-2024-10
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityFireability-2024-11
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityFireability-2024-12
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityFireability-2024-13
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityFireability-2024-14
FORMULA_NAME BugTracking-PT-q3m032-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779587521911

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m032
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-24 01:52:03] [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 01:52:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 01:52:04] [INFO ] Load time of PNML (sax parser for PT used): 774 ms
[2026-05-24 01:52:04] [INFO ] Transformed 754 places.
[2026-05-24 01:52:04] [INFO ] Transformed 27370 transitions.
[2026-05-24 01:52:04] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 963 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 514 places in 124 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m032-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40008 steps (61 resets) in 1881 ms. (21 steps per ms) remains 2/3 properties
FORMULA BugTracking-PT-q3m032-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (12 resets) in 238 ms. (167 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (12 resets) in 192 ms. (207 steps per ms) remains 2/2 properties
[2026-05-24 01:52:05] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17969943641688295411.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11700188229550639911.kers'
[2026-05-24 01:52:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17969943641688295411.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11700188229550639911.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2642 rows 240 cols 12480 entries
[2026-05-24 01:52:05] [INFO ] Flatten gal took : 388 ms
Finished phase 1 with 230 SingleSign rule and 0 generalized
[2026-05-24 01:52:05] [INFO ] Computed 10 invariants in 10 ms
Computed 10 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-11700188229550639911.kers
Total runtime 16 ms.
[2026-05-24 01:52:05] [INFO ] State equation strengthened by 255 read => feed constraints.
[2026-05-24 01:52:05] [INFO ] Flatten gal took : 175 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2026-05-24 01:52:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9617313719809135217.gal : 97 ms
[2026-05-24 01:52:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9242660819873199759.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/ReachabilityCardinality9617313719809135217.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9242660819873199759.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
At refinement iteration 3 (OVERLAPS) 486/516 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 46/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Loading property file /tmp/ReachabilityCardinality9242660819873199759.prop.
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1105/1621 variables, 49/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1621 variables, 82/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1621 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/1626 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1626 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 839/2465 variables, 86/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2465 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2465 variables, 95/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2465 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 20
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :20 after 56
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :56 after 165
At refinement iteration 15 (OVERLAPS) 8/2473 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :165 after 680
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :680 after 3654
At refinement iteration 16 (INCLUDED_ONLY) 0/2473 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3654 after 909194
At refinement iteration 17 (OVERLAPS) 403/2876 variables, 71/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2876 variables, 2/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2876 variables, 32/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2876 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 4/2880 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2880 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :909194 after 4.26678e+06
At refinement iteration 23 (INCLUDED_ONLY) 0/2880 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/2882 variables, 3/505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2882 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/2882 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2882/2882 variables, and 505 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1702 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 240/240 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 2/2 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 486/516 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 46/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1105/1621 variables, 49/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4.26678e+06 after 1.09754e+07
At refinement iteration 8 (INCLUDED_ONLY) 0/1621 variables, 82/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1621 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/1626 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1626 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 839/2465 variables, 86/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2465 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2465 variables, 95/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2465 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 7257ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 235 transition count 2753
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 12 place count 235 transition count 2748
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 17 place count 230 transition count 2748
Applied a total of 17 rules in 265 ms. Remains 230 /240 variables (removed 10) and now considering 2748/2769 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 230/240 places, 2748/2769 transitions.
RANDOM walk for 40057 steps (8 resets) in 338 ms. (118 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 164114 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 2
Probabilistic random walk after 164114 steps, saw 72420 distinct states, run finished after 3006 ms. (steps per millisecond=54 ) properties seen :0
[2026-05-24 01:52:15] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3273663215804518801.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11762106976127356660.kers'
[2026-05-24 01:52:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3273663215804518801.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11762106976127356660.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2619 rows 230 cols 12399 entries
Finished phase 1 with 222 SingleSign rule and 0 generalized
[2026-05-24 01:52:15] [INFO ] Computed 8 invariants in 7 ms
Computed 8 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-11762106976127356660.kers
Total runtime 11 ms.
[2026-05-24 01:52:15] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 485/514 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 46/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1104/1618 variables, 48/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1618 variables, 82/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1618 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 835/2453 variables, 84/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2453 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2453 variables, 88/381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2453 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/2457 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2457 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2457 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 391/2848 variables, 66/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2848 variables, 2/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2848 variables, 25/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2848 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/2849 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2849 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/2849 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2849/2849 variables, and 479 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1274 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 2/2 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 485/514 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 46/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1104/1618 variables, 48/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1618 variables, 82/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1618 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 835/2453 variables, 84/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2453 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2453 variables, 88/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2453 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.09754e+07 after 2.43861e+07
At refinement iteration 14 (INCLUDED_ONLY) 0/2453 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2453 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 4/2457 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2457 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2457 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 391/2848 variables, 66/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2848 variables, 2/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2848 variables, 25/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2848 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/2849 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2849 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/2849 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2849/2849 variables, and 483 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3719 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5049ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 532 ms.
Support contains 5 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Applied a total of 0 rules in 38 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 230/230 places, 2748/2748 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Applied a total of 0 rules in 36 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
[2026-05-24 01:52:21] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2026-05-24 01:52:21] [INFO ] Invariant cache hit.
[2026-05-24 01:52:21] [INFO ] Implicit Places using invariants in 276 ms returned []
[2026-05-24 01:52:21] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2026-05-24 01:52:21] [INFO ] Invariant cache hit.
[2026-05-24 01:52:22] [INFO ] State equation strengthened by 241 read => feed constraints.
[2026-05-24 01:52:25] [INFO ] Implicit Places using invariants and state equation in 3153 ms returned []
Implicit Place search using SMT with State Equation took 3439 ms to find 0 implicit places.
[2026-05-24 01:52:25] [INFO ] Redundant transitions in 165 ms returned []
Running 2747 sub problems to find dead transitions.
[2026-05-24 01:52:25] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2026-05-24 01:52:25] [INFO ] Invariant cache hit.
[2026-05-24 01:52:25] [INFO ] State equation strengthened by 241 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2747 unsolved
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1525 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1745 is UNSAT
Problem TDEAD1746 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1749 is UNSAT
Problem TDEAD1750 is UNSAT
Problem TDEAD1751 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1755 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1757 is UNSAT
Problem TDEAD1758 is UNSAT
Problem TDEAD1759 is UNSAT
Problem TDEAD1760 is UNSAT
Problem TDEAD1761 is UNSAT
Problem TDEAD1762 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1765 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1777 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1779 is UNSAT
Problem TDEAD1780 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1784 is UNSAT
Problem TDEAD1787 is UNSAT
Problem TDEAD1788 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1799 is UNSAT
Problem TDEAD1800 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1826 is UNSAT
Problem TDEAD1828 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1831 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2734 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD2745 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 10/18 constraints. Problems are: Problem set: 500 solved, 2247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 230/2849 variables, and 18 constraints, problems are : Problem set: 500 solved, 2247 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/230 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 2747/1185 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 500 solved, 2247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 7/7 constraints. Problems are: Problem set: 500 solved, 2247 unsolved
Problem TDEAD1498 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1501 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 10/17 constraints. Problems are: Problem set: 504 solved, 2243 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.43861e+07 after 5.1201e+07
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/17 constraints. Problems are: Problem set: 504 solved, 2243 unsolved
At refinement iteration 3 (OVERLAPS) 8/230 variables, 1/18 constraints. Problems are: Problem set: 504 solved, 2243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 230/2849 variables, and 18 constraints, problems are : Problem set: 504 solved, 2243 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/230 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 1562/1185 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64754ms problems are : Problem set: 504 solved, 2243 unsolved
Search for dead transitions found 504 dead transitions in 64774ms
Found 504 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 504 transitions
Dead transitions reduction (with SMT) removed 504 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 230/230 places, 2244/2748 transitions.
Graph (complete) has 2785 edges and 230 vertex of which 222 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 30 places and 650 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 192 transition count 1594
Reduce places removed 15 places and 271 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 46 place count 177 transition count 1323
Reduce places removed 9 places and 132 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 55 place count 168 transition count 1191
Reduce places removed 8 places and 89 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 63 place count 160 transition count 1102
Reduce places removed 1 places and 17 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 159 transition count 1085
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 75 place count 148 transition count 1027
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 16 places and 231 transitions.
Iterating global reduction 5 with 27 rules applied. Total rules applied 102 place count 132 transition count 796
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 109 place count 125 transition count 733
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 116 place count 125 transition count 733
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 116 rules in 53 ms. Remains 125 /230 variables (removed 105) and now considering 733/2244 (removed 1511) transitions.
[2026-05-24 01:53:30] [INFO ] Flow matrix only has 669 transitions (discarded 64 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8977816491669208420.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4846420420417824045.kers'
[2026-05-24 01:53:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8977816491669208420.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4846420420417824045.kers]
Culling trivial invariants: removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 669 rows 124 cols 3061 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-24 01:53:30] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4846420420417824045.kers
Total runtime 2 ms.
[2026-05-24 01:53:30] [INFO ] Implicit Places using invariants in 140 ms returned []
[2026-05-24 01:53:30] [INFO ] Flow matrix only has 669 transitions (discarded 64 similar events)
[2026-05-24 01:53:30] [INFO ] Invariant cache hit.
[2026-05-24 01:53:30] [INFO ] State equation strengthened by 87 read => feed constraints.
[2026-05-24 01:53:30] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 125/230 places, 733/2748 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 69172 ms. Remains : 125/230 places, 733/2748 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA BugTracking-PT-q3m032-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40016 steps (8 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 640739 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :0 out of 1
Probabilistic random walk after 640739 steps, saw 381597 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
[2026-05-24 01:53:33] [INFO ] Flow matrix only has 669 transitions (discarded 64 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3655008368116592969.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-837691056887789408.kers'
[2026-05-24 01:53:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3655008368116592969.kers, --Pflows, --basisKERS=/tmp/petrispot-output-837691056887789408.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 669 rows 124 cols 3061 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-24 01:53:33] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-837691056887789408.kers
Total runtime 7 ms.
[2026-05-24 01:53:33] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/95 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 83/178 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 270/448 variables, 29/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/448 variables, 47/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/448 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/451 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/451 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/451 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 306/757 variables, 42/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/757 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/757 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/757 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 36/793 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/793 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/793 variables, 5/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/793 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/793 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 793/793 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 77/95 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 83/178 variables, 12/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 270/448 variables, 29/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/448 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/448 variables, 47/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/448 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/451 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/451 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/451 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 306/757 variables, 42/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/757 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/757 variables, 20/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/757 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 36/793 variables, 20/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/793 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/793 variables, 5/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/793 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/793 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 793/793 variables, and 219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 599ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 733/733 transitions.
Applied a total of 0 rules in 8 ms. Remains 124 /124 variables (removed 0) and now considering 733/733 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 124/124 places, 733/733 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 733/733 transitions.
Applied a total of 0 rules in 8 ms. Remains 124 /124 variables (removed 0) and now considering 733/733 (removed 0) transitions.
[2026-05-24 01:53:34] [INFO ] Flow matrix only has 669 transitions (discarded 64 similar events)
[2026-05-24 01:53:34] [INFO ] Invariant cache hit.
[2026-05-24 01:53:34] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-24 01:53:34] [INFO ] Flow matrix only has 669 transitions (discarded 64 similar events)
[2026-05-24 01:53:34] [INFO ] Invariant cache hit.
[2026-05-24 01:53:34] [INFO ] State equation strengthened by 87 read => feed constraints.
[2026-05-24 01:53:34] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2026-05-24 01:53:35] [INFO ] Redundant transitions in 27 ms returned []
Running 732 sub problems to find dead transitions.
[2026-05-24 01:53:35] [INFO ] Flow matrix only has 669 transitions (discarded 64 similar events)
[2026-05-24 01:53:35] [INFO ] Invariant cache hit.
[2026-05-24 01:53:35] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 732 unsolved
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/8 constraints. Problems are: Problem set: 4 solved, 728 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 728 unsolved
Problem TDEAD423 is UNSAT
At refinement iteration 3 (OVERLAPS) 669/793 variables, 124/132 constraints. Problems are: Problem set: 5 solved, 727 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/793 variables, 87/219 constraints. Problems are: Problem set: 5 solved, 727 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/793 variables, 0/219 constraints. Problems are: Problem set: 5 solved, 727 unsolved
At refinement iteration 6 (OVERLAPS) 0/793 variables, 0/219 constraints. Problems are: Problem set: 5 solved, 727 unsolved
No progress, stopping.
After SMT solving in domain Real declared 793/793 variables, and 219 constraints, problems are : Problem set: 5 solved, 727 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 732/732 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 727 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 7/7 constraints. Problems are: Problem set: 5 solved, 727 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/8 constraints. Problems are: Problem set: 5 solved, 727 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 5 solved, 727 unsolved
At refinement iteration 3 (OVERLAPS) 669/793 variables, 124/132 constraints. Problems are: Problem set: 5 solved, 727 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/793 variables, 87/219 constraints. Problems are: Problem set: 5 solved, 727 unsolved
Problem TDEAD105 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD724 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/793 variables, 727/946 constraints. Problems are: Problem set: 80 solved, 652 unsolved
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/793 variables, 3/949 constraints. Problems are: Problem set: 125 solved, 607 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 793/793 variables, and 949 constraints, problems are : Problem set: 125 solved, 607 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 727/732 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60602ms problems are : Problem set: 125 solved, 607 unsolved
Search for dead transitions found 125 dead transitions in 60605ms
Found 125 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 125 transitions
Dead transitions reduction (with SMT) removed 125 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 124/124 places, 608/733 transitions.
Graph (complete) has 883 edges and 124 vertex of which 121 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 14 places and 183 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 107 transition count 425
Reduce places removed 8 places and 76 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 23 place count 99 transition count 349
Reduce places removed 4 places and 29 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 27 place count 95 transition count 320
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 29 place count 93 transition count 304
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 30 place count 92 transition count 295
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 37 place count 85 transition count 244
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 44 place count 85 transition count 244
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 44 rules in 11 ms. Remains 85 /124 variables (removed 39) and now considering 244/608 (removed 364) transitions.
[2026-05-24 01:54:35] [INFO ] Flow matrix only has 227 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8076313894618492309.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-287555015044043335.kers'
[2026-05-24 01:54:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8076313894618492309.kers, --Pflows, --basisKERS=/tmp/petrispot-output-287555015044043335.kers]
Culling trivial invariants: removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 227 rows 84 cols 987 entries
Finished phase 1 with 73 SingleSign rule and 3 generalized
[2026-05-24 01:54:35] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-287555015044043335.kers
Total runtime 2 ms.
[2026-05-24 01:54:35] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-24 01:54:35] [INFO ] Flow matrix only has 227 transitions (discarded 17 similar events)
[2026-05-24 01:54:35] [INFO ] Invariant cache hit.
[2026-05-24 01:54:35] [INFO ] State equation strengthened by 48 read => feed constraints.
[2026-05-24 01:54:35] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 85/124 places, 244/733 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61471 ms. Remains : 85/124 places, 244/733 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA BugTracking-PT-q3m032-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 152875 ms.

BK_STOP 1779587676095

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q3m032"
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 BugTracking-PT-q3m032, 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-177946841900359"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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