About the Execution of ITS-Tools for CANConstruction-PT-030
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16203.304 | 3600000.00 | 4727524.00 | 395905.30 | TT?TTFTTFFTFFFTF | 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-177946842100638.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-030, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100638
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 9.2K Mar 6 09:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 6 09:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 6 09:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 09:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Mar 15 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 15 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 09:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Mar 6 09:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 6 09:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 6 09:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:50 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 1.4M 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-030-ReachabilityCardinality-2024-00
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-01
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-02
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-03
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-04
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-05
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-06
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-07
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-08
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-09
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-10
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-11
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-12
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-13
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-14
FORMULA_NAME CANConstruction-PT-030-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1779636868168
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-030
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-24 15:34: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 15:34:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 15:34:29] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2026-05-24 15:34:29] [INFO ] Transformed 2162 places.
[2026-05-24 15:34:29] [INFO ] Transformed 3840 transitions.
[2026-05-24 15:34:29] [INFO ] Parsed PT model containing 2162 places and 3840 transitions and 11400 arcs in 292 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (75 resets) in 2365 ms. (16 steps per ms) remains 5/16 properties
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 15:34:30] [INFO ] Flatten gal took : 350 ms
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 296 ms. (134 steps per ms) remains 5/5 properties
[2026-05-24 15:34:30] [INFO ] Flatten gal took : 170 ms
[2026-05-24 15:34:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11397462598015272841.gal : 158 ms
[2026-05-24 15:34:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12422951535825733064.prop : 4 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/ReachabilityCardinality11397462598015272841.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12422951535825733064.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 ...330
BEST_FIRST walk for 40004 steps (8 resets) in 1224 ms. (32 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 5/5 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6337242589464096819.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10584682242930197809.kers'
[2026-05-24 15:34:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6337242589464096819.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10584682242930197809.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 3840 rows 2162 cols 7860 entries
Finished phase 1 with 2071 SingleSign rule and 30 generalized
[2026-05-24 15:34:31] [INFO ] Computed 61 invariants in 13 ms
Computed 61 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-10584682242930197809.kers
Total runtime 20 ms.
[2026-05-24 15:34:31] [INFO ] State equation strengthened by 1770 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality12422951535825733064.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem CANConstruction-PT-030-ReachabilityCardinality-2024-03 is UNSAT
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-030-ReachabilityCardinality-2024-05 is UNSAT
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 1936/2080 variables, 45/45 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2080 variables, 0/45 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 13/2093 variables, 13/58 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2093 variables, 0/58 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 68/2161 variables, 3/61 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2161 variables, 0/61 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3840/6001 variables, 2161/2222 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6001 variables, 1770/3992 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6001 variables, 0/3992 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/6002 variables, 1/3993 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/6002 variables, 0/3993 constraints. Problems are: Problem set: 2 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 32
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :32 after 33
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :33 after 35
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :35 after 38
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :38 after 44
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :44 after 55
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :55 after 64
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :64 after 74
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :74 after 85
At refinement iteration 12 (OVERLAPS) 0/6002 variables, 0/3993 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6002/6002 variables, and 3993 constraints, problems are : Problem set: 2 solved, 3 unsolved in 3916 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 2162/2162 constraints, ReadFeed: 1770/1770 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1904/2008 variables, 43/43 constraints. Problems are: Problem set: 2 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :991 after 1018
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :1018 after 1076
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :1076 after 1241
SMT process timed out in 9270ms, After SMT, problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 104 out of 2162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2162/2162 places, 3840/3840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 175 transitions
Trivial Post-agglo rules discarded 175 transitions
Performed 175 trivial Post agglomeration. Transition count delta: 175
Iterating post reduction 0 with 175 rules applied. Total rules applied 175 place count 2162 transition count 3665
Reduce places removed 175 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 186 rules applied. Total rules applied 361 place count 1987 transition count 3654
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 372 place count 1976 transition count 3654
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 372 place count 1976 transition count 3648
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 384 place count 1970 transition count 3648
Discarding 802 places :
Symmetric choice reduction at 3 with 802 rule applications. Total rules 1186 place count 1168 transition count 2044
Iterating global reduction 3 with 802 rules applied. Total rules applied 1988 place count 1168 transition count 2044
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 2030 place count 1147 transition count 2023
Free-agglomeration rule applied 15 times.
Iterating global reduction 3 with 15 rules applied. Total rules applied 2045 place count 1147 transition count 2008
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 2060 place count 1132 transition count 2008
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 2067 place count 1132 transition count 2001
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 2074 place count 1125 transition count 2001
Partial Free-agglomeration rule applied 46 times.
Drop transitions (Partial Free agglomeration) removed 46 transitions
Iterating global reduction 5 with 46 rules applied. Total rules applied 2120 place count 1125 transition count 2001
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 2124 place count 1125 transition count 2001
Applied a total of 2124 rules in 1240 ms. Remains 1125 /2162 variables (removed 1037) and now considering 2001/3840 (removed 1839) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1254 ms. Remains : 1125/2162 places, 2001/3840 transitions.
RANDOM walk for 40000 steps (172 resets) in 667 ms. (59 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 189161 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 3
Probabilistic random walk after 189161 steps, saw 67897 distinct states, run finished after 3008 ms. (steps per millisecond=62 ) 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-12309143728543787644.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9167929656853519901.kers'
[2026-05-24 15:34:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12309143728543787644.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9167929656853519901.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 2001 rows 1125 cols 4202 entries
Finished phase 1 with 1034 SingleSign rule and 30 generalized
[2026-05-24 15:34:45] [INFO ] Computed 61 invariants in 5 ms
Computed 61 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-9167929656853519901.kers
Total runtime 7 ms.
[2026-05-24 15:34:45] [INFO ] State equation strengthened by 1811 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 939/1043 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1043 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 13/1056 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1056 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 35/1091 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1091 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 33/1124 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1124 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2001/3125 variables, 1124/1185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3125 variables, 1811/2996 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3125 variables, 0/2996 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/3126 variables, 1/2997 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :1241 after 3177
At refinement iteration 13 (INCLUDED_ONLY) 0/3126 variables, 0/2997 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/3126 variables, 0/2997 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3126/3126 variables, and 2997 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2476 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1125/1125 constraints, ReadFeed: 1811/1811 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 939/1043 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :3177 after 4283
At refinement iteration 2 (INCLUDED_ONLY) 0/1043 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :4283 after 6567
At refinement iteration 3 (INCLUDED_ONLY) 0/1043 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1043 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1043 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1043 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1043 variables, 20/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 47853ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 104 out of 1125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1125/1125 places, 2001/2001 transitions.
Applied a total of 0 rules in 67 ms. Remains 1125 /1125 variables (removed 0) and now considering 2001/2001 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1125/1125 places, 2001/2001 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1125/1125 places, 2001/2001 transitions.
Applied a total of 0 rules in 62 ms. Remains 1125 /1125 variables (removed 0) and now considering 2001/2001 (removed 0) transitions.
[2026-05-24 15:35:33] [INFO ] Invariant cache hit.
[2026-05-24 15:35:33] [INFO ] Implicit Places using invariants in 752 ms returned [5, 12, 20, 28, 33, 42, 48, 55, 66, 72, 78, 85, 91, 97, 101, 107, 113, 120, 126, 138, 144, 149, 154, 160, 165, 169, 178, 184]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 767 ms to find 28 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1097/1125 places, 2001/2001 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1097 transition count 1986
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 1082 transition count 1986
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 35 place count 1077 transition count 1981
Iterating global reduction 2 with 5 rules applied. Total rules applied 40 place count 1077 transition count 1981
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 2 with 32 rules applied. Total rules applied 72 place count 1061 transition count 1965
Applied a total of 72 rules in 161 ms. Remains 1061 /1097 variables (removed 36) and now considering 1965/2001 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4597310790002395657.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7848961828433101780.kers'
[2026-05-24 15:35:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4597310790002395657.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7848961828433101780.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 1965 rows 1061 cols 4060 entries
Finished phase 1 with 1026 SingleSign rule and 2 generalized
[2026-05-24 15:35:33] [INFO ] Computed 33 invariants in 16 ms
Computed 33 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-7848961828433101780.kers
Total runtime 18 ms.
[2026-05-24 15:35:34] [INFO ] Implicit Places using invariants in 658 ms returned []
[2026-05-24 15:35:34] [INFO ] Invariant cache hit.
[2026-05-24 15:35:35] [INFO ] State equation strengthened by 1770 read => feed constraints.
[2026-05-24 15:35:48] [INFO ] Implicit Places using invariants and state equation in 13529 ms returned []
Implicit Place search using SMT with State Equation took 14189 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1061/1125 places, 1965/2001 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 15180 ms. Remains : 1061/1125 places, 1965/2001 transitions.
RANDOM walk for 40000 steps (176 resets) in 450 ms. (88 steps per ms) remains 2/3 properties
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
[2026-05-24 15:35:48] [INFO ] Invariant cache hit.
[2026-05-24 15:35:48] [INFO ] State equation strengthened by 1770 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 832/888 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/888 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 168/1056 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1056 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/1060 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1060 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1965/3025 variables, 1060/1093 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3025 variables, 1770/2863 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3025 variables, 0/2863 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/3026 variables, 1/2864 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3026 variables, 0/2864 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/3026 variables, 0/2864 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3026/3026 variables, and 2864 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1258 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1061/1061 constraints, ReadFeed: 1770/1770 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 832/888 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,5 properties remain. new max is 131072
SDD size :6567 after 8553
At refinement iteration 2 (INCLUDED_ONLY) 0/888 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/888 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/888 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/888 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/888 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/888 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/888 variables, 9/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/888 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/888 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 168/1056 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1056 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1056 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1056 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1056 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1056 variables, 18/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1056 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 4/1060 variables, 4/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1060 variables, 20/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1060 variables, 12/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1060 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1060 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1060 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1965/3025 variables, 1060/1358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3025 variables, 1770/3128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3025 variables, 2/3130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3025 variables, 0/3130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem CANConstruction-PT-030-ReachabilityCardinality-2024-09 is UNSAT
FORMULA CANConstruction-PT-030-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 29 (OVERLAPS) 1/3026 variables, 1/3131 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3026 variables, 0/3131 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/3026 variables, 0/3131 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3026/3026 variables, and 3131 constraints, problems are : Problem set: 1 solved, 1 unsolved in 62560 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1061/1061 constraints, ReadFeed: 1770/1770 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 265/265 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63846ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 43 ms.
Support contains 34 out of 1061 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1061/1061 places, 1965/1965 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1061 transition count 1959
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 1055 transition count 1959
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 1055 transition count 1958
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 14 place count 1054 transition count 1958
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 33 place count 1035 transition count 1920
Iterating global reduction 2 with 19 rules applied. Total rules applied 52 place count 1035 transition count 1920
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 1021 transition count 1906
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 1020 transition count 1904
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 1020 transition count 1904
Applied a total of 82 rules in 211 ms. Remains 1020 /1061 variables (removed 41) and now considering 1904/1965 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212 ms. Remains : 1020/1061 places, 1904/1965 transitions.
RANDOM walk for 40000 steps (185 resets) in 530 ms. (75 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 238202 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 1
Probabilistic random walk after 238202 steps, saw 84529 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) 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-6916496724514312743.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12379453955852993045.kers'
[2026-05-24 15:36:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6916496724514312743.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12379453955852993045.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1904 rows 1020 cols 3918 entries
Finished phase 1 with 985 SingleSign rule and 2 generalized
[2026-05-24 15:36:55] [INFO ] Computed 33 invariants in 15 ms
Computed 33 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-12379453955852993045.kers
Total runtime 17 ms.
[2026-05-24 15:36:55] [INFO ] State equation strengthened by 1779 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 650/684 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/684 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/685 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/685 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 325/1010 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1010 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/1019 variables, 9/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1019 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1904/2923 variables, 1019/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2923 variables, 1779/2831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2923 variables, 0/2831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/2924 variables, 1/2832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2924 variables, 0/2832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2924 variables, 0/2832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2924/2924 variables, and 2832 constraints, problems are : Problem set: 0 solved, 1 unsolved in 912 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1020/1020 constraints, ReadFeed: 1779/1779 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/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 650/684 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/684 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/684 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/684 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/684 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/684 variables, 11/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/684 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/685 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/685 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 325/1010 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1010 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1010 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1010 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 9/1019 variables, 9/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1019 variables, 6/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1019 variables, 11/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1019 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1904/2923 variables, 1019/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2923 variables, 1779/2942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2923 variables, 1/2943 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2923 variables, 0/2943 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/2924 variables, 1/2944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2924 variables, 0/2944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2924 variables, 0/2944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2924/2924 variables, and 2944 constraints, problems are : Problem set: 0 solved, 1 unsolved in 22068 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 1020/1020 constraints, ReadFeed: 1779/1779 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 111/111 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23034ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 34 out of 1020 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1020/1020 places, 1904/1904 transitions.
Applied a total of 0 rules in 80 ms. Remains 1020 /1020 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 1020/1020 places, 1904/1904 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1020/1020 places, 1904/1904 transitions.
Applied a total of 0 rules in 58 ms. Remains 1020 /1020 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
[2026-05-24 15:37:18] [INFO ] Invariant cache hit.
[2026-05-24 15:37:19] [INFO ] Implicit Places using invariants in 624 ms returned [36, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 627 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1018/1020 places, 1904/1904 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1016 transition count 1902
Applied a total of 4 rules in 89 ms. Remains 1016 /1018 variables (removed 2) and now considering 1902/1904 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2070360254302394737.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18125270615168214798.kers'
[2026-05-24 15:37:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2070360254302394737.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18125270615168214798.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1902 rows 1016 cols 3912 entries
Finished phase 1 with 985 SingleSign rule and 0 generalized
[2026-05-24 15:37:19] [INFO ] Computed 31 invariants in 14 ms
Computed 31 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-18125270615168214798.kers
Total runtime 17 ms.
[2026-05-24 15:37:20] [INFO ] Implicit Places using invariants in 661 ms returned []
[2026-05-24 15:37:20] [INFO ] Invariant cache hit.
[2026-05-24 15:37:20] [INFO ] State equation strengthened by 1776 read => feed constraints.
[2026-05-24 15:37:35] [INFO ] Implicit Places using invariants and state equation in 15304 ms returned []
Implicit Place search using SMT with State Equation took 15967 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1016/1020 places, 1902/1904 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 16742 ms. Remains : 1016/1020 places, 1902/1904 transitions.
RANDOM walk for 40000 steps (186 resets) in 301 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 237043 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 1
Probabilistic random walk after 237043 steps, saw 84286 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
[2026-05-24 15:37:38] [INFO ] Invariant cache hit.
[2026-05-24 15:37:38] [INFO ] State equation strengthened by 1776 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 972/1006 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1006 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/1015 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1902/2917 variables, 1015/1046 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2917 variables, 1776/2822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2917 variables, 0/2822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/2918 variables, 1/2823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2918 variables, 0/2823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2918 variables, 0/2823 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2918/2918 variables, and 2823 constraints, problems are : Problem set: 0 solved, 1 unsolved in 834 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 1016/1016 constraints, ReadFeed: 1776/1776 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/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 972/1006 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1006 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1006 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/1015 variables, 9/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,5 properties remain. new max is 262144
SDD size :240676 after 627475
SMT process timed out in 108844ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 1016 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1016/1016 places, 1902/1902 transitions.
Applied a total of 0 rules in 74 ms. Remains 1016 /1016 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 1016/1016 places, 1902/1902 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1016/1016 places, 1902/1902 transitions.
Applied a total of 0 rules in 57 ms. Remains 1016 /1016 variables (removed 0) and now considering 1902/1902 (removed 0) transitions.
[2026-05-24 15:39:27] [INFO ] Invariant cache hit.
[2026-05-24 15:39:28] [INFO ] Implicit Places using invariants in 745 ms returned []
[2026-05-24 15:39:28] [INFO ] Invariant cache hit.
[2026-05-24 15:39:28] [INFO ] State equation strengthened by 1776 read => feed constraints.
[2026-05-24 15:39:43] [INFO ] Implicit Places using invariants and state equation in 14788 ms returned []
Implicit Place search using SMT with State Equation took 15547 ms to find 0 implicit places.
[2026-05-24 15:39:43] [INFO ] Redundant transitions in 110 ms returned []
Running 1872 sub problems to find dead transitions.
[2026-05-24 15:39:43] [INFO ] Invariant cache hit.
[2026-05-24 15:39:43] [INFO ] State equation strengthened by 1776 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1015 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1015 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1015/2918 variables, and 51 constraints, problems are : Problem set: 0 solved, 1872 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, State Equation: 0/1016 constraints, ReadFeed: 0/1776 constraints, PredecessorRefiner: 1872/1872 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1872 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1015 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1015 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1015 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1015 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 1872 unsolved
SMT process timed out in 61326ms, After SMT, problems are : Problem set: 0 solved, 1872 unsolved
Search for dead transitions found 0 dead transitions in 61334ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77078 ms. Remains : 1016/1016 places, 1902/1902 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1758 edges and 1016 vertex of which 814 / 1016 are part of one of the 27 SCC in 2 ms
Free SCC test removed 787 places
Drop transitions (Empty/Sink Transition effects.) removed 1547 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 1549 transitions.
Graph (complete) has 460 edges and 229 vertex of which 181 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Drop transitions (Empty/Sink Transition effects.) removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 132 rules applied. Total rules applied 134 place count 181 transition count 202
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 1 with 164 rules applied. Total rules applied 298 place count 96 transition count 123
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 298 place count 96 transition count 120
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 304 place count 93 transition count 120
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 309 place count 88 transition count 115
Iterating global reduction 2 with 5 rules applied. Total rules applied 314 place count 88 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 318 place count 88 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 319 place count 87 transition count 111
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 323 place count 85 transition count 109
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 329 place count 82 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 330 place count 82 transition count 115
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 331 place count 82 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 332 place count 81 transition count 114
Partial Free-agglomeration rule applied 20 times.
Drop transitions (Partial Free agglomeration) removed 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 352 place count 81 transition count 114
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 363 place count 70 transition count 103
Iterating global reduction 5 with 11 rules applied. Total rules applied 374 place count 70 transition count 103
Applied a total of 374 rules in 25 ms. Remains 70 /1016 variables (removed 946) and now considering 103/1902 (removed 1799) 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-15294359281231694794.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17639319639952382739.kers'
[2026-05-24 15:40:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15294359281231694794.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17639319639952382739.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 103 rows 60 cols 176 entries
Finished phase 1 with 58 SingleSign rule and 0 generalized
[2026-05-24 15:40:44] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17639319639952382739.kers
Total runtime 0 ms.
[2026-05-24 15:40:44] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 15:40:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 1 ms returned sat
[2026-05-24 15:40:44] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 15:40:44] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 15:40:44] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-24 15:40:44] [INFO ] Flatten gal took : 4 ms
[2026-05-24 15:40:44] [INFO ] Flatten gal took : 3 ms
[2026-05-24 15:40:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3223456321647511551.gal : 1 ms
[2026-05-24 15:40:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14492518862539878284.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/ReachabilityCardinality3223456321647511551.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14492518862539878284.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/ReachabilityCardinality14492518862539878284.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 15
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :15 after 400
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :400 after 115200
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :115200 after 1.06921e+08
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.06921e+08 after 1.58515e+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,4.10518e+10,0.025654,4612,2,335,11,2207,7,0,387,1563,0
Total reachable state count : 41051750400
Verifying 1 reachability properties.
Reachability property CANConstruction-PT-030-ReachabilityCardinality-2024-02 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-030-ReachabilityCardinality-2024-02,9.37356e+07,0.044065,5544,2,824,11,8647,7,0,469,5648,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 220 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 15:40:45] [INFO ] Flatten gal took : 92 ms
[2026-05-24 15:40:45] [INFO ] Applying decomposition
[2026-05-24 15:40:45] [INFO ] Flatten gal took : 78 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/graph43728357896890259.txt' '-o' '/tmp/graph43728357896890259.bin' '-w' '/tmp/graph43728357896890259.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph43728357896890259.bin' '-l' '-1' '-v' '-w' '/tmp/graph43728357896890259.weights' '-q' '0' '-e' '0.001'
[2026-05-24 15:40:45] [INFO ] Decomposing Gal with order
[2026-05-24 15:40:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 15:40:46] [INFO ] Removed a total of 1859 redundant transitions.
[2026-05-24 15:40:46] [INFO ] Flatten gal took : 376 ms
[2026-05-24 15:40:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 196 labels/synchronizations in 104 ms.
[2026-05-24 15:40:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12830904986770496734.gal : 33 ms
[2026-05-24 15:40:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11256150982760458008.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/ReachabilityCardinality12830904986770496734.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11256150982760458008.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 ...330
Loading property file /tmp/ReachabilityCardinality11256150982760458008.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 16
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :16 after 21
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :21 after 37
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :37 after 43
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :43 after 52
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :52 after 55
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :55 after 85
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :85 after 111
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :111 after 1547
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1547 after 2260
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2260 after 36031
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :36031 after 44383
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :44383 after 579015
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :579015 after 671677
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :671677 after 6.93173e+06
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :6.93173e+06 after 7.45243e+06
SDD proceeding with computation,1 properties remain. new max is 1048576
SDD size :7.45243e+06 after 6.00008e+07
SDD proceeding with computation,1 properties remain. new max is 2097152
SDD size :6.00008e+07 after 3.96138e+08
SDD proceeding with computation,1 properties remain. new max is 4194304
SDD size :3.96138e+08 after 2.03574e+09
Detected timeout of ITS tools.
[2026-05-24 16:11:01] [INFO ] Flatten gal took : 775 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13027342509603583658
[2026-05-24 16:11:01] [INFO ] Too many transitions (1902) to apply POR reductions. Disabling POR matrices.
[2026-05-24 16:11:01] [INFO ] Applying decomposition
[2026-05-24 16:11:02] [INFO ] Built C files in 806ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13027342509603583658
[2026-05-24 16:11:02] [INFO ] Flatten gal took : 752 ms
Running compilation step : cd /tmp/ltsmin13027342509603583658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph7697964068725519336.txt' '-o' '/tmp/graph7697964068725519336.bin' '-w' '/tmp/graph7697964068725519336.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7697964068725519336.bin' '-l' '-1' '-v' '-w' '/tmp/graph7697964068725519336.weights' '-q' '0' '-e' '0.001'
[2026-05-24 16:11:03] [INFO ] Decomposing Gal with order
[2026-05-24 16:11:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 16:11:05] [INFO ] Removed a total of 1841 redundant transitions.
[2026-05-24 16:11:05] [INFO ] Flatten gal took : 1404 ms
[2026-05-24 16:11:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 1672 labels/synchronizations in 158 ms.
[2026-05-24 16:11:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10547130278590075288.gal : 18 ms
[2026-05-24 16:11:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7852718352960902220.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/ReachabilityCardinality10547130278590075288.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7852718352960902220.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/ReachabilityCardinality7852718352960902220.prop.
Compilation finished in 5443 ms.
Running link step : cd /tmp/ltsmin13027342509603583658;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin13027342509603583658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'CANConstructionPT030ReachabilityCardinality202402==true'
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 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 21
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :21 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 582
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :582 after 608
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :608 after 9820
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9820 after 10082
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :10082 after 101677
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :101677 after 725500
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :725500 after 4.71794e+07
BK_TIME_CONFINEMENT_REACHED
--------------------
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-030"
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-030, 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-177946842100638"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-030.tgz
mv CANConstruction-PT-030 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 ;
