fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r146-tall-177961074100318
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for GPPP-PT-C0100N0000000010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1118.783 37263.00 81098.00 1431.20 FTTTFTTTFFFFTTTT 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.r146-tall-177961074100318.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 GPPP-PT-C0100N0000000010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074100318
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.6K Mar 7 11:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 7 11:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Mar 7 11:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 7 11:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 15 10:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Mar 7 11:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Mar 7 11:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 7 11:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 7 11:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1 Mar 3 18:30 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-00
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-01
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-02
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-03
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-04
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-05
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-06
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-07
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-08
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-09
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-10
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-11
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-12
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-13
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-14
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779714314930

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0100N0000000010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-25 13:05:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 13:05:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 13:05:16] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2026-05-25 13:05:16] [INFO ] Transformed 33 places.
[2026-05-25 13:05:16] [INFO ] Transformed 22 transitions.
[2026-05-25 13:05:16] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2026-05-25 13:05:16] [INFO ] Flatten gal took : 21 ms
[2026-05-25 13:05:16] [INFO ] Flatten gal took : 6 ms
RANDOM walk for 40015 steps (89 resets) in 960 ms. (41 steps per ms) remains 14/16 properties
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 13:05:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15924997827492145311.gal : 5 ms
[2026-05-25 13:05:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality988907651311261738.prop : 2 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/ReachabilityCardinality15924997827492145311.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality988907651311261738.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/ReachabilityCardinality988907651311261738.prop.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :8 after 22
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :22 after 54
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :54 after 77
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :77 after 214
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :214 after 950
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :950 after 3084
BEST_FIRST walk for 40004 steps (20 resets) in 436 ms. (91 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 255 ms. (156 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (24 resets) in 283 ms. (140 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (28 resets) in 373 ms. (106 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 249 ms. (160 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 132 ms. (300 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (28 resets) in 142 ms. (279 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (12 resets) in 133 ms. (298 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 1024
BEST_FIRST walk for 40003 steps (16 resets) in 116 ms. (341 steps per ms) remains 14/14 properties
SDD size :3084 after 129034
BEST_FIRST walk for 40004 steps (16 resets) in 113 ms. (350 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 162 ms. (245 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :129034 after 144600
BEST_FIRST walk for 40003 steps (15 resets) in 883 ms. (45 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (20 resets) in 239 ms. (166 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :144600 after 182930
BEST_FIRST walk for 40003 steps (24 resets) in 133 ms. (298 steps per ms) remains 14/14 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16043579825177779465.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1478887420697703063.kers'
[2026-05-25 13:05:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16043579825177779465.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1478887420697703063.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 22 rows 27 cols 71 entries
Finished phase 1 with 13 SingleSign rule and 8 generalized
[2026-05-25 13:05:17] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1478887420697703063.kers
Total runtime 1 ms.
Problem GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-00 is UNSAT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-02 is UNSAT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-03 is UNSAT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-07 is UNSAT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-08 is UNSAT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-10 is UNSAT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-15 is UNSAT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 8/8 constraints. Problems are: Problem set: 7 solved, 7 unsolved
Problem GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-01 is UNSAT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-05 is UNSAT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-12 is UNSAT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 4/12 constraints. Problems are: Problem set: 10 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 10 solved, 4 unsolved
Problem GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-11 is UNSAT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-13 is UNSAT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 22/55 variables, 33/45 constraints. Problems are: Problem set: 12 solved, 2 unsolved
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :182930 after 257908
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/45 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/55 variables, 0/45 constraints. Problems are: Problem set: 12 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 45 constraints, problems are : Problem set: 12 solved, 2 unsolved in 581 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 2/2 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 6/22 variables, 5/7 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 5/27 variables, 1/8 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 12 solved, 2 unsolved
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :257908 after 529958
At refinement iteration 6 (OVERLAPS) 6/33 variables, 4/12 constraints. Problems are: Problem set: 12 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 33/55 variables, and 12 constraints, problems are : Problem set: 12 solved, 2 unsolved in 2075 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/33 constraints, PredecessorRefiner: 0/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2732ms problems are : Problem set: 12 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
SDD proceeding with computation,14 properties remain. new max is 32768
SDD size :529958 after 1.19668e+06
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 1063 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 29 transition count 17
Applied a total of 7 rules in 1108 ms. Remains 29 /33 variables (removed 4) and now considering 17/22 (removed 5) transitions.
Running 16 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1763677534101807547.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10740208946996030403.kers'
[2026-05-25 13:05:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1763677534101807547.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10740208946996030403.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 17 rows 23 cols 60 entries
Finished phase 1 with 9 SingleSign rule and 8 generalized
[2026-05-25 13:05:21] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10740208946996030403.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem TDEAD12 is UNSAT
At refinement iteration 5 (OVERLAPS) 17/46 variables, 29/41 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/46 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 41 constraints, problems are : Problem set: 1 solved, 15 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/28 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1/29 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 15 unsolved
SDD proceeding with computation,14 properties remain. new max is 65536
SDD size :1.19668e+06 after 1.62368e+07
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 46/46 variables, and 41 constraints, problems are : Problem set: 1 solved, 15 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 0/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20231ms problems are : Problem set: 1 solved, 15 unsolved
Search for dead transitions found 1 dead transitions in 20231ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 29/33 places, 16/22 transitions.
Graph (complete) has 75 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 28 /29 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 21388 ms. Remains : 28/33 places, 16/22 transitions.
RANDOM walk for 40025 steps (101 resets) in 328 ms. (121 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (20 resets) in 284 ms. (140 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (28 resets) in 280 ms. (142 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1947290 steps, run timeout after 3001 ms. (steps per millisecond=648 ) properties seen :0 out of 2
Probabilistic random walk after 1947290 steps, saw 312413 distinct states, run finished after 3005 ms. (steps per millisecond=648 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8743795512974220957.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7935302079626734803.kers'
[2026-05-25 13:05:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8743795512974220957.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7935302079626734803.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 16 rows 22 cols 56 entries
Finished phase 1 with 9 SingleSign rule and 7 generalized
[2026-05-25 13:05:45] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7935302079626734803.kers
Total runtime 1 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 6/22 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 3/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/28 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 16/44 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/44 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/44 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 40 constraints, problems are : Problem set: 0 solved, 2 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 6/22 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 3/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/28 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-04 is UNSAT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-06 is UNSAT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 44/44 variables, and 40 constraints, problems are : Problem set: 2 solved, 0 unsolved in 6876 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6959ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
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 36093 ms.

BK_STOP 1779714352193

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

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