fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r178-oct2-177969019800068
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for Medical-PT-18

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
401.892 53027.00 77164.00 138.50 FFTFFFFFFFTFTFTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969019800068.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 Medical-PT-18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969019800068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 9.0K Mar 7 18:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 7 18:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 7 18:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 18:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 11:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Mar 7 18:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 7 18:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 7 18:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 7 18:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 3.1M 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 Medical-PT-18-LTLFireability-00
FORMULA_NAME Medical-PT-18-LTLFireability-01
FORMULA_NAME Medical-PT-18-LTLFireability-02
FORMULA_NAME Medical-PT-18-LTLFireability-03
FORMULA_NAME Medical-PT-18-LTLFireability-04
FORMULA_NAME Medical-PT-18-LTLFireability-05
FORMULA_NAME Medical-PT-18-LTLFireability-06
FORMULA_NAME Medical-PT-18-LTLFireability-07
FORMULA_NAME Medical-PT-18-LTLFireability-08
FORMULA_NAME Medical-PT-18-LTLFireability-09
FORMULA_NAME Medical-PT-18-LTLFireability-10
FORMULA_NAME Medical-PT-18-LTLFireability-11
FORMULA_NAME Medical-PT-18-LTLFireability-12
FORMULA_NAME Medical-PT-18-LTLFireability-13
FORMULA_NAME Medical-PT-18-LTLFireability-14
FORMULA_NAME Medical-PT-18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779695352086

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Medical-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 07:49:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 07:49:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 07:49:13] [INFO ] Load time of PNML (sax parser for PT used): 288 ms
[2026-05-25 07:49:14] [INFO ] Transformed 312 places.
[2026-05-25 07:49:14] [INFO ] Transformed 5431 transitions.
[2026-05-25 07:49:14] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 478 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 242 places in 21 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA Medical-PT-18-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-18-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 227/227 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 227
Applied a total of 2 rules in 13 ms. Remains 67 /69 variables (removed 2) and now considering 227/227 (removed 0) transitions.
[2026-05-25 07:49:14] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15829900654790090371.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15576964968975491114.kers'
[2026-05-25 07:49:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15829900654790090371.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15576964968975491114.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 67 cols 760 entries
Finished phase 1 with 59 SingleSign rule and 0 generalized
[2026-05-25 07:49:14] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-15576964968975491114.kers
Total runtime 13 ms.
[2026-05-25 07:49:14] [INFO ] Implicit Places using invariants in 294 ms returned []
[2026-05-25 07:49:14] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2026-05-25 07:49:14] [INFO ] Invariant cache hit.
[2026-05-25 07:49:14] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-25 07:49:14] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2026-05-25 07:49:14] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2026-05-25 07:49:14] [INFO ] Invariant cache hit.
[2026-05-25 07:49:14] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Problem TDEAD213 is UNSAT
Problem TDEAD218 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 182/247 variables, 65/75 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 56/131 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/131 constraints. Problems are: Problem set: 2 solved, 220 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/249 variables, 2/133 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/133 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 11 (OVERLAPS) 0/249 variables, 0/133 constraints. Problems are: Problem set: 2 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 133 constraints, problems are : Problem set: 2 solved, 220 unsolved in 8928 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 67/67 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/8 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 2/10 constraints. Problems are: Problem set: 2 solved, 220 unsolved
Problem TDEAD203 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 3/13 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 182/247 variables, 65/78 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 56/134 constraints. Problems are: Problem set: 6 solved, 216 unsolved
Problem TDEAD8 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD128 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 133/267 constraints. Problems are: Problem set: 9 solved, 213 unsolved
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 1/268 constraints. Problems are: Problem set: 13 solved, 209 unsolved
Problem TDEAD170 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD163 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 2/270 constraints. Problems are: Problem set: 16 solved, 206 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 1/271 constraints. Problems are: Problem set: 16 solved, 206 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 0/271 constraints. Problems are: Problem set: 16 solved, 206 unsolved
At refinement iteration 13 (OVERLAPS) 2/249 variables, 2/273 constraints. Problems are: Problem set: 16 solved, 206 unsolved
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD177 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 80/353 constraints. Problems are: Problem set: 21 solved, 201 unsolved
Problem TDEAD135 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD178 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 5/358 constraints. Problems are: Problem set: 25 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 249/249 variables, and 358 constraints, problems are : Problem set: 25 solved, 197 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 67/67 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 213/222 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 39156ms problems are : Problem set: 25 solved, 197 unsolved
Search for dead transitions found 25 dead transitions in 39175ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 67/69 places, 202/227 transitions.
Reduce places removed 6 places and 48 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 61 transition count 154
Reduce places removed 4 places and 29 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 57 transition count 125
Reduce places removed 2 places and 14 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 55 transition count 111
Reduce places removed 2 places and 18 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 14 place count 53 transition count 93
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 15 place count 52 transition count 89
Reduce places removed 1 places and 5 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 16 place count 51 transition count 84
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 16 rules in 11 ms. Remains 51 /67 variables (removed 16) and now considering 84/202 (removed 118) transitions.
[2026-05-25 07:49:54] [INFO ] Flow matrix only has 76 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14566526527442293920.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-464297067283977497.kers'
[2026-05-25 07:49:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14566526527442293920.kers, --Pflows, --basisKERS=/tmp/petrispot-output-464297067283977497.kers]
Culling trivial invariants: removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 76 rows 49 cols 281 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-25 07:49:54] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-464297067283977497.kers
Total runtime 1 ms.
[2026-05-25 07:49:54] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 07:49:54] [INFO ] Flow matrix only has 76 transitions (discarded 8 similar events)
[2026-05-25 07:49:54] [INFO ] Invariant cache hit.
[2026-05-25 07:49:54] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-25 07:49:54] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 51/69 places, 84/227 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40090 ms. Remains : 51/69 places, 84/227 transitions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 0 rules in 0 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2026-05-25 07:49:54] [INFO ] Flow matrix only has 76 transitions (discarded 8 similar events)
[2026-05-25 07:49:54] [INFO ] Invariant cache hit.
[2026-05-25 07:49:54] [INFO ] Implicit Places using invariants in 224 ms returned []
[2026-05-25 07:49:54] [INFO ] Flow matrix only has 76 transitions (discarded 8 similar events)
[2026-05-25 07:49:54] [INFO ] Invariant cache hit.
[2026-05-25 07:49:54] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-25 07:49:54] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2026-05-25 07:49:54] [INFO ] Flow matrix only has 76 transitions (discarded 8 similar events)
[2026-05-25 07:49:54] [INFO ] Invariant cache hit.
[2026-05-25 07:49:54] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 2/47 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 76/123 variables, 47/56 constraints. Problems are: Problem set: 0 solved, 79 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 39/95 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 2/125 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/125 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/127 variables, and 97 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1773 ms.
Refiners :[Positive P Invariants (semi-flows): 8/10 constraints, State Equation: 49/51 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 2/47 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 76/123 variables, 47/56 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 39/95 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 54/149 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (OVERLAPS) 2/125 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/125 variables, 25/182 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/125 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Problem TDEAD34 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/125 variables, 2/185 constraints. Problems are: Problem set: 1 solved, 78 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/125 variables, 2/187 constraints. Problems are: Problem set: 1 solved, 78 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/125 variables, 0/187 constraints. Problems are: Problem set: 1 solved, 78 unsolved
At refinement iteration 18 (OVERLAPS) 0/125 variables, 0/187 constraints. Problems are: Problem set: 1 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/127 variables, and 187 constraints, problems are : Problem set: 1 solved, 78 unsolved in 8166 ms.
Refiners :[Positive P Invariants (semi-flows): 8/10 constraints, State Equation: 49/51 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 9951ms problems are : Problem set: 1 solved, 78 unsolved
Search for dead transitions found 1 dead transitions in 9951ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 51/51 places, 83/84 transitions.
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10316 ms. Remains : 51/51 places, 83/84 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Support contains 0 out of 49 places after structural reductions.
FORMULA Medical-PT-18-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 07:50:04] [INFO ] Flatten gal took : 35 ms
[2026-05-25 07:50:04] [INFO ] Flatten gal took : 16 ms
[2026-05-25 07:50:05] [INFO ] Input system was already deterministic with 83 transitions.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Computed a total of 6 stabilizing places and 12 stable transitions
All properties solved by simple procedures.
Total runtime 51495 ms.

BK_STOP 1779695405113

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="Medical-PT-18"
export BK_EXAMINATION="LTLFireability"
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 Medical-PT-18, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-oct2-177969019800068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Medical-PT-18.tgz
mv Medical-PT-18 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;