About the Execution of ITS-Tools for CANConstruction-PT-010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14047.199 | 1097408.00 | 1191436.00 | 12458.30 | TTTFTFTTTTFTTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).

Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r034-tall-177946842100622.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 CANConstruction-PT-010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100622
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 9.1K Mar 6 09:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Mar 6 09:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 6 09:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 09:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Mar 15 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 6 09:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 6 09:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 09:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Mar 6 09:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:49 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 173K 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 CANConstruction-PT-010-ReachabilityCardinality-2024-00
FORMULA_NAME CANConstruction-PT-010-ReachabilityCardinality-2024-01
FORMULA_NAME CANConstruction-PT-010-ReachabilityCardinality-2024-02
FORMULA_NAME CANConstruction-PT-010-ReachabilityCardinality-2024-03
FORMULA_NAME CANConstruction-PT-010-ReachabilityCardinality-2024-04
FORMULA_NAME CANConstruction-PT-010-ReachabilityCardinality-2024-05
FORMULA_NAME CANConstruction-PT-010-ReachabilityCardinality-2024-06
FORMULA_NAME CANConstruction-PT-010-ReachabilityCardinality-2024-07
FORMULA_NAME CANConstruction-PT-010-ReachabilityCardinality-2024-08
FORMULA_NAME CANConstruction-PT-010-ReachabilityCardinality-2024-09
FORMULA_NAME CANConstruction-PT-010-ReachabilityCardinality-2024-10
FORMULA_NAME CANConstruction-PT-010-ReachabilityCardinality-2024-11
FORMULA_NAME CANConstruction-PT-010-ReachabilityCardinality-2024-12
FORMULA_NAME CANConstruction-PT-010-ReachabilityCardinality-2024-13
FORMULA_NAME CANConstruction-PT-010-ReachabilityCardinality-2024-14
FORMULA_NAME CANConstruction-PT-010-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1779631887999
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-24 14:11:29] [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-24 14:11:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 14:11:29] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2026-05-24 14:11:29] [INFO ] Transformed 322 places.
[2026-05-24 14:11:29] [INFO ] Transformed 480 transitions.
[2026-05-24 14:11:29] [INFO ] Parsed PT model containing 322 places and 480 transitions and 1400 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (235 resets) in 1383 ms. (28 steps per ms) remains 7/16 properties
FORMULA CANConstruction-PT-010-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-010-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 14:11:29] [INFO ] Flatten gal took : 82 ms
[2026-05-24 14:11:29] [INFO ] Flatten gal took : 44 ms
BEST_FIRST walk for 40002 steps (29 resets) in 418 ms. (95 steps per ms) remains 7/7 properties
[2026-05-24 14:11:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13992376970879898968.gal : 35 ms
[2026-05-24 14:11:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15801576177962315466.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/ReachabilityCardinality13992376970879898968.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15801576177962315466.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (30 resets) in 202 ms. (197 steps per ms) remains 7/7 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 ...330
Loading property file /tmp/ReachabilityCardinality15801576177962315466.prop.
BEST_FIRST walk for 40004 steps (30 resets) in 460 ms. (86 steps per ms) remains 6/7 properties
FORMULA CANConstruction-PT-010-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (31 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (32 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :9 after 12
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :12 after 18
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :18 after 36
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :36 after 37
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :37 after 47
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :47 after 66
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :66 after 108
BEST_FIRST walk for 40004 steps (29 resets) in 415 ms. (96 steps per ms) remains 6/6 properties
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :108 after 177
BEST_FIRST walk for 40003 steps (28 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8683803069005334845.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16727043801855490897.kers'
[2026-05-24 14:11:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8683803069005334845.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16727043801855490897.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 480 rows 322 cols 1020 entries
Finished phase 1 with 291 SingleSign rule and 10 generalized
[2026-05-24 14:11:30] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16727043801855490897.kers
Total runtime 3 ms.
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :177 after 1367
[2026-05-24 14:11:30] [INFO ] State equation strengthened by 190 read => feed constraints.
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :1367 after 2130
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem CANConstruction-PT-010-ReachabilityCardinality-2024-03 is UNSAT
FORMULA CANConstruction-PT-010-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-010-ReachabilityCardinality-2024-09 is UNSAT
FORMULA CANConstruction-PT-010-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-010-ReachabilityCardinality-2024-12 is UNSAT
FORMULA CANConstruction-PT-010-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 219/297 variables, 18/18 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Problem CANConstruction-PT-010-ReachabilityCardinality-2024-11 is UNSAT
FORMULA CANConstruction-PT-010-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 24/321 variables, 3/21 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/21 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 480/801 variables, 321/342 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/801 variables, 190/532 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/801 variables, 0/532 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/802 variables, 1/533 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/802 variables, 0/533 constraints. Problems are: Problem set: 4 solved, 2 unsolved
SDD proceeding with computation,7 properties remain. new max is 8192
At refinement iteration 10 (OVERLAPS) 0/802 variables, 0/533 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 802/802 variables, and 533 constraints, problems are : Problem set: 4 solved, 2 unsolved in 597 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 322/322 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 unsolved
SDD size :2130 after 14384
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 260/291 variables, 17/17 constraints. Problems are: Problem set: 4 solved, 2 unsolved
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :14384 after 60593
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 14/31 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 1/32 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 0/32 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/292 variables, 1/33 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/33 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Problem CANConstruction-PT-010-ReachabilityCardinality-2024-04 is UNSAT
FORMULA CANConstruction-PT-010-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 29/321 variables, 3/36 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 6/42 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 1/43 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/321 variables, 0/43 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 480/801 variables, 321/364 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/801 variables, 190/554 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/801 variables, 1/555 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/801 variables, 0/555 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/802 variables, 1/556 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/802 variables, 0/556 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/802 variables, 0/556 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 802/802 variables, and 556 constraints, problems are : Problem set: 5 solved, 1 unsolved in 2627 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 322/322 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 1/6 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3313ms problems are : Problem set: 5 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 16 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 480/480 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 322 transition count 418
Reduce places removed 62 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 65 rules applied. Total rules applied 127 place count 260 transition count 415
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 130 place count 257 transition count 415
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 130 place count 257 transition count 414
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 256 transition count 414
Discarding 78 places :
Symmetric choice reduction at 3 with 78 rule applications. Total rules 210 place count 178 transition count 258
Iterating global reduction 3 with 78 rules applied. Total rules applied 288 place count 178 transition count 258
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 304 place count 170 transition count 250
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -61
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 322 place count 161 transition count 311
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 323 place count 161 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 324 place count 160 transition count 310
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 325 place count 160 transition count 309
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 326 place count 159 transition count 309
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 328 place count 159 transition count 309
Applied a total of 328 rules in 115 ms. Remains 159 /322 variables (removed 163) and now considering 309/480 (removed 171) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 159/322 places, 309/480 transitions.
RANDOM walk for 40000 steps (553 resets) in 297 ms. (134 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (62 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1849173 steps, run timeout after 3006 ms. (steps per millisecond=615 ) properties seen :0 out of 1
Probabilistic random walk after 1849173 steps, saw 219047 distinct states, run finished after 3014 ms. (steps per millisecond=613 ) 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-1571123120908350207.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2684512868020485650.kers'
[2026-05-24 14:11:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1571123120908350207.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2684512868020485650.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 309 rows 159 cols 670 entries
Finished phase 1 with 128 SingleSign rule and 10 generalized
[2026-05-24 14:11:36] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2684512868020485650.kers
Total runtime 1 ms.
[2026-05-24 14:11:36] [INFO ] State equation strengthened by 277 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/113 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/130 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/158 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 309/467 variables, 158/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/467 variables, 277/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/467 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/468 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/468 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/468 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 457 constraints, problems are : Problem set: 0 solved, 1 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 159/159 constraints, ReadFeed: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 5/113 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 17/130 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 28/158 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 309/467 variables, 158/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/467 variables, 277/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/467 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/467 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/468 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/468 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/468 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 468/468 variables, and 466 constraints, problems are : Problem set: 0 solved, 1 unsolved in 686 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 159/159 constraints, ReadFeed: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 877ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 16 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 309/309 transitions.
Applied a total of 0 rules in 10 ms. Remains 159 /159 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 159/159 places, 309/309 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 309/309 transitions.
Applied a total of 0 rules in 8 ms. Remains 159 /159 variables (removed 0) and now considering 309/309 (removed 0) transitions.
[2026-05-24 14:11:37] [INFO ] Invariant cache hit.
[2026-05-24 14:11:37] [INFO ] Implicit Places using invariants in 113 ms returned [5, 12, 20, 26, 32, 38, 44, 49, 55, 63]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 125 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 149/159 places, 309/309 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 147 transition count 307
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 147 transition count 307
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 36 place count 131 transition count 291
Applied a total of 36 rules in 64 ms. Remains 131 /149 variables (removed 18) and now considering 291/309 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1013599155362788259.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16997031939146396797.kers'
[2026-05-24 14:11:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1013599155362788259.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16997031939146396797.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 291 rows 131 cols 684 entries
Finished phase 1 with 120 SingleSign rule and 0 generalized
[2026-05-24 14:11:38] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16997031939146396797.kers
Total runtime 3 ms.
[2026-05-24 14:11:38] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-24 14:11:38] [INFO ] Invariant cache hit.
[2026-05-24 14:11:38] [INFO ] State equation strengthened by 269 read => feed constraints.
[2026-05-24 14:11:38] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 131/159 places, 291/309 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 671 ms. Remains : 131/159 places, 291/309 transitions.
RANDOM walk for 40000 steps (693 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (72 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
Reachability property CANConstruction-PT-010-ReachabilityCardinality-2024-08 is true.
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :60593 after 1.31483e+06
Interrupted probabilistic random walk after 2564131 steps, run timeout after 3001 ms. (steps per millisecond=854 ) properties seen :0 out of 1
Probabilistic random walk after 2564131 steps, saw 234773 distinct states, run finished after 3001 ms. (steps per millisecond=854 ) properties seen :0
[2026-05-24 14:11:41] [INFO ] Invariant cache hit.
[2026-05-24 14:11:41] [INFO ] State equation strengthened by 269 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 112/128 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/130 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 291/421 variables, 130/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 269/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/422 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/422 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 411 constraints, problems are : Problem set: 0 solved, 1 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 131/131 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 112/128 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2/130 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 291/421 variables, 130/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 269/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/422 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/422 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 421 constraints, problems are : Problem set: 0 solved, 1 unsolved in 746 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 131/131 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 901ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 16 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 291/291 transitions.
Applied a total of 0 rules in 35 ms. Remains 131 /131 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 131/131 places, 291/291 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 291/291 transitions.
Applied a total of 0 rules in 38 ms. Remains 131 /131 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2026-05-24 14:11:42] [INFO ] Invariant cache hit.
[2026-05-24 14:11:42] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-24 14:11:42] [INFO ] Invariant cache hit.
[2026-05-24 14:11:42] [INFO ] State equation strengthened by 269 read => feed constraints.
[2026-05-24 14:11:42] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2026-05-24 14:11:43] [INFO ] Redundant transitions in 19 ms returned []
Running 281 sub problems to find dead transitions.
[2026-05-24 14:11:43] [INFO ] Invariant cache hit.
[2026-05-24 14:11:43] [INFO ] State equation strengthened by 269 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 281 unsolved
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :1.31483e+06 after 1.53196e+06
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 291/421 variables, 130/150 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 269/419 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 1/422 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 281 unsolved
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :1.53196e+06 after 6.39561e+06
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 9 (OVERLAPS) 0/422 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 420 constraints, problems are : Problem set: 0 solved, 281 unsolved in 21533 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 131/131 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 291/421 variables, 130/151 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 269/420 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 281/701 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 1/422 variables, 1/702 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 10 (OVERLAPS) 0/422 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 702 constraints, problems are : Problem set: 0 solved, 281 unsolved in 26543 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 131/131 constraints, ReadFeed: 269/269 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48165ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 48171ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48657 ms. Remains : 131/131 places, 291/291 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 168 edges and 131 vertex of which 63 / 131 are part of one of the 7 SCC in 2 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 112 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 161 transitions.
Graph (complete) has 184 edges and 75 vertex of which 60 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 60 transition count 75
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 94 place count 38 transition count 56
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 94 place count 38 transition count 55
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 96 place count 37 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 99 place count 37 transition count 52
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 37 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 101 place count 36 transition count 51
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 107 place count 36 transition count 51
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 112 place count 31 transition count 46
Iterating global reduction 3 with 5 rules applied. Total rules applied 117 place count 31 transition count 46
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 29 transition count 44
Applied a total of 119 rules in 15 ms. Remains 29 /131 variables (removed 102) and now considering 44/291 (removed 247) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6369313957451413588.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5914617847923655941.kers'
[2026-05-24 14:12:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6369313957451413588.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5914617847923655941.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 44 rows 29 cols 77 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-24 14:12:31] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5914617847923655941.kers
Total runtime 0 ms.
[2026-05-24 14:12:31] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 14:12:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-24 14:12:31] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 14:12:31] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 14:12:31] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-24 14:12:31] [INFO ] Flatten gal took : 4 ms
[2026-05-24 14:12:31] [INFO ] Flatten gal took : 3 ms
[2026-05-24 14:12:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9206500037196024284.gal : 1 ms
[2026-05-24 14:12:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7690924480186551265.prop : 1 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/ReachabilityCardinality9206500037196024284.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7690924480186551265.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/ReachabilityCardinality7690924480186551265.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 15
Reachability property CANConstruction-PT-010-ReachabilityCardinality-2024-10 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 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,180,0.006302,4260,2,43,8,273,6,0,150,106,0
Total reachable state count : 180
Verifying 1 reachability properties.
Reachability property CANConstruction-PT-010-ReachabilityCardinality-2024-10 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANConstruction-PT-010-ReachabilityCardinality-2024-10,3,0.00715,4420,2,31,8,273,7,0,184,106,0
Over-approximation ignoring read arcs solved 0 properties in 130 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 14:12:31] [INFO ] Flatten gal took : 21 ms
[2026-05-24 14:12:31] [INFO ] Applying decomposition
[2026-05-24 14:12:31] [INFO ] Flatten gal took : 19 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/graph8314885651533972595.txt' '-o' '/tmp/graph8314885651533972595.bin' '-w' '/tmp/graph8314885651533972595.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8314885651533972595.bin' '-l' '-1' '-v' '-w' '/tmp/graph8314885651533972595.weights' '-q' '0' '-e' '0.001'
[2026-05-24 14:12:31] [INFO ] Decomposing Gal with order
[2026-05-24 14:12:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 14:12:31] [INFO ] Removed a total of 232 redundant transitions.
[2026-05-24 14:12:31] [INFO ] Flatten gal took : 86 ms
[2026-05-24 14:12:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 15 ms.
[2026-05-24 14:12:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8286420478942920020.gal : 9 ms
[2026-05-24 14:12:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17784520766443936718.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/ReachabilityCardinality8286420478942920020.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17784520766443936718.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 ...329
Loading property file /tmp/ReachabilityCardinality17784520766443936718.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 14
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :14 after 19
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :19 after 26
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :26 after 46
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :46 after 171
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :171 after 646
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :646 after 1429
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1429 after 25697
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :25697 after 33440
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :33440 after 68003
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :68003 after 231050
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :231050 after 942421
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :942421 after 6.11922e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :6.11922e+06 after 3.54912e+08
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\_flatf,8.65257e+10,1027.02,13426080,2,2.4269e+06,20,6.46306e+07,7,0,1742,3.15894e+07,0
Total reachable state count : 86525680270
Verifying 1 reachability properties.
Reachability property CANConstruction-PT-010-ReachabilityCardinality-2024-10 does not hold.
FORMULA CANConstruction-PT-010-ReachabilityCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : CANConstruction-PT-010-ReachabilityCardinality-2024-10
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANConstruction-PT-010-ReachabilityCardinality-2024-10,0,1030.01,13426080,1,0,20,6.46306e+07,7,0,1769,3.15894e+07,0
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 1096261 ms.
BK_STOP 1779632985407
--------------------
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="CANConstruction-PT-010"
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 CANConstruction-PT-010, 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 r034-tall-177946842100622"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-010.tgz
mv CANConstruction-PT-010 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 '
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 ;
