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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
482.676 77336.00 108325.00 107.00 TFTTFTFFFTTFFFFF 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-177969019800019.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-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969019800019
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 8.5K Mar 7 18:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Mar 7 18:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 7 18:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 7 18:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 11:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 11:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Mar 7 18:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 7 18:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 7 18:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 7 18:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:22 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-06-LTLCardinality-00
FORMULA_NAME Medical-PT-06-LTLCardinality-01
FORMULA_NAME Medical-PT-06-LTLCardinality-02
FORMULA_NAME Medical-PT-06-LTLCardinality-03
FORMULA_NAME Medical-PT-06-LTLCardinality-04
FORMULA_NAME Medical-PT-06-LTLCardinality-05
FORMULA_NAME Medical-PT-06-LTLCardinality-06
FORMULA_NAME Medical-PT-06-LTLCardinality-07
FORMULA_NAME Medical-PT-06-LTLCardinality-08
FORMULA_NAME Medical-PT-06-LTLCardinality-09
FORMULA_NAME Medical-PT-06-LTLCardinality-10
FORMULA_NAME Medical-PT-06-LTLCardinality-11
FORMULA_NAME Medical-PT-06-LTLCardinality-12
FORMULA_NAME Medical-PT-06-LTLCardinality-13
FORMULA_NAME Medical-PT-06-LTLCardinality-14
FORMULA_NAME Medical-PT-06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779691552642

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Medical-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 06:45:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 06:45:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 06:45:54] [INFO ] Load time of PNML (sax parser for PT used): 296 ms
[2026-05-25 06:45:54] [INFO ] Transformed 312 places.
[2026-05-25 06:45:54] [INFO ] Transformed 5431 transitions.
[2026-05-25 06:45:54] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 448 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 242 places in 41 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA Medical-PT-06-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1 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 14 ms. Remains 67 /69 variables (removed 2) and now considering 227/227 (removed 0) transitions.
[2026-05-25 06:45:54] [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-17168618739414075699.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10745369534324403516.kers'
[2026-05-25 06:45:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17168618739414075699.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10745369534324403516.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 06:45:54] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10745369534324403516.kers
Total runtime 1 ms.
[2026-05-25 06:45:55] [INFO ] Implicit Places using invariants in 310 ms returned []
[2026-05-25 06:45:55] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2026-05-25 06:45:55] [INFO ] Invariant cache hit.
[2026-05-25 06:45:55] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-25 06:45:55] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2026-05-25 06:45:55] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2026-05-25 06:45:55] [INFO ] Invariant cache hit.
[2026-05-25 06:45:55] [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, 1/132 constraints. Problems are: Problem set: 2 solved, 220 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 0/132 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 10 (OVERLAPS) 2/249 variables, 2/134 constraints. Problems are: Problem set: 2 solved, 220 unsolved
Problem TDEAD149 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD170 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 4/138 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/138 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 13 (OVERLAPS) 0/249 variables, 0/138 constraints. Problems are: Problem set: 6 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 138 constraints, problems are : Problem set: 6 solved, 216 unsolved in 13355 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: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 6/6 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 4/10 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 2/12 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 182/247 variables, 65/77 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 56/133 constraints. Problems are: Problem set: 6 solved, 216 unsolved
Problem TDEAD8 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD223 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 133/266 constraints. Problems are: Problem set: 12 solved, 210 unsolved
Problem TDEAD177 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 10/276 constraints. Problems are: Problem set: 13 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 0/276 constraints. Problems are: Problem set: 13 solved, 209 unsolved
At refinement iteration 10 (OVERLAPS) 2/249 variables, 2/278 constraints. Problems are: Problem set: 13 solved, 209 unsolved
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 82/360 constraints. Problems are: Problem set: 17 solved, 205 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 3/363 constraints. Problems are: Problem set: 17 solved, 205 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 1/364 constraints. Problems are: Problem set: 17 solved, 205 unsolved
Problem TDEAD135 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD224 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 2/366 constraints. Problems are: Problem set: 21 solved, 201 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 1/367 constraints. Problems are: Problem set: 21 solved, 201 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 1/368 constraints. Problems are: Problem set: 21 solved, 201 unsolved
Problem TDEAD71 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD106 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 249/249 variables, and 369 constraints, problems are : Problem set: 24 solved, 198 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 67/67 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 215/222 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 12/12 constraints]
After SMT, in 43657ms problems are : Problem set: 24 solved, 198 unsolved
Search for dead transitions found 24 dead transitions in 43670ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 67/69 places, 203/227 transitions.
Reduce places removed 7 places and 48 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 60 transition count 155
Reduce places removed 4 places and 29 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 56 transition count 126
Reduce places removed 2 places and 13 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 54 transition count 113
Reduce places removed 3 places and 18 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 16 place count 51 transition count 95
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 17 place count 50 transition count 91
Reduce places removed 1 places and 5 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 18 place count 49 transition count 86
Applied a total of 18 rules in 2 ms. Remains 49 /67 variables (removed 18) and now considering 86/203 (removed 117) transitions.
[2026-05-25 06:46:39] [INFO ] Flow matrix only has 78 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-6460790643849394403.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9837651019613841382.kers'
[2026-05-25 06:46:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6460790643849394403.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9837651019613841382.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 78 rows 49 cols 291 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-25 06:46:39] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9837651019613841382.kers
Total runtime 0 ms.
[2026-05-25 06:46:39] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-25 06:46:39] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2026-05-25 06:46:39] [INFO ] Invariant cache hit.
[2026-05-25 06:46:39] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-25 06:46:39] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 49/69 places, 86/227 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44750 ms. Remains : 49/69 places, 86/227 transitions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 86/86 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2026-05-25 06:46:39] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2026-05-25 06:46:39] [INFO ] Invariant cache hit.
[2026-05-25 06:46:39] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-25 06:46:39] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2026-05-25 06:46:39] [INFO ] Invariant cache hit.
[2026-05-25 06:46:39] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-25 06:46:40] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 1073 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2026-05-25 06:46:40] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2026-05-25 06:46:40] [INFO ] Invariant cache hit.
[2026-05-25 06:46:40] [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, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 2/47 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 78/125 variables, 47/56 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 39/95 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 2/127 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 81 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 99 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2903 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 2/47 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 78/125 variables, 47/56 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 39/95 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 54/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 2/127 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 27/178 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/127 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/127 variables, 4/186 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/127 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 15 (OVERLAPS) 0/127 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/127 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/127 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 18 (OVERLAPS) 0/127 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/127 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 20 (OVERLAPS) 0/127 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/127 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 22 (OVERLAPS) 0/127 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/127 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 24 (OVERLAPS) 0/127 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 193 constraints, problems are : Problem set: 0 solved, 81 unsolved in 22449 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 25397ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 25398ms
Finished structural reductions in LTL mode , in 1 iterations and 26473 ms. Remains : 49/49 places, 86/86 transitions.
Support contains 1 out of 49 places after structural reductions.
[2026-05-25 06:47:06] [INFO ] Flatten gal took : 57 ms
[2026-05-25 06:47:06] [INFO ] Flatten gal took : 21 ms
[2026-05-25 06:47:06] [INFO ] Input system was already deterministic with 86 transitions.
RANDOM walk for 40000 steps (260 resets) in 517 ms. (77 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (11 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1791897 steps, run timeout after 3001 ms. (steps per millisecond=597 ) properties seen :0 out of 1
Probabilistic random walk after 1791897 steps, saw 1004261 distinct states, run finished after 3004 ms. (steps per millisecond=596 ) properties seen :0
[2026-05-25 06:47:09] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2026-05-25 06:47:09] [INFO ] Invariant cache hit.
[2026-05-25 06:47:09] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 21/35 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 51/86 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/86 variables, 22/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/86 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/88 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/88 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/88 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 111/127 variables, and 72 constraints, problems are : Problem set: 1 solved, 0 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 3/8 constraints, State Equation: 39/49 constraints, ReadFeed: 30/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 157ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
FORMULA Medical-PT-06-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 15 stable transitions
All properties solved by simple procedures.
Total runtime 75739 ms.

BK_STOP 1779691629978

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLCardinality -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-06"
export BK_EXAMINATION="LTLCardinality"
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-06, examination is LTLCardinality"
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-177969019800019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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