About the Execution of ITS-Tools for FunctionPointer-PT-c016
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16200.439 | 3600000.00 | 3688380.00 | 84009.40 | 0 0 ? 0 inf 0 0 0 inf 0 0 0 0 inf 0 0 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r146-tall-177961074000141.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-c016, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074000141
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 8.1K Mar 7 07:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 07:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Mar 7 07:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 7 07:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 10:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 7 07:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Mar 7 07:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Mar 7 07:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 7 07:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:26 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 4.2M 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 positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-c016-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779696206168
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c016
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 08:03:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 08:03:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:03:27] [INFO ] Load time of PNML (sax parser for PT used): 409 ms
[2026-05-25 08:03:27] [INFO ] Transformed 2826 places.
[2026-05-25 08:03:27] [INFO ] Transformed 8960 transitions.
[2026-05-25 08:03:27] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 549 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1198 places in 46 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c016-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17986642993079212606.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2516649504670659810.kers'
[2026-05-25 08:03:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17986642993079212606.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2516649504670659810.kers]
Normalized transition count is 3540 out of 5962 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 3540 rows 1627 cols 8708 entries
Finished phase 1 with 1624 SingleSign rule and 0 generalized
[2026-05-25 08:03:28] [INFO ] Computed 4 invariants in 19 ms
Computed 4 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-2516649504670659810.kers
Total runtime 25 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 10001 steps (2 resets) in 243 ms. (40 steps per ms)
BEST_FIRST walk for 40003 steps (12 resets) in 127 ms. (312 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 4, 0] Max Struct:[+inf, +inf, +inf, +inf]
[2026-05-25 08:03:28] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-878381026534536512.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13699378875358263916.kers'
[2026-05-25 08:03:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-878381026534536512.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13699378875358263916.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 3540 rows 1627 cols 8708 entries
Finished phase 1 with 1624 SingleSign rule and 0 generalized
[2026-05-25 08:03:28] [INFO ] Computed 4 invariants in 16 ms
Computed 4 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-13699378875358263916.kers
Total runtime 19 ms.
[2026-05-25 08:03:28] [INFO ] [Real]Absence check using 3 positive place invariants in 18 ms returned sat
[2026-05-25 08:03:28] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 08:03:29] [INFO ] [Real]Absence check using state equation in 786 ms returned sat
[2026-05-25 08:03:29] [INFO ] State equation strengthened by 479 read => feed constraints.
[2026-05-25 08:03:30] [INFO ] [Real]Added 479 Read/Feed constraints in 117 ms returned sat
[2026-05-25 08:03:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:03:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 17 ms returned sat
[2026-05-25 08:03:30] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 08:03:31] [INFO ] [Nat]Absence check using state equation in 720 ms returned sat
[2026-05-25 08:03:31] [INFO ] [Nat]Added 479 Read/Feed constraints in 258 ms returned sat
[2026-05-25 08:03:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1622 ms
[2026-05-25 08:03:33] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 847 ms.
[2026-05-25 08:03:34] [INFO ] Added : 2 causal constraints over 1 iterations in 1346 ms. Result :sat
Minimization took 593 ms.
[2026-05-25 08:03:35] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2026-05-25 08:03:35] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 08:03:35] [INFO ] [Real]Absence check using state equation in 771 ms returned sat
[2026-05-25 08:03:36] [INFO ] [Real]Added 479 Read/Feed constraints in 153 ms returned sat
[2026-05-25 08:03:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:03:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2026-05-25 08:03:36] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-25 08:03:37] [INFO ] [Nat]Absence check using state equation in 733 ms returned sat
[2026-05-25 08:03:37] [INFO ] [Nat]Added 479 Read/Feed constraints in 98 ms returned sat
[2026-05-25 08:03:38] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 922 ms.
[2026-05-25 08:03:38] [INFO ] Added : 1 causal constraints over 1 iterations in 1350 ms. Result :sat
Minimization took 582 ms.
[2026-05-25 08:03:39] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2026-05-25 08:03:39] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-25 08:03:40] [INFO ] [Real]Absence check using state equation in 687 ms returned sat
[2026-05-25 08:03:40] [INFO ] [Real]Added 479 Read/Feed constraints in 165 ms returned sat
[2026-05-25 08:03:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:03:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2026-05-25 08:03:40] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 08:03:41] [INFO ] [Nat]Absence check using state equation in 725 ms returned sat
[2026-05-25 08:03:41] [INFO ] [Nat]Added 479 Read/Feed constraints in 128 ms returned sat
[2026-05-25 08:03:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1610 ms
[2026-05-25 08:03:43] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 493 ms.
[2026-05-25 08:03:43] [INFO ] Added : 1 causal constraints over 1 iterations in 824 ms. Result :sat
Minimization took 575 ms.
[2026-05-25 08:03:44] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2026-05-25 08:03:44] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 08:03:45] [INFO ] [Real]Absence check using state equation in 731 ms returned sat
[2026-05-25 08:03:45] [INFO ] [Real]Added 479 Read/Feed constraints in 161 ms returned sat
[2026-05-25 08:03:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:03:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2026-05-25 08:03:45] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-25 08:03:46] [INFO ] [Nat]Absence check using state equation in 735 ms returned sat
[2026-05-25 08:03:46] [INFO ] [Nat]Added 479 Read/Feed constraints in 110 ms returned sat
[2026-05-25 08:03:47] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 468 ms.
[2026-05-25 08:03:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1669 ms
[2026-05-25 08:03:49] [INFO ] Added : 2 causal constraints over 1 iterations in 2554 ms. Result :sat
Minimization took 578 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 4, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 4, 0] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1422 are kept as prefixes of interest. Removing 206 places using SCC suffix rule.13 ms
Discarding 206 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 1422 transition count 5583
Discarding 300 places :
Symmetric choice reduction at 1 with 300 rule applications. Total rules 680 place count 1122 transition count 3301
Iterating global reduction 1 with 300 rules applied. Total rules applied 980 place count 1122 transition count 3301
Ensure Unique test removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 1340 place count 1122 transition count 2941
Discarding 157 places :
Symmetric choice reduction at 2 with 157 rule applications. Total rules 1497 place count 965 transition count 2627
Iterating global reduction 2 with 157 rules applied. Total rules applied 1654 place count 965 transition count 2627
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 1722 place count 965 transition count 2559
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1736 place count 951 transition count 2531
Iterating global reduction 3 with 14 rules applied. Total rules applied 1750 place count 951 transition count 2531
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1764 place count 937 transition count 2503
Iterating global reduction 3 with 14 rules applied. Total rules applied 1778 place count 937 transition count 2503
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1792 place count 923 transition count 2475
Iterating global reduction 3 with 14 rules applied. Total rules applied 1806 place count 923 transition count 2475
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1820 place count 909 transition count 2447
Iterating global reduction 3 with 14 rules applied. Total rules applied 1834 place count 909 transition count 2447
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1848 place count 895 transition count 2419
Iterating global reduction 3 with 14 rules applied. Total rules applied 1862 place count 895 transition count 2419
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1876 place count 881 transition count 2391
Iterating global reduction 3 with 14 rules applied. Total rules applied 1890 place count 881 transition count 2391
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1904 place count 867 transition count 2363
Iterating global reduction 3 with 14 rules applied. Total rules applied 1918 place count 867 transition count 2363
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1980 place count 805 transition count 2129
Iterating global reduction 3 with 62 rules applied. Total rules applied 2042 place count 805 transition count 2129
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 2104 place count 743 transition count 1881
Iterating global reduction 3 with 62 rules applied. Total rules applied 2166 place count 743 transition count 1881
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 2228 place count 681 transition count 1743
Iterating global reduction 3 with 62 rules applied. Total rules applied 2290 place count 681 transition count 1743
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 2352 place count 619 transition count 1619
Iterating global reduction 3 with 62 rules applied. Total rules applied 2414 place count 619 transition count 1619
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 2476 place count 557 transition count 1495
Iterating global reduction 3 with 62 rules applied. Total rules applied 2538 place count 557 transition count 1495
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 2600 place count 495 transition count 1371
Iterating global reduction 3 with 62 rules applied. Total rules applied 2662 place count 495 transition count 1371
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 2722 place count 435 transition count 1251
Iterating global reduction 3 with 60 rules applied. Total rules applied 2782 place count 435 transition count 1251
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2789 place count 428 transition count 1237
Iterating global reduction 3 with 7 rules applied. Total rules applied 2796 place count 428 transition count 1237
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 2800 place count 428 transition count 1233
Applied a total of 2800 rules in 1235 ms. Remains 428 /1628 variables (removed 1200) and now considering 1233/5962 (removed 4729) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1248 ms. Remains : 428/1628 places, 1233/5962 transitions.
[2026-05-25 08:03:51] [INFO ] Flow matrix only has 702 transitions (discarded 531 similar events)
findPositiveTsemiflow completed in 121 ms - Found solution {218=1, 314=1, 641=1, 697=1} and attempted to minimize in 1 ms success -> {252=1, 348=1, 675=1, 699=1}
FORMULA FunctionPointer-PT-c016-UpperBounds-08 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
Current structural bounds on expressions (after cover walk) : Max Seen:[5, 11, 4] Max Struct:[+inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4491838482438603856.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18011283210037120478.kers'
[2026-05-25 08:04:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4491838482438603856.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18011283210037120478.kers]
Normalized transition count is 702 out of 1233 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 702 rows 428 cols 2084 entries
Finished phase 1 with 425 SingleSign rule and 0 generalized
[2026-05-25 08:04:01] [INFO ] Computed 3 invariants in 2 ms
Computed 3 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18011283210037120478.kers
Total runtime 6 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 11, 4] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2645 ms. (377 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 2327 ms. (1288 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 1336, 192] Max Struct:[+inf, +inf, +inf]
[2026-05-25 08:04:06] [INFO ] Flow matrix only has 702 transitions (discarded 531 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8966306093814863291.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15945218966590420897.kers'
[2026-05-25 08:04:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8966306093814863291.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15945218966590420897.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 702 rows 428 cols 2084 entries
Finished phase 1 with 425 SingleSign rule and 0 generalized
[2026-05-25 08:04:06] [INFO ] Computed 3 invariants in 2 ms
Computed 3 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15945218966590420897.kers
Total runtime 3 ms.
[2026-05-25 08:04:06] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 08:04:06] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2026-05-25 08:04:06] [INFO ] State equation strengthened by 82 read => feed constraints.
[2026-05-25 08:04:06] [INFO ] [Real]Added 82 Read/Feed constraints in 27 ms returned sat
[2026-05-25 08:04:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:04:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2026-05-25 08:04:07] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2026-05-25 08:04:07] [INFO ] [Nat]Added 82 Read/Feed constraints in 39 ms returned sat
[2026-05-25 08:04:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2026-05-25 08:04:07] [INFO ] Computed and/alt/rep : 335/2021/335 causal constraints (skipped 365 transitions) in 63 ms.
[2026-05-25 08:04:07] [INFO ] Added : 5 causal constraints over 2 iterations in 192 ms. Result :sat
Minimization took 282 ms.
[2026-05-25 08:04:07] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2026-05-25 08:04:08] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2026-05-25 08:04:08] [INFO ] [Real]Added 82 Read/Feed constraints in 53 ms returned sat
[2026-05-25 08:04:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:04:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2026-05-25 08:04:08] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2026-05-25 08:04:08] [INFO ] [Nat]Added 82 Read/Feed constraints in 41 ms returned sat
[2026-05-25 08:04:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2026-05-25 08:04:08] [INFO ] Computed and/alt/rep : 335/2021/335 causal constraints (skipped 365 transitions) in 66 ms.
[2026-05-25 08:04:09] [INFO ] Added : 19 causal constraints over 7 iterations in 589 ms. Result :sat
Minimization took 282 ms.
[2026-05-25 08:04:09] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2026-05-25 08:04:09] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2026-05-25 08:04:09] [INFO ] [Real]Added 82 Read/Feed constraints in 26 ms returned sat
[2026-05-25 08:04:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:04:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 08:04:10] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2026-05-25 08:04:10] [INFO ] [Nat]Added 82 Read/Feed constraints in 21 ms returned sat
[2026-05-25 08:04:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2026-05-25 08:04:10] [INFO ] Computed and/alt/rep : 335/2021/335 causal constraints (skipped 365 transitions) in 63 ms.
[2026-05-25 08:04:10] [INFO ] Added : 15 causal constraints over 4 iterations in 399 ms. Result :sat
Minimization took 257 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 1336, 192] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16, 1336, 192] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1233/1233 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 427 transition count 1231
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 427 transition count 1231
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 427 transition count 1229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 426 transition count 1227
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 426 transition count 1227
Applied a total of 6 rules in 71 ms. Remains 426 /428 variables (removed 2) and now considering 1227/1233 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 426/428 places, 1227/1233 transitions.
[2026-05-25 08:04:14] [INFO ] Flow matrix only has 697 transitions (discarded 530 similar events)
findPositiveTsemiflow completed in 129 ms - Found solution {217=1, 310=1, 637=1, 696=1} and attempted to minimize in 0 ms success -> {252=1, 345=1, 672=1, 694=1}
FORMULA FunctionPointer-PT-c016-UpperBounds-04 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
Current structural bounds on expressions (after cover walk) : Max Seen:[16, 192] Max Struct:[+inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1913608547930398406.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1383189285318587264.kers'
[2026-05-25 08:04:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1913608547930398406.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1383189285318587264.kers]
Normalized transition count is 697 out of 1227 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 697 rows 426 cols 2072 entries
Finished phase 1 with 423 SingleSign rule and 0 generalized
[2026-05-25 08:04:25] [INFO ] Computed 3 invariants in 7 ms
Computed 3 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-1383189285318587264.kers
Total runtime 10 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[16, 192] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2588 ms. (386 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 1468 ms. (1361 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16, 192] Max Struct:[+inf, +inf]
[2026-05-25 08:04:29] [INFO ] Flow matrix only has 697 transitions (discarded 530 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14057157067008339423.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5727366660168133675.kers'
[2026-05-25 08:04:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14057157067008339423.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5727366660168133675.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 697 rows 426 cols 2072 entries
Finished phase 1 with 423 SingleSign rule and 0 generalized
[2026-05-25 08:04:29] [INFO ] Computed 3 invariants in 2 ms
Computed 3 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5727366660168133675.kers
Total runtime 5 ms.
[2026-05-25 08:04:29] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2026-05-25 08:04:29] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2026-05-25 08:04:29] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-25 08:04:29] [INFO ] [Real]Added 80 Read/Feed constraints in 32 ms returned sat
[2026-05-25 08:04:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:04:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2026-05-25 08:04:29] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2026-05-25 08:04:29] [INFO ] [Nat]Added 80 Read/Feed constraints in 47 ms returned sat
[2026-05-25 08:04:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 460 ms
[2026-05-25 08:04:30] [INFO ] Computed and/alt/rep : 334/1763/334 causal constraints (skipped 361 transitions) in 61 ms.
[2026-05-25 08:04:30] [INFO ] Added : 5 causal constraints over 2 iterations in 186 ms. Result :sat
Minimization took 248 ms.
[2026-05-25 08:04:30] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 08:04:30] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2026-05-25 08:04:30] [INFO ] [Real]Added 80 Read/Feed constraints in 39 ms returned sat
[2026-05-25 08:04:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:04:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2026-05-25 08:04:31] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2026-05-25 08:04:31] [INFO ] [Nat]Added 80 Read/Feed constraints in 22 ms returned sat
[2026-05-25 08:04:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 506 ms
[2026-05-25 08:04:31] [INFO ] Computed and/alt/rep : 334/1763/334 causal constraints (skipped 361 transitions) in 65 ms.
[2026-05-25 08:04:31] [INFO ] Added : 13 causal constraints over 3 iterations in 259 ms. Result :sat
Minimization took 245 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16, 192] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16, 192] Max Struct:[+inf, +inf]
Support contains 2 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 1227/1227 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 425 transition count 1225
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 425 transition count 1225
Applied a total of 2 rules in 57 ms. Remains 425 /426 variables (removed 1) and now considering 1225/1227 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 425/426 places, 1225/1227 transitions.
[2026-05-25 08:04:33] [INFO ] Flow matrix only has 694 transitions (discarded 531 similar events)
findPositiveTsemiflow completed in 121 ms - Found solution {220=1, 312=1, 639=1, 692=1} and attempted to minimize in 1 ms success -> {252=1, 344=1, 543=1, 688=1}
FORMULA FunctionPointer-PT-c016-UpperBounds-13 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
Current structural bounds on expressions (after cover walk) : Max Seen:[16] Max Struct:[+inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10858342599124711125.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9544992689211895691.kers'
[2026-05-25 08:04:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10858342599124711125.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9544992689211895691.kers]
Normalized transition count is 694 out of 1225 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 694 rows 425 cols 2064 entries
Finished phase 1 with 422 SingleSign rule and 0 generalized
[2026-05-25 08:04:43] [INFO ] Computed 3 invariants in 9 ms
Computed 3 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-9544992689211895691.kers
Total runtime 11 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[16] Max Struct:[+inf]
RANDOM walk for 1000005 steps (2 resets) in 2624 ms. (380 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 775 ms. (1288 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16] Max Struct:[+inf]
[2026-05-25 08:04:46] [INFO ] Flow matrix only has 694 transitions (discarded 531 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15343593408944746501.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-355029784012682807.kers'
[2026-05-25 08:04:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15343593408944746501.kers, --Pflows, --basisKERS=/tmp/petrispot-output-355029784012682807.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 694 rows 425 cols 2064 entries
Finished phase 1 with 422 SingleSign rule and 0 generalized
[2026-05-25 08:04:46] [INFO ] Computed 3 invariants in 8 ms
Computed 3 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-355029784012682807.kers
Total runtime 9 ms.
[2026-05-25 08:04:46] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 08:04:46] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2026-05-25 08:04:46] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-25 08:04:46] [INFO ] [Real]Added 78 Read/Feed constraints in 29 ms returned sat
[2026-05-25 08:04:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:04:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 08:04:47] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2026-05-25 08:04:47] [INFO ] [Nat]Added 78 Read/Feed constraints in 44 ms returned sat
[2026-05-25 08:04:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 488 ms
[2026-05-25 08:04:47] [INFO ] Computed and/alt/rep : 333/1506/333 causal constraints (skipped 359 transitions) in 63 ms.
[2026-05-25 08:04:47] [INFO ] Added : 7 causal constraints over 3 iterations in 202 ms. Result :sat
Minimization took 259 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16] Max Struct:[+inf]
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1225/1225 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 424 transition count 1223
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 424 transition count 1223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 423 transition count 1221
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 423 transition count 1221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 422 transition count 1217
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 422 transition count 1217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 421 transition count 1215
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 421 transition count 1215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 420 transition count 1213
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 420 transition count 1213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 419 transition count 1211
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 419 transition count 1211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 418 transition count 1209
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 418 transition count 1209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 417 transition count 1207
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 417 transition count 1207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 416 transition count 1205
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 416 transition count 1205
Applied a total of 18 rules in 136 ms. Remains 416 /425 variables (removed 9) and now considering 1205/1225 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 416/425 places, 1205/1225 transitions.
[2026-05-25 08:04:48] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
findPositiveTsemiflow completed in 141 ms - Found solution {219=1, 303=1, 501=1, 675=1} and attempted to minimize in 0 ms success -> {256=1, 340=1, 666=1, 678=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[16] Max Struct:[+inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2461486213002574891.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1860747978094508128.kers'
[2026-05-25 08:04:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2461486213002574891.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1860747978094508128.kers]
Normalized transition count is 680 out of 1205 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 680 rows 416 cols 2026 entries
Finished phase 1 with 413 SingleSign rule and 0 generalized
[2026-05-25 08:04:58] [INFO ] Computed 3 invariants in 2 ms
Computed 3 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1860747978094508128.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[16] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2542 ms. (393 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 720 ms. (1386 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16] Max Struct:[+inf]
[2026-05-25 08:05:01] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7471016635568987247.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14546845120415613201.kers'
[2026-05-25 08:05:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7471016635568987247.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14546845120415613201.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 680 rows 416 cols 2026 entries
Finished phase 1 with 413 SingleSign rule and 0 generalized
[2026-05-25 08:05:01] [INFO ] Computed 3 invariants in 2 ms
Computed 3 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14546845120415613201.kers
Total runtime 5 ms.
[2026-05-25 08:05:02] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 08:05:02] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2026-05-25 08:05:02] [INFO ] State equation strengthened by 75 read => feed constraints.
[2026-05-25 08:05:02] [INFO ] [Real]Added 75 Read/Feed constraints in 27 ms returned sat
[2026-05-25 08:05:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:05:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 08:05:02] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2026-05-25 08:05:02] [INFO ] [Nat]Added 75 Read/Feed constraints in 56 ms returned sat
[2026-05-25 08:05:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 440 ms
[2026-05-25 08:05:02] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 70 ms.
[2026-05-25 08:05:03] [INFO ] Added : 6 causal constraints over 2 iterations in 182 ms. Result :sat
Minimization took 236 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 47 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 47 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2026-05-25 08:05:03] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2026-05-25 08:05:03] [INFO ] Invariant cache hit.
[2026-05-25 08:05:03] [INFO ] Implicit Places using invariants in 364 ms returned []
[2026-05-25 08:05:03] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2026-05-25 08:05:03] [INFO ] Invariant cache hit.
[2026-05-25 08:05:04] [INFO ] State equation strengthened by 75 read => feed constraints.
[2026-05-25 08:05:07] [INFO ] Implicit Places using invariants and state equation in 3863 ms returned []
Implicit Place search using SMT with State Equation took 4229 ms to find 0 implicit places.
[2026-05-25 08:05:07] [INFO ] Redundant transitions in 76 ms returned []
Running 1203 sub problems to find dead transitions.
[2026-05-25 08:05:07] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2026-05-25 08:05:07] [INFO ] Invariant cache hit.
[2026-05-25 08:05:07] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/1096 variables, and 4 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/416 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1203/1203 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 3 (OVERLAPS) 680/1096 variables, 416/420 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1096 variables, 75/495 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 1698 constraints, problems are : Problem set: 0 solved, 1203 unsolved in 30785 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1203/1203 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62386ms problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 62402ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66793 ms. Remains : 416/416 places, 1205/1205 transitions.
[2026-05-25 08:06:10] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
findPositiveTsemiflow completed in 140 ms - Found solution {219=1, 303=1, 501=1, 675=1} and attempted to minimize in 0 ms success -> {256=1, 340=1, 666=1, 678=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[16] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 462 ms. (86 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
[2026-05-25 08:06:21] [INFO ] Flatten gal took : 120 ms
[2026-05-25 08:06:21] [INFO ] Flatten gal took : 105 ms
[2026-05-25 08:06:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18003589722254325771.gal : 51 ms
[2026-05-25 08:06:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17932350210573771850.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/ReachabilityCardinality18003589722254325771.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17932350210573771850.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/ReachabilityCardinality17932350210573771850.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1995
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1995 after 1.24463e+06
Interrupted probabilistic random walk after 550293 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 1
Probabilistic random walk after 550293 steps, saw 337432 distinct states, run finished after 3005 ms. (steps per millisecond=183 ) properties seen :0
[2026-05-25 08:06:23] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2026-05-25 08:06:23] [INFO ] Invariant cache hit.
[2026-05-25 08:06:23] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/348 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 68/1082 variables, 66/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1082 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1090 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1090 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1096 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/348 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/952 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1014 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1014 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 68/1082 variables, 66/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1082 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1090 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1090 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1096 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1096 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1096 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 497 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1208 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1714ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 50 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 416/416 places, 1205/1205 transitions.
RANDOM walk for 40001 steps (8 resets) in 289 ms. (137 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.24463e+06 after 3.74365e+10
Interrupted probabilistic random walk after 577145 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :0 out of 1
Probabilistic random walk after 577145 steps, saw 353896 distinct states, run finished after 3003 ms. (steps per millisecond=192 ) properties seen :0
[2026-05-25 08:06:28] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2026-05-25 08:06:28] [INFO ] Invariant cache hit.
[2026-05-25 08:06:28] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/348 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 68/1082 variables, 66/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1082 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1090 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1090 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1096 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/348 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/952 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1014 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1014 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 68/1082 variables, 66/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1082 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1090 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1090 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1096 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1096 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1096 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 497 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1009 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1499ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 52 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 45 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2026-05-25 08:06:30] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2026-05-25 08:06:30] [INFO ] Invariant cache hit.
[2026-05-25 08:06:30] [INFO ] Implicit Places using invariants in 579 ms returned []
[2026-05-25 08:06:30] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2026-05-25 08:06:30] [INFO ] Invariant cache hit.
[2026-05-25 08:06:31] [INFO ] State equation strengthened by 75 read => feed constraints.
[2026-05-25 08:06:34] [INFO ] Implicit Places using invariants and state equation in 3858 ms returned []
Implicit Place search using SMT with State Equation took 4451 ms to find 0 implicit places.
[2026-05-25 08:06:34] [INFO ] Redundant transitions in 20 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4523 ms. Remains : 416/416 places, 1205/1205 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 525 transitions
Reduce isomorphic transitions removed 525 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 416 transition count 669
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 548 place count 405 transition count 668
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 549 place count 404 transition count 668
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 549 place count 404 transition count 600
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 685 place count 336 transition count 600
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 939 place count 209 transition count 473
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 1003 place count 145 transition count 345
Iterating global reduction 3 with 64 rules applied. Total rules applied 1067 place count 145 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1068 place count 145 transition count 344
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1068 place count 145 transition count 343
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1070 place count 144 transition count 343
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1133 place count 81 transition count 217
Iterating global reduction 4 with 63 rules applied. Total rules applied 1196 place count 81 transition count 217
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1259 place count 18 transition count 91
Iterating global reduction 4 with 63 rules applied. Total rules applied 1322 place count 18 transition count 91
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1385 place count 18 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1385 place count 18 transition count 27
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1387 place count 17 transition count 27
Applied a total of 1387 rules in 96 ms. Remains 17 /416 variables (removed 399) and now considering 27/1205 (removed 1178) 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-17011806018484880857.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-451288155730745172.kers'
[2026-05-25 08:06:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17011806018484880857.kers, --Pflows, --basisKERS=/tmp/petrispot-output-451288155730745172.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 27 rows 17 cols 84 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-25 08:06:34] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-451288155730745172.kers
Total runtime 17 ms.
[2026-05-25 08:06:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 08:06:34] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 08:06:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 08:06:34] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 08:06:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 08:06:34] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 08:06:34] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 08:06:34] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-25 08:06:34] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:06:34] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:06:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1776755827870805515.gal : 1 ms
[2026-05-25 08:06:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4507022827533938565.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/ReachabilityCardinality1776755827870805515.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4507022827533938565.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality4507022827533938565.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 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 578
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :578 after 3858
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3858 after 198387
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :198387 after 619443
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :619443 after 1.45829e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.45829e+06 after 3.13272e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.13272e+06 after 6.47832e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.74365e+10 after 5.12697e+17
Detected timeout of ITS tools.
[2026-05-25 08:06:49] [INFO ] Flatten gal took : 3 ms
[2026-05-25 08:06:49] [INFO ] Applying decomposition
[2026-05-25 08:06:49] [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/graph6400977251530519167.txt' '-o' '/tmp/graph6400977251530519167.bin' '-w' '/tmp/graph6400977251530519167.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6400977251530519167.bin' '-l' '-1' '-v' '-w' '/tmp/graph6400977251530519167.weights' '-q' '0' '-e' '0.001'
[2026-05-25 08:06:50] [INFO ] Decomposing Gal with order
[2026-05-25 08:06:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 08:06:50] [INFO ] Removed a total of 20 redundant transitions.
[2026-05-25 08:06:50] [INFO ] Flatten gal took : 152 ms
[2026-05-25 08:06:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 08:06:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14324368558240287236.gal : 1 ms
[2026-05-25 08:06:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6224923494207733805.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/ReachabilityCardinality14324368558240287236.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6224923494207733805.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/ReachabilityCardinality6224923494207733805.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 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 1154
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1154 after 24998
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :24998 after 88127
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30593 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 08:07:05] [INFO ] Flatten gal took : 51 ms
[2026-05-25 08:07:05] [INFO ] Applying decomposition
[2026-05-25 08:07:05] [INFO ] Flatten gal took : 64 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/graph10606480268782489656.txt' '-o' '/tmp/graph10606480268782489656.bin' '-w' '/tmp/graph10606480268782489656.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10606480268782489656.bin' '-l' '-1' '-v' '-w' '/tmp/graph10606480268782489656.weights' '-q' '0' '-e' '0.001'
[2026-05-25 08:07:05] [INFO ] Decomposing Gal with order
[2026-05-25 08:07:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 08:07:05] [INFO ] Removed a total of 2052 redundant transitions.
[2026-05-25 08:07:05] [INFO ] Flatten gal took : 116 ms
[2026-05-25 08:07:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 923 labels/synchronizations in 82 ms.
[2026-05-25 08:07:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2803531139269898807.gal : 11 ms
[2026-05-25 08:07:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7161227314839069300.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/ReachabilityCardinality2803531139269898807.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7161227314839069300.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/ReachabilityCardinality7161227314839069300.prop.
Detected timeout of ITS tools.
Starting property specific reduction for FunctionPointer-PT-c016-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10044927481767757704.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11310181264977683557.kers'
[2026-05-25 08:07:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10044927481767757704.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11310181264977683557.kers]
Normalized transition count is 680 out of 1205 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 680 rows 416 cols 2026 entries
Finished phase 1 with 413 SingleSign rule and 0 generalized
[2026-05-25 08:07:56] [INFO ] Computed 3 invariants in 3 ms
Computed 3 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11310181264977683557.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2026-05-25 08:07:56] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7038549361970334482.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1176692634473807325.kers'
[2026-05-25 08:07:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7038549361970334482.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1176692634473807325.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 680 rows 416 cols 2026 entries
Finished phase 1 with 413 SingleSign rule and 0 generalized
[2026-05-25 08:07:56] [INFO ] Computed 3 invariants in 2 ms
Computed 3 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1176692634473807325.kers
Total runtime 4 ms.
[2026-05-25 08:07:56] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 08:07:56] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2026-05-25 08:07:56] [INFO ] State equation strengthened by 75 read => feed constraints.
[2026-05-25 08:07:56] [INFO ] [Real]Added 75 Read/Feed constraints in 26 ms returned sat
[2026-05-25 08:07:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:07:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 08:07:56] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2026-05-25 08:07:56] [INFO ] [Nat]Added 75 Read/Feed constraints in 40 ms returned sat
[2026-05-25 08:07:56] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 64 ms.
[2026-05-25 08:07:56] [INFO ] Added : 2 causal constraints over 1 iterations in 147 ms. Result :sat
Minimization took 251 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 46 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 416/416 places, 1205/1205 transitions.
[2026-05-25 08:07:57] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
findPositiveTsemiflow completed in 155 ms - Found solution {219=1, 303=1, 501=1, 675=1} and attempted to minimize in 0 ms success -> {256=1, 340=1, 666=1, 678=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[15] Max Struct:[+inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-395909175175849977.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2925950088372104131.kers'
[2026-05-25 08:08:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-395909175175849977.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2925950088372104131.kers]
Normalized transition count is 680 out of 1205 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 680 rows 416 cols 2026 entries
Finished phase 1 with 413 SingleSign rule and 0 generalized
[2026-05-25 08:08:07] [INFO ] Computed 3 invariants in 2 ms
Computed 3 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2925950088372104131.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[15] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2591 ms. (385 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 742 ms. (1345 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15] Max Struct:[+inf]
[2026-05-25 08:08:10] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-960224396075785671.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10899622280574397074.kers'
[2026-05-25 08:08:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-960224396075785671.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10899622280574397074.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 680 rows 416 cols 2026 entries
Finished phase 1 with 413 SingleSign rule and 0 generalized
[2026-05-25 08:08:10] [INFO ] Computed 3 invariants in 3 ms
Computed 3 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10899622280574397074.kers
Total runtime 5 ms.
[2026-05-25 08:08:11] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 08:08:11] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2026-05-25 08:08:11] [INFO ] State equation strengthened by 75 read => feed constraints.
[2026-05-25 08:08:11] [INFO ] [Real]Added 75 Read/Feed constraints in 30 ms returned sat
[2026-05-25 08:08:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:08:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 08:08:11] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2026-05-25 08:08:11] [INFO ] [Nat]Added 75 Read/Feed constraints in 51 ms returned sat
[2026-05-25 08:08:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 423 ms
[2026-05-25 08:08:11] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 75 ms.
[2026-05-25 08:08:12] [INFO ] Added : 3 causal constraints over 1 iterations in 167 ms. Result :sat
Minimization took 236 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 46 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 46 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2026-05-25 08:08:12] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2026-05-25 08:08:12] [INFO ] Invariant cache hit.
[2026-05-25 08:08:12] [INFO ] Implicit Places using invariants in 380 ms returned []
[2026-05-25 08:08:12] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2026-05-25 08:08:12] [INFO ] Invariant cache hit.
[2026-05-25 08:08:13] [INFO ] State equation strengthened by 75 read => feed constraints.
[2026-05-25 08:08:16] [INFO ] Implicit Places using invariants and state equation in 3852 ms returned []
Implicit Place search using SMT with State Equation took 4236 ms to find 0 implicit places.
[2026-05-25 08:08:16] [INFO ] Redundant transitions in 22 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4315 ms. Remains : 416/416 places, 1205/1205 transitions.
[2026-05-25 08:08:16] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
findPositiveTsemiflow completed in 135 ms - Found solution {219=1, 303=1, 501=1, 675=1} and attempted to minimize in 1 ms success -> {256=1, 340=1, 666=1, 678=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[15] Max Struct:[+inf]
[2026-05-25 08:08:27] [INFO ] Flatten gal took : 48 ms
RANDOM walk for 33786 steps (7 resets) in 160 ms. (209 steps per ms) remains 0/1 properties
[2026-05-25 08:08:27] [INFO ] Flatten gal took : 49 ms
[2026-05-25 08:08:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13466426768792078768.gal : 11 ms
[2026-05-25 08:08:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12538514579777450609.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/ReachabilityCardinality13466426768792078768.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12538514579777450609.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
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (after reachability check) : Max Seen:[16] Max Struct:[+inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9706081699937428151.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9195295695506400000.kers'
[2026-05-25 08:08:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9706081699937428151.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9195295695506400000.kers]
Normalized transition count is 680 out of 1205 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 680 rows 416 cols 2026 entries
Finished phase 1 with 413 SingleSign rule and 0 generalized
[2026-05-25 08:08:27] [INFO ] Computed 3 invariants in 3 ms
Computed 3 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9195295695506400000.kers
Total runtime 4 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[16] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 2526 ms. (395 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 745 ms. (1340 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[16] Max Struct:[+inf]
[2026-05-25 08:08:30] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6328822650882931582.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8752087152056043024.kers'
[2026-05-25 08:08:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6328822650882931582.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8752087152056043024.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 680 rows 416 cols 2026 entries
Finished phase 1 with 413 SingleSign rule and 0 generalized
[2026-05-25 08:08:30] [INFO ] Computed 3 invariants in 2 ms
Computed 3 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8752087152056043024.kers
Total runtime 4 ms.
[2026-05-25 08:08:30] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2026-05-25 08:08:30] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2026-05-25 08:08:30] [INFO ] State equation strengthened by 75 read => feed constraints.
[2026-05-25 08:08:30] [INFO ] [Real]Added 75 Read/Feed constraints in 28 ms returned sat
[2026-05-25 08:08:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:08:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2026-05-25 08:08:30] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2026-05-25 08:08:30] [INFO ] [Nat]Added 75 Read/Feed constraints in 46 ms returned sat
[2026-05-25 08:08:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 445 ms
[2026-05-25 08:08:31] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 64 ms.
[2026-05-25 08:08:31] [INFO ] Added : 6 causal constraints over 2 iterations in 174 ms. Result :sat
Minimization took 240 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[16] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[16] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 45 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 45 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2026-05-25 08:08:31] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2026-05-25 08:08:31] [INFO ] Invariant cache hit.
[2026-05-25 08:08:32] [INFO ] Implicit Places using invariants in 269 ms returned []
[2026-05-25 08:08:32] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2026-05-25 08:08:32] [INFO ] Invariant cache hit.
[2026-05-25 08:08:32] [INFO ] State equation strengthened by 75 read => feed constraints.
[2026-05-25 08:08:36] [INFO ] Implicit Places using invariants and state equation in 3890 ms returned []
Implicit Place search using SMT with State Equation took 4161 ms to find 0 implicit places.
[2026-05-25 08:08:36] [INFO ] Redundant transitions in 22 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4243 ms. Remains : 416/416 places, 1205/1205 transitions.
[2026-05-25 08:08:36] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
findPositiveTsemiflow completed in 137 ms - Found solution {219=1, 303=1, 501=1, 675=1} and attempted to minimize in 0 ms success -> {256=1, 340=1, 666=1, 678=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[16] Max Struct:[+inf]
[2026-05-25 08:08:46] [INFO ] Flatten gal took : 24 ms
[2026-05-25 08:08:46] [INFO ] Flatten gal took : 29 ms
[2026-05-25 08:08:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4131775147289581624.gal : 6 ms
[2026-05-25 08:08:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7323605392037907243.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/ReachabilityCardinality4131775147289581624.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7323605392037907243.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40012 steps (8 resets) in 277 ms. (143 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 1/1 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 ...328
Loading property file /tmp/ReachabilityCardinality7323605392037907243.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :31 after 1995
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1995 after 1.24463e+06
Interrupted probabilistic random walk after 596265 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :0 out of 1
Probabilistic random walk after 596265 steps, saw 365620 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
[2026-05-25 08:08:49] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2026-05-25 08:08:49] [INFO ] Invariant cache hit.
[2026-05-25 08:08:49] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/348 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 68/1082 variables, 66/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1082 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1090 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1090 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1096 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/348 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/952 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1014 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1014 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 68/1082 variables, 66/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1082 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1090 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1090 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1096 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1096 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1096 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 497 constraints, problems are : Problem set: 0 solved, 1 unsolved in 790 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1170ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 48 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 416/416 places, 1205/1205 transitions.
RANDOM walk for 40002 steps (8 resets) in 241 ms. (165 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.24463e+06 after 3.74365e+10
Interrupted probabilistic random walk after 582587 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :0 out of 1
Probabilistic random walk after 582587 steps, saw 357233 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
[2026-05-25 08:08:53] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2026-05-25 08:08:53] [INFO ] Invariant cache hit.
[2026-05-25 08:08:53] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/348 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 68/1082 variables, 66/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1082 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1090 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1090 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1096 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/348 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/952 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1014 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1014 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 68/1082 variables, 66/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1082 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1090 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1090 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1096 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1096 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1096 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 497 constraints, problems are : Problem set: 0 solved, 1 unsolved in 760 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1123ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 57 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 44 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2026-05-25 08:08:55] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2026-05-25 08:08:55] [INFO ] Invariant cache hit.
[2026-05-25 08:08:55] [INFO ] Implicit Places using invariants in 336 ms returned []
[2026-05-25 08:08:55] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2026-05-25 08:08:55] [INFO ] Invariant cache hit.
[2026-05-25 08:08:55] [INFO ] State equation strengthened by 75 read => feed constraints.
[2026-05-25 08:08:59] [INFO ] Implicit Places using invariants and state equation in 3933 ms returned []
Implicit Place search using SMT with State Equation took 4281 ms to find 0 implicit places.
[2026-05-25 08:08:59] [INFO ] Redundant transitions in 18 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4353 ms. Remains : 416/416 places, 1205/1205 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 525 transitions
Reduce isomorphic transitions removed 525 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 416 transition count 669
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 548 place count 405 transition count 668
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 549 place count 404 transition count 668
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 549 place count 404 transition count 600
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 685 place count 336 transition count 600
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 939 place count 209 transition count 473
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 1003 place count 145 transition count 345
Iterating global reduction 3 with 64 rules applied. Total rules applied 1067 place count 145 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1068 place count 145 transition count 344
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1068 place count 145 transition count 343
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1070 place count 144 transition count 343
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1133 place count 81 transition count 217
Iterating global reduction 4 with 63 rules applied. Total rules applied 1196 place count 81 transition count 217
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1259 place count 18 transition count 91
Iterating global reduction 4 with 63 rules applied. Total rules applied 1322 place count 18 transition count 91
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1385 place count 18 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1385 place count 18 transition count 27
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1387 place count 17 transition count 27
Applied a total of 1387 rules in 68 ms. Remains 17 /416 variables (removed 399) and now considering 27/1205 (removed 1178) 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-8301426665914785419.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7797243950145305879.kers'
[2026-05-25 08:08:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8301426665914785419.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7797243950145305879.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 27 rows 17 cols 84 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-25 08:08:59] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-7797243950145305879.kers
Total runtime 12 ms.
[2026-05-25 08:08:59] [INFO ] [Real]Absence check using 3 positive place invariants in 33 ms returned sat
[2026-05-25 08:08:59] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 08:08:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2026-05-25 08:08:59] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 08:08:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 08:08:59] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 08:08:59] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 08:08:59] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-25 08:08:59] [INFO ] Flatten gal took : 1 ms
[2026-05-25 08:08:59] [INFO ] Flatten gal took : 1 ms
[2026-05-25 08:08:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2384563504875903069.gal : 0 ms
[2026-05-25 08:08:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3075188145196818198.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/ReachabilityCardinality2384563504875903069.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3075188145196818198.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality3075188145196818198.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 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 578
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :578 after 3858
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3858 after 198387
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :198387 after 619443
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :619443 after 1.45829e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.45829e+06 after 3.13272e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.13272e+06 after 6.47832e+06
Detected timeout of ITS tools.
[2026-05-25 08:09:14] [INFO ] Flatten gal took : 1 ms
[2026-05-25 08:09:14] [INFO ] Applying decomposition
[2026-05-25 08:09:14] [INFO ] Flatten gal took : 0 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/graph7424003534595273036.txt' '-o' '/tmp/graph7424003534595273036.bin' '-w' '/tmp/graph7424003534595273036.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7424003534595273036.bin' '-l' '-1' '-v' '-w' '/tmp/graph7424003534595273036.weights' '-q' '0' '-e' '0.001'
[2026-05-25 08:09:14] [INFO ] Decomposing Gal with order
[2026-05-25 08:09:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 08:09:14] [INFO ] Removed a total of 20 redundant transitions.
[2026-05-25 08:09:14] [INFO ] Flatten gal took : 2 ms
[2026-05-25 08:09:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 08:09:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5387456821409995637.gal : 1 ms
[2026-05-25 08:09:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10599445937794085669.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/ReachabilityCardinality5387456821409995637.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10599445937794085669.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/ReachabilityCardinality10599445937794085669.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 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 578
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :578 after 9075
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.74365e+10 after 5.12697e+17
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30410 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 08:09:29] [INFO ] Flatten gal took : 21 ms
[2026-05-25 08:09:29] [INFO ] Applying decomposition
[2026-05-25 08:09:29] [INFO ] Flatten gal took : 21 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/graph6356354864908434591.txt' '-o' '/tmp/graph6356354864908434591.bin' '-w' '/tmp/graph6356354864908434591.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6356354864908434591.bin' '-l' '-1' '-v' '-w' '/tmp/graph6356354864908434591.weights' '-q' '0' '-e' '0.001'
[2026-05-25 08:09:29] [INFO ] Decomposing Gal with order
[2026-05-25 08:09:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 08:09:30] [INFO ] Removed a total of 2059 redundant transitions.
[2026-05-25 08:09:30] [INFO ] Flatten gal took : 57 ms
[2026-05-25 08:09:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 864 labels/synchronizations in 46 ms.
[2026-05-25 08:09:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality585047353060509894.gal : 6 ms
[2026-05-25 08:09:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1558525887954958312.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/ReachabilityCardinality585047353060509894.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1558525887954958312.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 ...306
Loading property file /tmp/ReachabilityCardinality1558525887954958312.prop.
Detected timeout of ITS tools.
Ending property specific reduction for FunctionPointer-PT-c016-UpperBounds-02 in 144073 ms.
[2026-05-25 08:10:20] [INFO ] Flatten gal took : 22 ms
[2026-05-25 08:10:20] [INFO ] Applying decomposition
[2026-05-25 08:10:20] [INFO ] Flatten gal took : 22 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/graph13735292517277303779.txt' '-o' '/tmp/graph13735292517277303779.bin' '-w' '/tmp/graph13735292517277303779.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13735292517277303779.bin' '-l' '-1' '-v' '-w' '/tmp/graph13735292517277303779.weights' '-q' '0' '-e' '0.001'
[2026-05-25 08:10:20] [INFO ] Decomposing Gal with order
[2026-05-25 08:10:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 08:10:20] [INFO ] Removed a total of 2060 redundant transitions.
[2026-05-25 08:10:20] [INFO ] Flatten gal took : 64 ms
[2026-05-25 08:10:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 853 labels/synchronizations in 25 ms.
[2026-05-25 08:10:20] [INFO ] Time to serialize gal into /tmp/UpperBounds3935655734294353654.gal : 6 ms
[2026-05-25 08:10:20] [INFO ] Time to serialize properties into /tmp/UpperBounds12789405592575898237.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/UpperBounds3935655734294353654.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12789405592575898237.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 ...284
Loading property file /tmp/UpperBounds12789405592575898237.prop.
Detected timeout of ITS tools.
[2026-05-25 08:32:37] [INFO ] Flatten gal took : 17 ms
[2026-05-25 08:32:37] [INFO ] Time to serialize gal into /tmp/UpperBounds3713348104344358159.gal : 5 ms
[2026-05-25 08:32:37] [INFO ] Time to serialize properties into /tmp/UpperBounds7041038800514153363.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/UpperBounds3713348104344358159.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7041038800514153363.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 ...304
Loading property file /tmp/UpperBounds7041038800514153363.prop.
Detected timeout of ITS tools.
[2026-05-25 08:54:56] [INFO ] Flatten gal took : 337 ms
[2026-05-25 08:54:58] [INFO ] Input system was already deterministic with 1205 transitions.
[2026-05-25 08:54:58] [INFO ] Transformed 416 places.
[2026-05-25 08:54:58] [INFO ] Transformed 1205 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-25 08:55:00] [INFO ] Time to serialize gal into /tmp/UpperBounds10628163878491532655.gal : 14 ms
[2026-05-25 08:55:00] [INFO ] Time to serialize properties into /tmp/UpperBounds7229200477453977674.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/UpperBounds10628163878491532655.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7229200477453977674.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds7229200477453977674.prop.
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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-c016"
export BK_EXAMINATION="UpperBounds"
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-c016, examination is UpperBounds"
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-177961074000141"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c016.tgz
mv FunctionPointer-PT-c016 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;