fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r018-smll-177946788000118
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for AutonomousCar-PT-08a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7795.195 524771.00 665354.00 1405.20 TFTTFTTFFFTFTFFF 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.r018-smll-177946788000118.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 AutonomousCar-PT-08a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946788000118
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 6.3K Mar 5 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 5 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 5 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 5 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 07:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 5 16:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Mar 5 16:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 5 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 5 16:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 448K 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 AutonomousCar-PT-08a-ReachabilityCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-2024-12
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-2024-13
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-2024-14
FORMULA_NAME AutonomousCar-PT-08a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779497418845

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-23 00:50:21] [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-23 00:50:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 00:50:21] [INFO ] Load time of PNML (sax parser for PT used): 302 ms
[2026-05-23 00:50:21] [INFO ] Transformed 81 places.
[2026-05-23 00:50:21] [INFO ] Transformed 849 transitions.
[2026-05-23 00:50:21] [INFO ] Found NUPN structural information;
[2026-05-23 00:50:21] [INFO ] Parsed PT model containing 81 places and 849 transitions and 8894 arcs in 561 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 47 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 275 transitions
Reduce redundant transitions removed 275 transitions.
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 00:50:23] [INFO ] Flatten gal took : 650 ms
RANDOM walk for 40000 steps (2036 resets) in 4810 ms. (8 steps per ms) remains 6/13 properties
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (169 resets) in 423 ms. (94 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (181 resets) in 209 ms. (190 steps per ms) remains 6/6 properties
[2026-05-23 00:50:23] [INFO ] Flatten gal took : 355 ms
BEST_FIRST walk for 40004 steps (190 resets) in 483 ms. (82 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (183 resets) in 205 ms. (194 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (156 resets) in 199 ms. (200 steps per ms) remains 6/6 properties
[2026-05-23 00:50:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5183230887214191932.gal : 193 ms
[2026-05-23 00:50:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18441736908745270357.prop : 7 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/ReachabilityCardinality5183230887214191932.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18441736908745270357.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40004 steps (152 resets) in 875 ms. (45 steps per ms) remains 6/6 properties
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 ...329
[2026-05-23 00:50:24] [INFO ] Flow matrix only has 573 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-395138610077477469.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3486594741376917006.kers'
[2026-05-23 00:50:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-395138610077477469.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3486594741376917006.kers]
Normalized transition count is 572 out of 573 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 572 rows 80 cols 6287 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-23 00:50:24] [INFO ] Computed 13 invariants in 4 ms
Computed 13 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3486594741376917006.kers
Total runtime 7 ms.
[2026-05-23 00:50:24] [INFO ] State equation strengthened by 259 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality18441736908745270357.prop.
Problem AutonomousCar-PT-08a-ReachabilityCardinality-2024-01 is UNSAT
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :8 after 10
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 46
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :46 after 58
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :58 after 338
All remaining problems are real, not stopping.
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :338 after 1906
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 61/61 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AutonomousCar-PT-08a-ReachabilityCardinality-2024-15 is UNSAT
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 5/66 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/66 constraints. Problems are: Problem set: 2 solved, 4 unsolved
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :1906 after 11790
Problem AutonomousCar-PT-08a-ReachabilityCardinality-2024-14 is UNSAT
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 20/81 variables, 8/74 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 20/94 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/94 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 572/653 variables, 81/175 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/653 variables, 258/433 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/653 variables, 0/433 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/654 variables, 1/434 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/654 variables, 0/434 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/654 variables, 0/434 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 654/654 variables, and 434 constraints, problems are : Problem set: 3 solved, 3 unsolved in 1354 ms.
Refiners :[Domain max(s): 81/81 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 81/81 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 26/26 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/26 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 40/66 variables, 10/36 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 40/76 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/76 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 15/81 variables, 3/79 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 15/94 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/94 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 572/653 variables, 81/175 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/653 variables, 258/433 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/653 variables, 5/438 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/653 variables, 0/438 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/654 variables, 1/439 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/654 variables, 0/439 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/654 variables, 0/439 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 654/654 variables, and 439 constraints, problems are : Problem set: 3 solved, 3 unsolved in 2243 ms.
Refiners :[Domain max(s): 81/81 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 81/81 constraints, ReadFeed: 259/259 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 3851ms problems are : Problem set: 3 solved, 3 unsolved
Parikh walk visited 0 properties in 946 ms.
Support contains 26 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 574/574 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 81 transition count 568
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 77 transition count 568
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 16 place count 71 transition count 514
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 71 transition count 514
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 69 transition count 512
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 31 place count 69 transition count 507
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 60 place count 64 transition count 483
Applied a total of 60 rules in 216 ms. Remains 64 /81 variables (removed 17) and now considering 483/574 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 226 ms. Remains : 64/81 places, 483/574 transitions.
RANDOM walk for 40000 steps (1932 resets) in 746 ms. (53 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (251 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (148 resets) in 190 ms. (209 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (211 resets) in 112 ms. (354 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 756343 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :1 out of 3
Probabilistic random walk after 756343 steps, saw 104704 distinct states, run finished after 3019 ms. (steps per millisecond=250 ) properties seen :1
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10920827804141500829.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18035388815520319102.kers'
[2026-05-23 00:50:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10920827804141500829.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18035388815520319102.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 483 rows 63 cols 5821 entries
Finished phase 1 with 51 SingleSign rule and 0 generalized
[2026-05-23 00:50:32] [INFO ] Computed 13 invariants in 5 ms
Computed 13 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-18035388815520319102.kers
Total runtime 7 ms.
[2026-05-23 00:50:32] [INFO ] State equation strengthened by 186 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 32/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 9/64 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 483/547 variables, 64/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 186/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/547 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 547/547 variables, and 263 constraints, problems are : Problem set: 0 solved, 2 unsolved in 394 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 64/64 constraints, ReadFeed: 186/186 constraints, PredecessorRefiner: 2/0 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 32/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 9/64 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 483/547 variables, 64/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 186/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/547 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/547 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 547/547 variables, and 267 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1338 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 64/64 constraints, ReadFeed: 186/186 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1787ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 500 ms.
Support contains 23 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 483/483 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 64 transition count 482
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 63 transition count 474
Applied a total of 10 rules in 111 ms. Remains 63 /64 variables (removed 1) and now considering 474/483 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 63/64 places, 474/483 transitions.
RANDOM walk for 40000 steps (1580 resets) in 898 ms. (44 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (158 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (212 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 900649 steps, run timeout after 3001 ms. (steps per millisecond=300 ) properties seen :0 out of 2
Probabilistic random walk after 900649 steps, saw 116403 distinct states, run finished after 3001 ms. (steps per millisecond=300 ) 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-7970212239655684590.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7052873433586277291.kers'
[2026-05-23 00:50:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7970212239655684590.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7052873433586277291.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 474 rows 62 cols 5771 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-23 00:50:38] [INFO ] Computed 13 invariants in 4 ms
Computed 13 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7052873433586277291.kers
Total runtime 5 ms.
[2026-05-23 00:50:38] [INFO ] State equation strengthened by 178 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/54 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 9/63 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 474/537 variables, 63/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 178/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/537 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/537 variables, and 254 constraints, problems are : Problem set: 0 solved, 2 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 63/63 constraints, ReadFeed: 178/178 constraints, PredecessorRefiner: 2/0 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/54 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 9/63 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 474/537 variables, 63/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 178/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/537 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 537/537 variables, and 255 constraints, problems are : Problem set: 0 solved, 2 unsolved in 581 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 63/63 constraints, ReadFeed: 178/178 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 903ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 931 ms.
Support contains 23 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 474/474 transitions.
Applied a total of 0 rules in 38 ms. Remains 63 /63 variables (removed 0) and now considering 474/474 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 63/63 places, 474/474 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 474/474 transitions.
Applied a total of 0 rules in 34 ms. Remains 63 /63 variables (removed 0) and now considering 474/474 (removed 0) transitions.
[2026-05-23 00:50:40] [INFO ] Invariant cache hit.
[2026-05-23 00:50:40] [INFO ] Implicit Places using invariants in 295 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 317 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 62/63 places, 474/474 transitions.
Applied a total of 0 rules in 37 ms. Remains 62 /62 variables (removed 0) and now considering 474/474 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 389 ms. Remains : 62/63 places, 474/474 transitions.
RANDOM walk for 40000 steps (1623 resets) in 719 ms. (55 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (155 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (204 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1012260 steps, run timeout after 3001 ms. (steps per millisecond=337 ) properties seen :0 out of 2
Probabilistic random walk after 1012260 steps, saw 128678 distinct states, run finished after 3001 ms. (steps per millisecond=337 ) 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-7339789049685167201.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12795445698977578802.kers'
[2026-05-23 00:50:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7339789049685167201.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12795445698977578802.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 474 rows 62 cols 5771 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-23 00:50:44] [INFO ] Computed 12 invariants in 3 ms
Computed 12 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12795445698977578802.kers
Total runtime 4 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/54 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/62 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 474/536 variables, 62/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/536 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/536 variables, and 74 constraints, problems are : Problem set: 0 solved, 2 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 2/0 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/54 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 8/62 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 474/536 variables, 62/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 6/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/536 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 536/536 variables, and 82 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1725 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 1995ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 710 ms.
Support contains 23 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 474/474 transitions.
Applied a total of 0 rules in 44 ms. Remains 62 /62 variables (removed 0) and now considering 474/474 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 62/62 places, 474/474 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 474/474 transitions.
Applied a total of 0 rules in 33 ms. Remains 62 /62 variables (removed 0) and now considering 474/474 (removed 0) transitions.
[2026-05-23 00:50:46] [INFO ] Invariant cache hit.
[2026-05-23 00:50:47] [INFO ] Implicit Places using invariants in 153 ms returned []
[2026-05-23 00:50:47] [INFO ] Invariant cache hit.
[2026-05-23 00:50:47] [INFO ] Implicit Places using invariants and state equation in 335 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 493 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/62 places, 474/474 transitions.
Applied a total of 0 rules in 34 ms. Remains 61 /61 variables (removed 0) and now considering 474/474 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 561 ms. Remains : 61/62 places, 474/474 transitions.
RANDOM walk for 40000 steps (1592 resets) in 694 ms. (57 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (140 resets) in 207 ms. (192 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (206 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 925198 steps, run timeout after 3001 ms. (steps per millisecond=308 ) properties seen :0 out of 2
Probabilistic random walk after 925198 steps, saw 119078 distinct states, run finished after 3003 ms. (steps per millisecond=308 ) 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-13118357052692886210.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10432420214935244635.kers'
[2026-05-23 00:50:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13118357052692886210.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10432420214935244635.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 474 rows 61 cols 5767 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-23 00:50:50] [INFO ] Computed 11 invariants in 3 ms
Computed 11 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10432420214935244635.kers
Total runtime 6 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/60 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 474/534 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/535 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/535 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 72 constraints, problems are : Problem set: 0 solved, 2 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 2/0 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 29/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 8/60 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 474/534 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/535 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/535 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/535 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 77 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1058 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 1438ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 438 ms.
Support contains 23 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 474/474 transitions.
Applied a total of 0 rules in 20 ms. Remains 61 /61 variables (removed 0) and now considering 474/474 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 61/61 places, 474/474 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 474/474 transitions.
Applied a total of 0 rules in 20 ms. Remains 61 /61 variables (removed 0) and now considering 474/474 (removed 0) transitions.
[2026-05-23 00:50:52] [INFO ] Invariant cache hit.
[2026-05-23 00:50:52] [INFO ] Implicit Places using invariants in 165 ms returned []
[2026-05-23 00:50:52] [INFO ] Invariant cache hit.
[2026-05-23 00:50:53] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2026-05-23 00:50:53] [INFO ] Redundant transitions in 57 ms returned []
Running 473 sub problems to find dead transitions.
[2026-05-23 00:50:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (OVERLAPS) 2/60 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 473 unsolved
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :11790 after 6.52237e+06
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 474/534 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 5/77 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/535 variables, and 79 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 60/61 constraints, PredecessorRefiner: 473/39 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (OVERLAPS) 2/60 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 474/534 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 37/109 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 7/116 constraints. Problems are: Problem set: 0 solved, 473 unsolved
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :6.52237e+06 after 6.66572e+06
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 116 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 60/61 constraints, PredecessorRefiner: 471/39 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 61134ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 61147ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61714 ms. Remains : 61/61 places, 474/474 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 00:51:54] [INFO ] Flatten gal took : 87 ms
[2026-05-23 00:51:54] [INFO ] Applying decomposition
[2026-05-23 00:51:54] [INFO ] Flatten gal took : 85 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph18254899433760896910.txt' '-o' '/tmp/graph18254899433760896910.bin' '-w' '/tmp/graph18254899433760896910.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18254899433760896910.bin' '-l' '-1' '-v' '-w' '/tmp/graph18254899433760896910.weights' '-q' '0' '-e' '0.001'
[2026-05-23 00:51:55] [INFO ] Decomposing Gal with order
[2026-05-23 00:51:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 00:51:55] [INFO ] Removed a total of 2960 redundant transitions.
[2026-05-23 00:51:55] [INFO ] Flatten gal took : 290 ms
[2026-05-23 00:51:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 74 ms.
[2026-05-23 00:51:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15472578114065481889.gal : 17 ms
[2026-05-23 00:51:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14789832318815891341.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15472578114065481889.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14789832318815891341.prop' '--nowitness'

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 ...309
Loading property file /tmp/ReachabilityCardinality14789832318815891341.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :2 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 5647
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5647 after 5711
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :5711 after 5.49484e+06
Invariant property AutonomousCar-PT-08a-ReachabilityCardinality-2024-11 does not hold.
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property AutonomousCar-PT-08a-ReachabilityCardinality-2024-08 does not hold.
FORMULA AutonomousCar-PT-08a-ReachabilityCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.05852e+08,424.918,7011200,8331,141,2.32969e+06,2332,987,8.83339e+07,81,18404,0
Total reachable state count : 205851569

Verifying 2 reachability properties.
Invariant property AutonomousCar-PT-08a-ReachabilityCardinality-2024-08 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutonomousCar-PT-08a-ReachabilityCardinality-2024-08,14406,425.812,7011200,139,25,2.32969e+06,2332,1059,8.83339e+07,94,18404,0
Invariant property AutonomousCar-PT-08a-ReachabilityCardinality-2024-11 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutonomousCar-PT-08a-ReachabilityCardinality-2024-11,16807,426.232,7011200,170,27,2.32969e+06,2332,1085,8.83339e+07,94,18404,0
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 522225 ms.

BK_STOP 1779497943616

--------------------
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="AutonomousCar-PT-08a"
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 AutonomousCar-PT-08a, 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 r018-smll-177946788000118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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