About the Execution of ITS-Tools for BugTracking-PT-q3m128
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5450.743 | 91015.00 | 209206.00 | 2103.90 | FFTFTTTFTFTTTFTT | 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-177946841900375.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-q3m128, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946841900375
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.0K Mar 5 17:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Mar 5 17:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 5 17:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 5 17:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 15 07:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 07:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 5 17:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Mar 5 17:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 5 17:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 5 17:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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-q3m128-ReachabilityFireability-2024-00
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityFireability-2024-01
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityFireability-2024-02
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityFireability-2024-03
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityFireability-2024-04
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityFireability-2024-05
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityFireability-2024-06
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityFireability-2024-07
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityFireability-2024-08
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityFireability-2024-09
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityFireability-2024-10
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityFireability-2024-11
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityFireability-2024-12
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityFireability-2024-13
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityFireability-2024-14
FORMULA_NAME BugTracking-PT-q3m128-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1779590939115
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-q3m128
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-24 02:49:00] [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 02:49:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 02:49:01] [INFO ] Load time of PNML (sax parser for PT used): 734 ms
[2026-05-24 02:49:01] [INFO ] Transformed 754 places.
[2026-05-24 02:49:01] [INFO ] Transformed 27370 transitions.
[2026-05-24 02:49:01] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 916 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 514 places in 127 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m128-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40079 steps (21 resets) in 2512 ms. (15 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 303 ms. (131 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 239 ms. (166 steps per ms) remains 3/3 properties
[2026-05-24 02:49:02] [INFO ] Flatten gal took : 488 ms
BEST_FIRST walk for 40003 steps (8 resets) in 277 ms. (143 steps per ms) remains 3/3 properties
[2026-05-24 02:49:02] [INFO ] Flatten gal took : 133 ms
[2026-05-24 02:49:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6458308731394307470.gal : 85 ms
[2026-05-24 02:49:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5347361783721199556.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/ReachabilityCardinality6458308731394307470.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5347361783721199556.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/ReachabilityCardinality5347361783721199556.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 20
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :20 after 56
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :56 after 165
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :165 after 680
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :680 after 3654
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :3654 after 23426
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :23426 after 161700
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :161700 after 2.31395e+08
Interrupted probabilistic random walk after 152020 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 3
Probabilistic random walk after 152020 steps, saw 73274 distinct states, run finished after 3007 ms. (steps per millisecond=50 ) properties seen :0
[2026-05-24 02:49:06] [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-10943508666089849101.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16608542882617671245.kers'
[2026-05-24 02:49:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10943508666089849101.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16608542882617671245.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2642 rows 240 cols 12480 entries
Finished phase 1 with 230 SingleSign rule and 0 generalized
[2026-05-24 02:49:06] [INFO ] Computed 10 invariants in 7 ms
Computed 10 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-16608542882617671245.kers
Total runtime 11 ms.
[2026-05-24 02:49:06] [INFO ] State equation strengthened by 255 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 83/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem BugTracking-PT-q3m128-ReachabilityFireability-2024-01 is UNSAT
FORMULA BugTracking-PT-q3m128-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 3/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1686/1779 variables, 93/103 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1779 variables, 148/251 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1779 variables, 0/251 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 920/2699 variables, 90/341 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2699 variables, 64/405 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2699 variables, 0/405 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 175/2874 variables, 51/456 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2874 variables, 2/458 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2874 variables, 43/501 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2874 variables, 0/501 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 4/2878 variables, 2/503 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2878 variables, 1/504 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2878 variables, 0/504 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 4/2882 variables, 5/509 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2882 variables, 0/509 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/2882 variables, 0/509 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2882/2882 variables, and 509 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1570 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 240/240 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 85/93 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 4/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1686/1779 variables, 93/104 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1779 variables, 148/252 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1779 variables, 1/253 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1779 variables, 1/254 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1779 variables, 0/254 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 920/2699 variables, 90/344 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2699 variables, 64/408 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2699 variables, 0/408 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 175/2874 variables, 51/459 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2874 variables, 2/461 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2874 variables, 43/504 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2874 variables, 0/504 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/2878 variables, 2/506 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2878 variables, 1/507 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2878 variables, 2/509 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :2.31395e+08 after 9.81626e+08
At refinement iteration 20 (INCLUDED_ONLY) 0/2878 variables, 0/509 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 4/2882 variables, 5/514 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2882 variables, 2/516 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2882 variables, 0/516 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/2882 variables, 0/516 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2882/2882 variables, and 516 constraints, problems are : Problem set: 1 solved, 2 unsolved in 3895 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: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5599ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 370 ms.
Support contains 8 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.9 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 4 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 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 11 place count 235 transition count 2749
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 15 place count 231 transition count 2749
Applied a total of 15 rules in 241 ms. Remains 231 /240 variables (removed 9) and now considering 2749/2769 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 231/240 places, 2749/2769 transitions.
RANDOM walk for 40037 steps (29 resets) in 476 ms. (83 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 242 ms. (164 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 142355 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 2
Probabilistic random walk after 142355 steps, saw 93154 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
[2026-05-24 02:49:16] [INFO ] Flow matrix only has 2620 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-5290128409041101188.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3797182578698016314.kers'
[2026-05-24 02:49:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5290128409041101188.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3797182578698016314.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2620 rows 231 cols 12401 entries
Finished phase 1 with 223 SingleSign rule and 0 generalized
[2026-05-24 02:49:16] [INFO ] Computed 8 invariants in 7 ms
Computed 8 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-3797182578698016314.kers
Total runtime 9 ms.
[2026-05-24 02:49:16] [INFO ] State equation strengthened by 241 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 77/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1654/1739 variables, 85/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1739 variables, 123/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1739 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 806/2545 variables, 83/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2545 variables, 54/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2545 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 290/2835 variables, 47/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2835 variables, 2/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2835 variables, 64/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2835 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 16/2851 variables, 16/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2851 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2851 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/2851 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2851/2851 variables, and 481 constraints, problems are : Problem set: 0 solved, 2 unsolved in 960 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 1/1 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 77/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1654/1739 variables, 85/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1739 variables, 123/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1739 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1739 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 806/2545 variables, 83/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2545 variables, 54/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2545 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 290/2835 variables, 47/400 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2835 variables, 2/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2835 variables, 64/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2835 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 16/2851 variables, 16/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2851 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2851 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2851 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2851/2851 variables, and 483 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1875 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2886ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 210 ms.
Support contains 8 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 2749/2749 transitions.
Applied a total of 0 rules in 41 ms. Remains 231 /231 variables (removed 0) and now considering 2749/2749 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 231/231 places, 2749/2749 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 2749/2749 transitions.
Applied a total of 0 rules in 39 ms. Remains 231 /231 variables (removed 0) and now considering 2749/2749 (removed 0) transitions.
[2026-05-24 02:49:19] [INFO ] Flow matrix only has 2620 transitions (discarded 129 similar events)
[2026-05-24 02:49:19] [INFO ] Invariant cache hit.
[2026-05-24 02:49:19] [INFO ] Implicit Places using invariants in 274 ms returned []
[2026-05-24 02:49:19] [INFO ] Flow matrix only has 2620 transitions (discarded 129 similar events)
[2026-05-24 02:49:19] [INFO ] Invariant cache hit.
[2026-05-24 02:49:20] [INFO ] State equation strengthened by 241 read => feed constraints.
[2026-05-24 02:49:23] [INFO ] Implicit Places using invariants and state equation in 3897 ms returned []
Implicit Place search using SMT with State Equation took 4182 ms to find 0 implicit places.
[2026-05-24 02:49:23] [INFO ] Redundant transitions in 224 ms returned []
Running 2747 sub problems to find dead transitions.
[2026-05-24 02:49:23] [INFO ] Flow matrix only has 2620 transitions (discarded 129 similar events)
[2026-05-24 02:49:23] [INFO ] Invariant cache hit.
[2026-05-24 02:49:23] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2747 unsolved
Problem TDEAD2247 is UNSAT
Problem TDEAD2248 is UNSAT
Problem TDEAD2249 is UNSAT
Problem TDEAD2250 is UNSAT
Problem TDEAD2251 is UNSAT
Problem TDEAD2252 is UNSAT
Problem TDEAD2253 is UNSAT
Problem TDEAD2254 is UNSAT
Problem TDEAD2255 is UNSAT
Problem TDEAD2256 is UNSAT
Problem TDEAD2257 is UNSAT
Problem TDEAD2258 is UNSAT
Problem TDEAD2259 is UNSAT
Problem TDEAD2260 is UNSAT
Problem TDEAD2261 is UNSAT
Problem TDEAD2262 is UNSAT
Problem TDEAD2263 is UNSAT
Problem TDEAD2264 is UNSAT
Problem TDEAD2293 is UNSAT
Problem TDEAD2294 is UNSAT
Problem TDEAD2295 is UNSAT
Problem TDEAD2296 is UNSAT
Problem TDEAD2297 is UNSAT
Problem TDEAD2298 is UNSAT
Problem TDEAD2299 is UNSAT
Problem TDEAD2304 is UNSAT
Problem TDEAD2305 is UNSAT
Problem TDEAD2306 is UNSAT
Problem TDEAD2307 is UNSAT
Problem TDEAD2308 is UNSAT
Problem TDEAD2309 is UNSAT
Problem TDEAD2310 is UNSAT
Problem TDEAD2311 is UNSAT
Problem TDEAD2312 is UNSAT
Problem TDEAD2313 is UNSAT
Problem TDEAD2314 is UNSAT
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :9.81626e+08 after 2.48172e+09
Problem TDEAD2584 is UNSAT
Problem TDEAD2585 is UNSAT
Problem TDEAD2586 is UNSAT
Problem TDEAD2587 is UNSAT
Problem TDEAD2588 is UNSAT
Problem TDEAD2589 is UNSAT
Problem TDEAD2590 is UNSAT
Problem TDEAD2591 is UNSAT
Problem TDEAD2592 is UNSAT
Problem TDEAD2593 is UNSAT
Problem TDEAD2594 is UNSAT
Problem TDEAD2595 is UNSAT
Problem TDEAD2596 is UNSAT
Problem TDEAD2597 is UNSAT
Problem TDEAD2600 is UNSAT
Problem TDEAD2601 is UNSAT
Problem TDEAD2603 is UNSAT
Problem TDEAD2604 is UNSAT
Problem TDEAD2605 is UNSAT
Problem TDEAD2606 is UNSAT
Problem TDEAD2607 is UNSAT
Problem TDEAD2608 is UNSAT
Problem TDEAD2609 is UNSAT
Problem TDEAD2610 is UNSAT
Problem TDEAD2611 is UNSAT
Problem TDEAD2612 is UNSAT
Problem TDEAD2613 is UNSAT
Problem TDEAD2617 is UNSAT
Problem TDEAD2618 is UNSAT
Problem TDEAD2619 is UNSAT
Problem TDEAD2620 is UNSAT
Problem TDEAD2622 is UNSAT
Problem TDEAD2623 is UNSAT
Problem TDEAD2627 is UNSAT
Problem TDEAD2628 is UNSAT
Problem TDEAD2629 is UNSAT
Problem TDEAD2630 is UNSAT
Problem TDEAD2631 is UNSAT
Problem TDEAD2632 is UNSAT
Problem TDEAD2633 is UNSAT
Problem TDEAD2634 is UNSAT
Problem TDEAD2635 is UNSAT
Problem TDEAD2638 is UNSAT
Problem TDEAD2639 is UNSAT
Problem TDEAD2641 is UNSAT
Problem TDEAD2642 is UNSAT
Problem TDEAD2643 is UNSAT
Problem TDEAD2644 is UNSAT
Problem TDEAD2645 is UNSAT
Problem TDEAD2646 is UNSAT
Problem TDEAD2647 is UNSAT
Problem TDEAD2648 is UNSAT
Problem TDEAD2649 is UNSAT
Problem TDEAD2650 is UNSAT
Problem TDEAD2651 is UNSAT
Problem TDEAD2652 is UNSAT
Problem TDEAD2653 is UNSAT
Problem TDEAD2654 is UNSAT
Problem TDEAD2655 is UNSAT
Problem TDEAD2656 is UNSAT
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 231/2851 variables, and 15 constraints, problems are : Problem set: 96 solved, 2651 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/231 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 2747/1213 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 96 solved, 2651 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 8/8 constraints. Problems are: Problem set: 96 solved, 2651 unsolved
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 7/15 constraints. Problems are: Problem set: 104 solved, 2643 unsolved
Problem TDEAD2734 is UNSAT
Problem TDEAD2735 is UNSAT
Problem TDEAD2745 is UNSAT
Problem TDEAD2746 is UNSAT
Problem TDEAD2277 is UNSAT
Problem TDEAD2278 is UNSAT
Problem TDEAD2288 is UNSAT
Problem TDEAD2289 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 1/16 constraints. Problems are: Problem set: 112 solved, 2635 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 231/2851 variables, and 16 constraints, problems are : Problem set: 112 solved, 2635 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/231 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 1534/1213 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 65093ms problems are : Problem set: 112 solved, 2635 unsolved
Search for dead transitions found 112 dead transitions in 65114ms
Found 112 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 112 transitions
Dead transitions reduction (with SMT) removed 112 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 231/231 places, 2637/2749 transitions.
Reduce places removed 29 places and 760 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 202 transition count 1877
Reduce places removed 22 places and 292 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 51 place count 180 transition count 1585
Reduce places removed 9 places and 174 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 60 place count 171 transition count 1411
Reduce places removed 8 places and 119 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 68 place count 163 transition count 1292
Reduce places removed 1 places and 17 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 69 place count 162 transition count 1275
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 72 place count 159 transition count 1233
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 16 places and 270 transitions.
Iterating global reduction 5 with 19 rules applied. Total rules applied 91 place count 143 transition count 963
Deduced a syphon composed of 3 places in 1 ms
Applied a total of 91 rules in 81 ms. Remains 143 /231 variables (removed 88) and now considering 963/2637 (removed 1674) transitions.
[2026-05-24 02:50:29] [INFO ] Flow matrix only has 913 transitions (discarded 50 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9634556245736976122.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-46011456368227386.kers'
[2026-05-24 02:50:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9634556245736976122.kers, --Pflows, --basisKERS=/tmp/petrispot-output-46011456368227386.kers]
Culling trivial invariants: removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 913 rows 140 cols 4204 entries
Finished phase 1 with 132 SingleSign rule and 0 generalized
[2026-05-24 02:50:29] [INFO ] Computed 11 invariants in 4 ms
Computed 11 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-46011456368227386.kers
Total runtime 6 ms.
[2026-05-24 02:50:29] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-24 02:50:29] [INFO ] Flow matrix only has 913 transitions (discarded 50 similar events)
[2026-05-24 02:50:29] [INFO ] Invariant cache hit.
[2026-05-24 02:50:29] [INFO ] State equation strengthened by 115 read => feed constraints.
[2026-05-24 02:50:29] [INFO ] Implicit Places using invariants and state equation in 688 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 143/231 places, 963/2749 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 70530 ms. Remains : 143/231 places, 963/2749 transitions.
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
FORMULA BugTracking-PT-q3m128-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-ReachabilityFireability-2024-12 TRUE 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 89838 ms.
BK_STOP 1779591030130
--------------------
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-q3m128"
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-q3m128, 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-177946841900375"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m128.tgz
mv BugTracking-PT-q3m128 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 ;
