Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r146-tall-177961074000103.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 FunctionPointer-PT-b064, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074000103
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 5.9K Mar 7 07:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Mar 7 07:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 07:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 7 07:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 10:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Mar 7 07:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 7 07:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Mar 7 07:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 7 07:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 391K 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 FunctionPointer-PT-b064-ReachabilityFireability-2024-00
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityFireability-2024-01
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityFireability-2024-02
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityFireability-2024-03
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityFireability-2024-04
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityFireability-2024-05
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityFireability-2024-06
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityFireability-2024-07
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityFireability-2024-08
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityFireability-2024-09
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityFireability-2024-10
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityFireability-2024-11
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityFireability-2024-12
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityFireability-2024-13
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityFireability-2024-14
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779679415105

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b064
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-25 03:23:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 03:23:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 03:23:36] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2026-05-25 03:23:36] [INFO ] Transformed 306 places.
[2026-05-25 03:23:36] [INFO ] Transformed 840 transitions.
[2026-05-25 03:23:36] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40071 steps (36 resets) in 1070 ms. (37 steps per ms) remains 6/13 properties
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 6/6 properties
[2026-05-25 03:23:36] [INFO ] Flatten gal took : 144 ms
BEST_FIRST walk for 40003 steps (8 resets) in 404 ms. (98 steps per ms) remains 6/6 properties
[2026-05-25 03:23:37] [INFO ] Flatten gal took : 127 ms
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
[2026-05-25 03:23:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17664268744447484771.gal : 61 ms
[2026-05-25 03:23:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1595266030460402817.prop : 6 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/ReachabilityCardinality17664268744447484771.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1595266030460402817.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 485 ms. (82 steps per ms) remains 6/6 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 6/6 properties
Loading property file /tmp/ReachabilityCardinality1595266030460402817.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
[2026-05-25 03:23:37] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9225642803582065380.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16181710127749127997.kers'
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 31
[2026-05-25 03:23:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9225642803582065380.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16181710127749127997.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 414 rows 221 cols 1114 entries
Finished phase 1 with 218 SingleSign rule and 0 generalized
[2026-05-25 03:23:37] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16181710127749127997.kers
Total runtime 2 ms.
[2026-05-25 03:23:37] [INFO ] State equation strengthened by 65 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :31 after 1115
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, 6 unsolved
Problem FunctionPointer-PT-b064-ReachabilityFireability-2024-01 is UNSAT
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem FunctionPointer-PT-b064-ReachabilityFireability-2024-02 is UNSAT
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem FunctionPointer-PT-b064-ReachabilityFireability-2024-06 is UNSAT
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem FunctionPointer-PT-b064-ReachabilityFireability-2024-08 is UNSAT
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 61/117 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/118 variables, 1/4 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 324/442 variables, 118/122 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 59/181 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 0/181 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 161/603 variables, 77/258 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/603 variables, 6/264 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/603 variables, 0/264 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 33/636 variables, 27/291 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/636 variables, 0/291 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/636 variables, 0/291 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 636/636 variables, and 291 constraints, problems are : Problem set: 4 solved, 2 unsolved in 450 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 222/222 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 82/92 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 247/340 variables, 93/97 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 56/153 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/153 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 236/576 variables, 83/236 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 9/245 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 2/247 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/576 variables, 0/247 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 60/636 variables, 46/293 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/636 variables, 0/293 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/636 variables, 0/293 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 636/636 variables, and 293 constraints, problems are : Problem set: 4 solved, 2 unsolved in 647 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 222/222 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1214ms problems are : Problem set: 4 solved, 2 unsolved
Parikh walk visited 0 properties in 1014 ms.
Support contains 10 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 212 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 0 output transitions
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 27 place count 186 transition count 520
Iterating global reduction 0 with 26 rules applied. Total rules applied 53 place count 186 transition count 520
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 99 place count 186 transition count 474
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 113 place count 172 transition count 446
Iterating global reduction 1 with 14 rules applied. Total rules applied 127 place count 172 transition count 446
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 139 place count 172 transition count 434
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 145 place count 166 transition count 422
Iterating global reduction 2 with 6 rules applied. Total rules applied 151 place count 166 transition count 422
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 157 place count 160 transition count 398
Iterating global reduction 2 with 6 rules applied. Total rules applied 163 place count 160 transition count 398
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 169 place count 154 transition count 386
Iterating global reduction 2 with 6 rules applied. Total rules applied 175 place count 154 transition count 386
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 179 place count 150 transition count 370
Iterating global reduction 2 with 4 rules applied. Total rules applied 183 place count 150 transition count 370
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 187 place count 146 transition count 354
Iterating global reduction 2 with 4 rules applied. Total rules applied 191 place count 146 transition count 354
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 195 place count 142 transition count 346
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 142 transition count 346
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 203 place count 138 transition count 338
Iterating global reduction 2 with 4 rules applied. Total rules applied 207 place count 138 transition count 338
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 211 place count 134 transition count 330
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 134 transition count 330
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 219 place count 130 transition count 322
Iterating global reduction 2 with 4 rules applied. Total rules applied 223 place count 130 transition count 322
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 226 place count 127 transition count 316
Iterating global reduction 2 with 3 rules applied. Total rules applied 229 place count 127 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 237 place count 127 transition count 308
Applied a total of 237 rules in 139 ms. Remains 127 /222 variables (removed 95) and now considering 308/648 (removed 340) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 127/222 places, 308/648 transitions.
RANDOM walk for 40075 steps (31 resets) in 135 ms. (294 steps per ms) remains 1/2 properties
FORMULA FunctionPointer-PT-b064-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
[2026-05-25 03:23:39] [INFO ] Flow matrix only has 211 transitions (discarded 97 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8939036351128958400.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9121812792474125661.kers'
[2026-05-25 03:23:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8939036351128958400.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9121812792474125661.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 211 rows 127 cols 584 entries
Finished phase 1 with 124 SingleSign rule and 1 generalized
[2026-05-25 03:23:39] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9121812792474125661.kers
Total runtime 4 ms.
[2026-05-25 03:23:39] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 155/221 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 39/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 90/311 variables, 41/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 9/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 27/338 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/338 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 177 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 48/48 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 155/221 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 39/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 90/311 variables, 41/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 9/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/311 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 27/338 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/338 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/338 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/338 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 180 constraints, problems are : Problem set: 0 solved, 1 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 595ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 9 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 308/308 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 126 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 126 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 125 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 125 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 124 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 124 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 123 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 123 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 122 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 122 transition count 294
Applied a total of 10 rules in 26 ms. Remains 122 /127 variables (removed 5) and now considering 294/308 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 122/127 places, 294/308 transitions.
RANDOM walk for 40042 steps (48 resets) in 91 ms. (435 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1115 after 336018
Interrupted probabilistic random walk after 1331546 steps, run timeout after 3001 ms. (steps per millisecond=443 ) properties seen :0 out of 1
Probabilistic random walk after 1331546 steps, saw 875388 distinct states, run finished after 3006 ms. (steps per millisecond=442 ) properties seen :0
[2026-05-25 03:23:43] [INFO ] Flow matrix only has 203 transitions (discarded 91 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8112607910718575696.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15597537044029244348.kers'
[2026-05-25 03:23:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8112607910718575696.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15597537044029244348.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 203 rows 122 cols 564 entries
Finished phase 1 with 119 SingleSign rule and 1 generalized
[2026-05-25 03:23:43] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15597537044029244348.kers
Total runtime 2 ms.
[2026-05-25 03:23:43] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 152/217 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 39/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 85/302 variables, 39/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 9/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 23/325 variables, 18/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/325 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 172 constraints, problems are : Problem set: 0 solved, 1 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, ReadFeed: 48/48 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 152/217 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 39/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 85/302 variables, 39/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 9/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/302 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 23/325 variables, 18/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/325 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/325 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/325 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 497ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 9 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 294/294 transitions.
Applied a total of 0 rules in 15 ms. Remains 122 /122 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 122/122 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 294/294 transitions.
Applied a total of 0 rules in 11 ms. Remains 122 /122 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2026-05-25 03:23:44] [INFO ] Flow matrix only has 203 transitions (discarded 91 similar events)
[2026-05-25 03:23:44] [INFO ] Invariant cache hit.
[2026-05-25 03:23:44] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 03:23:44] [INFO ] Flow matrix only has 203 transitions (discarded 91 similar events)
[2026-05-25 03:23:44] [INFO ] Invariant cache hit.
[2026-05-25 03:23:44] [INFO ] State equation strengthened by 48 read => feed constraints.
[2026-05-25 03:23:44] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2026-05-25 03:23:44] [INFO ] Redundant transitions in 13 ms returned []
Running 292 sub problems to find dead transitions.
[2026-05-25 03:23:44] [INFO ] Flow matrix only has 203 transitions (discarded 91 similar events)
[2026-05-25 03:23:44] [INFO ] Invariant cache hit.
[2026-05-25 03:23:44] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 203/325 variables, 122/124 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 48/172 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 292 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/325 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 172 constraints, problems are : Problem set: 0 solved, 292 unsolved in 7920 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 203/325 variables, 122/124 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 48/172 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 292/464 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (OVERLAPS) 0/325 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 464 constraints, problems are : Problem set: 0 solved, 292 unsolved in 18947 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27041ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 27043ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27368 ms. Remains : 122/122 places, 294/294 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 170 edges and 122 vertex of which 24 / 122 are part of one of the 8 SCC in 4 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 115 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 106 transition count 174
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 101 transition count 174
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 11 place count 101 transition count 153
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 53 place count 80 transition count 153
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 60 place count 73 transition count 146
Iterating global reduction 2 with 7 rules applied. Total rules applied 67 place count 73 transition count 146
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 81 place count 73 transition count 132
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 117 place count 55 transition count 114
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 124 place count 48 transition count 100
Iterating global reduction 3 with 7 rules applied. Total rules applied 131 place count 48 transition count 100
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 137 place count 42 transition count 88
Iterating global reduction 3 with 6 rules applied. Total rules applied 143 place count 42 transition count 88
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 149 place count 36 transition count 76
Iterating global reduction 3 with 6 rules applied. Total rules applied 155 place count 36 transition count 76
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 161 place count 36 transition count 70
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 169 place count 32 transition count 71
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 173 place count 32 transition count 67
Applied a total of 173 rules in 43 ms. Remains 32 /122 variables (removed 90) and now considering 67/294 (removed 227) 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-11188179458318593250.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1625139447762168968.kers'
[2026-05-25 03:24:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11188179458318593250.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1625139447762168968.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 67 rows 32 cols 224 entries
Finished phase 1 with 29 SingleSign rule and 1 generalized
[2026-05-25 03:24:11] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1625139447762168968.kers
Total runtime 0 ms.
[2026-05-25 03:24:11] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-25 03:24:11] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 29 ms returned sat
[2026-05-25 03:24:11] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 03:24:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-25 03:24:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2026-05-25 03:24:11] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 03:24:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 03:24:11] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 03:24:11] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 03:24:11] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-25 03:24:11] [INFO ] Flatten gal took : 16 ms
[2026-05-25 03:24:11] [INFO ] Flatten gal took : 4 ms
[2026-05-25 03:24:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13931892297938454471.gal : 1 ms
[2026-05-25 03:24:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8558909408399953151.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/ReachabilityCardinality13931892297938454471.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8558909408399953151.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/ReachabilityCardinality8558909408399953151.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 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 11915
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :11915 after 1.78527e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.78527e+08 after 1.12583e+16
Detected timeout of ITS tools.
[2026-05-25 03:24:26] [INFO ] Flatten gal took : 4 ms
[2026-05-25 03:24:26] [INFO ] Applying decomposition
[2026-05-25 03:24:26] [INFO ] Flatten gal took : 3 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/graph8743911363144746427.txt' '-o' '/tmp/graph8743911363144746427.bin' '-w' '/tmp/graph8743911363144746427.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8743911363144746427.bin' '-l' '-1' '-v' '-w' '/tmp/graph8743911363144746427.weights' '-q' '0' '-e' '0.001'
[2026-05-25 03:24:27] [INFO ] Decomposing Gal with order
[2026-05-25 03:24:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 03:24:27] [INFO ] Removed a total of 89 redundant transitions.
[2026-05-25 03:24:27] [INFO ] Flatten gal took : 73 ms
[2026-05-25 03:24:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 3 ms.
[2026-05-25 03:24:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6418015767984096598.gal : 2 ms
[2026-05-25 03:24:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5971463999680664660.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/ReachabilityCardinality6418015767984096598.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5971463999680664660.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality5971463999680664660.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 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 315
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :315 after 11915
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :11915 after 6.08644e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.08644e+07 after 8.45329e+12
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8.45329e+12 after 2.11208e+14
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30659 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 03:24:42] [INFO ] Flatten gal took : 33 ms
[2026-05-25 03:24:42] [INFO ] Applying decomposition
[2026-05-25 03:24:42] [INFO ] Flatten gal took : 28 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/graph996432790038235412.txt' '-o' '/tmp/graph996432790038235412.bin' '-w' '/tmp/graph996432790038235412.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph996432790038235412.bin' '-l' '-1' '-v' '-w' '/tmp/graph996432790038235412.weights' '-q' '0' '-e' '0.001'
[2026-05-25 03:24:42] [INFO ] Decomposing Gal with order
[2026-05-25 03:24:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 03:24:42] [INFO ] Removed a total of 913 redundant transitions.
[2026-05-25 03:24:42] [INFO ] Flatten gal took : 83 ms
[2026-05-25 03:24:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 305 labels/synchronizations in 23 ms.
[2026-05-25 03:24:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4218139996429710259.gal : 8 ms
[2026-05-25 03:24:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10048664688459054409.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/ReachabilityCardinality4218139996429710259.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10048664688459054409.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality10048664688459054409.prop.
Detected timeout of ITS tools.
[2026-05-25 03:54:43] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7921377216072546710
[2026-05-25 03:54:43] [INFO ] Applying decomposition
[2026-05-25 03:54:43] [INFO ] Flatten gal took : 10 ms
[2026-05-25 03:54:43] [INFO ] Computing symmetric may disable matrix : 294 transitions.
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/graph1654198085389120009.txt' '-o' '/tmp/graph1654198085389120009.bin' '-w' '/tmp/graph1654198085389120009.weights'
[2026-05-25 03:54:43] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 03:54:43] [INFO ] Computing symmetric may enable matrix : 294 transitions.
[2026-05-25 03:54:43] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1654198085389120009.bin' '-l' '-1' '-v' '-w' '/tmp/graph1654198085389120009.weights' '-q' '0' '-e' '0.001'
[2026-05-25 03:54:43] [INFO ] Decomposing Gal with order
[2026-05-25 03:54:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 03:54:43] [INFO ] Computing Do-Not-Accords matrix : 294 transitions.
[2026-05-25 03:54:43] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 03:54:43] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7921377216072546710
Running compilation step : cd /tmp/ltsmin7921377216072546710;'/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'
[2026-05-25 03:54:43] [INFO ] Removed a total of 493 redundant transitions.
[2026-05-25 03:54:43] [INFO ] Flatten gal took : 41 ms
[2026-05-25 03:54:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 160 labels/synchronizations in 8 ms.
[2026-05-25 03:54:43] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability16606436753463384387.gal : 2 ms
[2026-05-25 03:54:43] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7424032656800375605.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/ReachabilityFireability16606436753463384387.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7424032656800375605.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability7424032656800375605.prop.
Compilation finished in 869 ms.
Running link step : cd /tmp/ltsmin7921377216072546710;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7921377216072546710;'/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' 'FunctionPointerPTb064ReachabilityFireability202409==true'

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

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