Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969020200405.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 MultiCrashLeafsetExtension-PT-S16C04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020200405
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.5M
-rw-r--r-- 1 mcc users 12K Mar 7 19:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 7 19:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Mar 7 19:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 7 19:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Mar 15 11:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 15 11:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 15 11:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 11:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 7 19:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 7 19:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 19:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 7 19:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 11:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Mar 15 11:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 4.1M 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 MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779715564170

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 13:26:05] [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 13:26:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 13:26:06] [INFO ] Load time of PNML (sax parser for PT used): 319 ms
[2026-05-25 13:26:06] [INFO ] Transformed 4260 places.
[2026-05-25 13:26:06] [INFO ] Transformed 6027 transitions.
[2026-05-25 13:26:06] [INFO ] Parsed PT model containing 4260 places and 6027 transitions and 23774 arcs in 460 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initially) : Max Seen:[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +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-7660889518594922593.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16238560840323890694.kers'
[2026-05-25 13:26:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7660889518594922593.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16238560840323890694.kers]
Normalized transition count is 5755 out of 6027 initially.
Culling duplicate invariants (modulo rational): removing 207 columns.
Culled 207 columns in 3 ms.
// Phase 1: matrix 5755 rows 4053 cols 15749 entries
Finished phase 1 with 2580 SingleSign rule and 1183 generalized
[2026-05-25 13:26:06] [INFO ] Computed 497 invariants in 55 ms
Computed 497 P flows in 56 ms.
Exported basis to /tmp/petrispot-output-16238560840323890694.kers
Total runtime 62 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (240 resets) in 243 ms. (40 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (305 resets) in 187 ms. (265 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[1, 1, 33, 1, 1]
[2026-05-25 13:26:06] [INFO ] Flow matrix only has 5755 transitions (discarded 272 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1098631456883179727.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7158004075189840945.kers'
[2026-05-25 13:26:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1098631456883179727.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7158004075189840945.kers]
Culling duplicate invariants (modulo rational): removing 207 columns.
Culled 207 columns in 3 ms.
// Phase 1: matrix 5755 rows 4053 cols 15749 entries
Finished phase 1 with 2580 SingleSign rule and 1183 generalized
[2026-05-25 13:26:06] [INFO ] Computed 497 invariants in 55 ms
Computed 497 P flows in 55 ms.
Exported basis to /tmp/petrispot-output-7158004075189840945.kers
Total runtime 60 ms.
[2026-05-25 13:26:07] [INFO ] [Real]Absence check using 45 positive place invariants in 104 ms returned sat
[2026-05-25 13:26:07] [INFO ] [Real]Absence check using 45 positive and 452 generalized place invariants in 129 ms returned sat
[2026-05-25 13:26:11] [INFO ] [Real]Absence check using state equation in 3860 ms returned sat
[2026-05-25 13:26:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 13:26:12] [INFO ] [Nat]Absence check using 45 positive place invariants in 151 ms returned sat
[2026-05-25 13:26:13] [INFO ] [Nat]Absence check using 45 positive and 452 generalized place invariants in 201 ms returned sat
[2026-05-25 13:26:16] [INFO ] [Nat]Absence check using state equation in 3828 ms returned sat
[2026-05-25 13:26:16] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2026-05-25 13:26:17] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 13:26:17] [INFO ] [Nat]Added 1634 Read/Feed constraints in 221 ms returned unknown
[2026-05-25 13:26:17] [INFO ] [Real]Absence check using 45 positive place invariants in 61 ms returned sat
[2026-05-25 13:26:17] [INFO ] [Real]Absence check using 45 positive and 452 generalized place invariants in 122 ms returned sat
[2026-05-25 13:26:21] [INFO ] [Real]Absence check using state equation in 3456 ms returned sat
[2026-05-25 13:26:21] [INFO ] [Real]Added 1634 Read/Feed constraints in 235 ms returned sat
[2026-05-25 13:26:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 13:26:22] [INFO ] [Nat]Absence check using 45 positive place invariants in 64 ms returned sat
[2026-05-25 13:26:22] [INFO ] [Nat]Absence check using 45 positive and 452 generalized place invariants in 119 ms returned sat
[2026-05-25 13:26:26] [INFO ] [Nat]Absence check using state equation in 3675 ms returned sat
[2026-05-25 13:26:26] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 13:26:26] [INFO ] [Nat]Added 1634 Read/Feed constraints in 564 ms returned unknown
[2026-05-25 13:26:27] [INFO ] [Real]Absence check using 45 positive place invariants in 60 ms returned sat
[2026-05-25 13:26:27] [INFO ] [Real]Absence check using 45 positive and 452 generalized place invariants in 65 ms returned unsat
[2026-05-25 13:26:28] [INFO ] [Real]Absence check using 45 positive place invariants in 69 ms returned sat
[2026-05-25 13:26:28] [INFO ] [Real]Absence check using 45 positive and 452 generalized place invariants in 112 ms returned sat
[2026-05-25 13:26:32] [INFO ] [Real]Absence check using state equation in 4241 ms returned unknown
[2026-05-25 13:26:33] [INFO ] [Real]Absence check using 45 positive place invariants in 60 ms returned sat
[2026-05-25 13:26:33] [INFO ] [Real]Absence check using 45 positive and 452 generalized place invariants in 205 ms returned sat
[2026-05-25 13:26:36] [INFO ] [Real]Absence check using state equation in 3368 ms returned sat
[2026-05-25 13:26:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 13:26:37] [INFO ] [Nat]Absence check using 45 positive place invariants in 65 ms returned sat
[2026-05-25 13:26:37] [INFO ] [Nat]Absence check using 45 positive and 452 generalized place invariants in 120 ms returned sat
[2026-05-25 13:26:41] [INFO ] [Nat]Absence check using state equation in 3382 ms returned sat
[2026-05-25 13:26:41] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 13:26:42] [INFO ] [Nat]Added 1634 Read/Feed constraints in 739 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 4260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4260/4260 places, 6027/6027 transitions.
Graph (complete) has 13889 edges and 4260 vertex of which 4232 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.19 ms
Discarding 28 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1086 transitions
Trivial Post-agglo rules discarded 1086 transitions
Performed 1086 trivial Post agglomeration. Transition count delta: 1086
Iterating post reduction 0 with 1086 rules applied. Total rules applied 1087 place count 4232 transition count 4941
Reduce places removed 1086 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1087 rules applied. Total rules applied 2174 place count 3146 transition count 4940
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2175 place count 3145 transition count 4940
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 136 Pre rules applied. Total rules applied 2175 place count 3145 transition count 4804
Deduced a syphon composed of 136 places in 6 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 272 rules applied. Total rules applied 2447 place count 3009 transition count 4804
Discarding 950 places :
Symmetric choice reduction at 3 with 950 rule applications. Total rules 3397 place count 2059 transition count 3854
Iterating global reduction 3 with 950 rules applied. Total rules applied 4347 place count 2059 transition count 3854
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 4347 place count 2059 transition count 3848
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 4359 place count 2053 transition count 3848
Discarding 236 places :
Symmetric choice reduction at 3 with 236 rule applications. Total rules 4595 place count 1817 transition count 2904
Iterating global reduction 3 with 236 rules applied. Total rules applied 4831 place count 1817 transition count 2904
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 4865 place count 1800 transition count 2887
Free-agglomeration rule (complex) applied 161 times.
Iterating global reduction 3 with 161 rules applied. Total rules applied 5026 place count 1800 transition count 3434
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 3 with 161 rules applied. Total rules applied 5187 place count 1639 transition count 3434
Partial Free-agglomeration rule applied 34 times.
Drop transitions (Partial Free agglomeration) removed 34 transitions
Iterating global reduction 4 with 34 rules applied. Total rules applied 5221 place count 1639 transition count 3434
Applied a total of 5221 rules in 1388 ms. Remains 1639 /4260 variables (removed 2621) and now considering 3434/6027 (removed 2593) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1405 ms. Remains : 1639/4260 places, 3434/6027 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1330439169768176500.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10988314923011003931.kers'
[2026-05-25 13:26:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1330439169768176500.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10988314923011003931.kers]
Normalized transition count is 3037 out of 3434 initially.
Culling duplicate invariants (modulo rational): removing 207 columns.
Culled 207 columns in 4 ms.
// Phase 1: matrix 3037 rows 1432 cols 11377 entries
Finished phase 1 with 907 SingleSign rule and 263 generalized
[2026-05-25 13:26:43] [INFO ] Computed 469 invariants in 40 ms
Computed 469 P flows in 40 ms.
Exported basis to /tmp/petrispot-output-10988314923011003931.kers
Total runtime 43 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (39539 resets) in 12006 ms. (83 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (6882 resets) in 2758 ms. (362 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 13:26:58] [INFO ] Flow matrix only has 3037 transitions (discarded 397 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4390544174712416621.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17483026832052284918.kers'
[2026-05-25 13:26:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4390544174712416621.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17483026832052284918.kers]
Culling duplicate invariants (modulo rational): removing 207 columns.
Culled 207 columns in 6 ms.
// Phase 1: matrix 3037 rows 1432 cols 11377 entries
Finished phase 1 with 907 SingleSign rule and 263 generalized
[2026-05-25 13:26:58] [INFO ] Computed 469 invariants in 55 ms
Computed 469 P flows in 56 ms.
Exported basis to /tmp/petrispot-output-17483026832052284918.kers
Total runtime 65 ms.
[2026-05-25 13:26:58] [INFO ] [Real]Absence check using 17 positive place invariants in 24 ms returned sat
[2026-05-25 13:26:58] [INFO ] [Real]Absence check using 17 positive and 452 generalized place invariants in 94 ms returned sat
[2026-05-25 13:26:59] [INFO ] [Real]Absence check using state equation in 855 ms returned sat
[2026-05-25 13:26:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 13:26:59] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2026-05-25 13:27:00] [INFO ] [Nat]Absence check using 17 positive and 452 generalized place invariants in 76 ms returned sat
[2026-05-25 13:27:01] [INFO ] [Nat]Absence check using state equation in 1045 ms returned sat
[2026-05-25 13:27:01] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2026-05-25 13:27:02] [INFO ] [Nat]Added 1634 Read/Feed constraints in 1400 ms returned sat
[2026-05-25 13:27:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3741 ms
[2026-05-25 13:27:06] [INFO ] Computed and/alt/rep : 1545/3348/1545 causal constraints (skipped 1475 transitions) in 317 ms.
[2026-05-25 13:27:07] [INFO ] Added : 12 causal constraints over 3 iterations in 1257 ms. Result :sat
Minimization took 6345 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 1639 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node15ThinksNode5ShouldBeNodeMasterToReplaceNode11) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 1639/1639 places, 3432/3432 transitions.
Reduce places removed 1 places and 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1638 transition count 3429
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1636 transition count 3427
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 1635 transition count 3425
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6 place count 1634 transition count 3423
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7 place count 1633 transition count 3421
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 8 place count 1632 transition count 3419
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 10 place count 1632 transition count 3417
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 12 place count 1630 transition count 3417
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 14 place count 1628 transition count 3415
Iterating global reduction 7 with 2 rules applied. Total rules applied 16 place count 1628 transition count 3415
Applied a total of 16 rules in 337 ms. Remains 1628 /1639 variables (removed 11) and now considering 3415/3432 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 338 ms. Remains : 1628/1639 places, 3415/3432 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2940542404442650315.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17438252048745686357.kers'
[2026-05-25 13:27:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2940542404442650315.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17438252048745686357.kers]
Normalized transition count is 3018 out of 3415 initially.
Culling duplicate invariants (modulo rational): removing 207 columns.
Culled 207 columns in 2 ms.
// Phase 1: matrix 3018 rows 1421 cols 11324 entries
Finished phase 1 with 898 SingleSign rule and 261 generalized
[2026-05-25 13:27:14] [INFO ] Computed 469 invariants in 20 ms
Computed 469 P flows in 34 ms.
Exported basis to /tmp/petrispot-output-17438252048745686357.kers
Total runtime 37 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (39546 resets) in 11574 ms. (86 steps per ms)
BEST_FIRST walk for 1000001 steps (6883 resets) in 2649 ms. (377 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 13:27:28] [INFO ] Flow matrix only has 3018 transitions (discarded 397 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1867403883033201400.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2459325376966576901.kers'
[2026-05-25 13:27:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1867403883033201400.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2459325376966576901.kers]
Culling duplicate invariants (modulo rational): removing 207 columns.
Culled 207 columns in 6 ms.
// Phase 1: matrix 3018 rows 1421 cols 11324 entries
Finished phase 1 with 898 SingleSign rule and 261 generalized
[2026-05-25 13:27:28] [INFO ] Computed 469 invariants in 56 ms
Computed 469 P flows in 57 ms.
Exported basis to /tmp/petrispot-output-2459325376966576901.kers
Total runtime 63 ms.
[2026-05-25 13:27:28] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2026-05-25 13:27:28] [INFO ] [Real]Absence check using 17 positive and 452 generalized place invariants in 136 ms returned sat
[2026-05-25 13:27:29] [INFO ] [Real]Absence check using state equation in 895 ms returned sat
[2026-05-25 13:27:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 13:27:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 48 ms returned sat
[2026-05-25 13:27:30] [INFO ] [Nat]Absence check using 17 positive and 452 generalized place invariants in 152 ms returned sat
[2026-05-25 13:27:31] [INFO ] [Nat]Absence check using state equation in 987 ms returned sat
[2026-05-25 13:27:31] [INFO ] State equation strengthened by 1627 read => feed constraints.
[2026-05-25 13:27:32] [INFO ] [Nat]Added 1627 Read/Feed constraints in 1515 ms returned sat
[2026-05-25 13:27:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4987 ms
[2026-05-25 13:27:38] [INFO ] Computed and/alt/rep : 1528/3322/1528 causal constraints (skipped 1473 transitions) in 443 ms.
[2026-05-25 13:27:39] [INFO ] Added : 13 causal constraints over 3 iterations in 1620 ms. Result :sat
Minimization took 6426 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 3415/3415 transitions.
Applied a total of 0 rules in 165 ms. Remains 1628 /1628 variables (removed 0) and now considering 3415/3415 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 1628/1628 places, 3415/3415 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 3415/3415 transitions.
Applied a total of 0 rules in 108 ms. Remains 1628 /1628 variables (removed 0) and now considering 3415/3415 (removed 0) transitions.
[2026-05-25 13:27:46] [INFO ] Flow matrix only has 3018 transitions (discarded 397 similar events)
[2026-05-25 13:27:46] [INFO ] Invariant cache hit.
[2026-05-25 13:27:56] [INFO ] Implicit Places using invariants in 9844 ms returned [4, 7, 9, 10, 11, 12, 13, 17, 23, 31, 41, 53, 67, 82, 96, 97, 98, 99, 100, 112, 122, 130, 136, 140, 142, 153, 159, 161, 162, 163, 164, 165, 167, 171, 177, 185, 195, 207, 220, 232, 233, 234, 235, 236, 246, 254, 260, 264, 266, 268, 279, 285, 287, 288, 289, 290, 291, 293, 295, 299, 305, 313, 323, 334, 344, 345, 346, 347, 348, 356, 362, 366, 368, 370, 372, 383, 389, 391, 392, 393, 394, 395, 397, 399, 401, 405, 411, 419, 428, 436, 437, 438, 439, 440, 446, 450, 452, 454, 456, 458, 469, 475, 477, 478, 479, 480, 481, 483, 485, 487, 489, 493, 499, 506, 512, 513, 514, 515, 516, 520, 522, 524, 526, 528, 530, 541, 547, 549, 550, 551, 552, 553, 555, 557, 559, 561, 563, 567, 572, 576, 577, 578, 579, 580, 582, 584, 586, 588, 590, 592, 603, 609, 611, 612, 613, 614, 615, 617, 619, 621, 623, 625, 627, 630, 632, 633, 634, 635, 636, 638, 640, 642, 644, 646, 648, 659, 665, 667, 668, 669, 670, 671, 673, 675, 677, 679, 681, 683, 685, 687, 688, 689, 690, 691, 693, 695, 697, 699, 701, 703, 714, 716, 719, 721, 722, 723, 724, 725, 727, 729, 731, 733, 735, 737, 739, 741, 742, 743, 744, 745, 747, 749, 751, 753, 755, 757, 768, 774, 776, 777, 778, 779, 780, 782, 784, 786, 788, 790, 792, 794, 796, 797, 798, 799, 800, 802, 804, 806, 808, 810, 812, 823, 829, 831, 832, 833, 834, 835, 837, 839, 841, 843, 845, 847, 849, 852, 853, 854, 855, 856, 858, 860, 862, 864, 866, 868, 879, 885, 887, 888, 889, 890, 891, 893, 895, 897, 899, 901, 903, 907, 912, 913, 914, 915, 916, 920, 922, 924, 926, 928, 930, 941, 947, 949, 950, 951, 952, 953, 955, 957, 959, 961, 963, 967, 973, 980, 981, 982, 983, 984, 990, 994, 996, 998, 1000, 1002, 1013, 1019, 1021, 1022, 1023, 1024, 1025, 1027, 1029, 1031, 1033, 1037, 1043, 1051, 1060, 1061, 1062, 1063, 1064, 1072, 1078, 1082, 1084, 1086, 1088, 1099, 1105, 1107, 1108, 1109, 1110, 1111, 1113, 1115, 1117, 1121, 1127, 1135, 1145, 1156, 1157, 1158, 1159, 1160, 1170, 1178, 1184, 1188, 1190, 1192, 1203, 1209, 1211, 1212, 1213, 1214, 1215, 1217, 1219, 1223, 1229, 1237, 1247, 1259, 1272, 1273, 1274, 1275, 1276, 1288, 1298, 1301, 1307, 1311, 1313, 1324, 1326, 1329, 1331, 1332, 1333, 1334, 1335, 1337, 1341, 1347, 1355, 1365, 1377, 1391, 1406, 1407, 1408, 1409, 1410, 1424, 1436, 1446, 1454, 1460, 1464, 1475]
[2026-05-25 13:27:56] [INFO ] Actually due to overlaps returned [153, 279, 383, 469, 541, 603, 659, 714, 768, 823, 879, 941, 1013, 1099, 1203, 1324, 1475, 4, 9, 10, 11, 12, 96, 97, 98, 99, 161, 162, 163, 164, 232, 233, 234, 235, 287, 288, 289, 290, 344, 345, 346, 347, 391, 392, 393, 394, 436, 437, 438, 439, 477, 478, 479, 480, 512, 513, 514, 515, 549, 550, 551, 552, 576, 577, 578, 579, 611, 612, 613, 614, 632, 633, 634, 635, 667, 668, 669, 670, 687, 688, 689, 690, 716, 721, 722, 723, 724, 741, 742, 743, 744, 776, 777, 778, 779, 796, 797, 798, 799, 831, 832, 833, 834, 852, 853, 854, 855, 887, 888, 889, 890, 912, 913, 914, 915, 949, 950, 951, 952, 980, 981, 982, 983, 1021, 1022, 1023, 1024, 1060, 1061, 1062, 1063, 1107, 1108, 1109, 1110, 1156, 1157, 1158, 1159, 1211, 1212, 1213, 1214, 1272, 1273, 1274, 1275, 1326, 1331, 1332, 1333, 1334, 1406, 1407, 1408, 1409]
Discarding 156 places :
Implicit Place search using SMT only with invariants took 9868 ms to find 156 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1472/1628 places, 3415/3415 transitions.
Discarding 128 places :
Symmetric choice reduction at 0 with 128 rule applications. Total rules 128 place count 1344 transition count 3287
Iterating global reduction 0 with 128 rules applied. Total rules applied 256 place count 1344 transition count 3287
Discarding 128 places :
Symmetric choice reduction at 0 with 128 rule applications. Total rules 384 place count 1216 transition count 3159
Iterating global reduction 0 with 128 rules applied. Total rules applied 512 place count 1216 transition count 3159
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 515 place count 1216 transition count 3156
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 518 place count 1213 transition count 3156
Applied a total of 518 rules in 280 ms. Remains 1213 /1472 variables (removed 259) and now considering 3156/3415 (removed 259) transitions.
[2026-05-25 13:27:56] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15589715757363464364.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1668236983731814602.kers'
[2026-05-25 13:27:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15589715757363464364.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1668236983731814602.kers]
Culling duplicate invariants (modulo rational): removing 204 columns.
Culled 204 columns in 1 ms.
// Phase 1: matrix 2759 rows 1009 cols 8247 entries
Finished phase 1 with 797 SingleSign rule and 103 generalized
[2026-05-25 13:27:56] [INFO ] Computed 313 invariants in 30 ms
Computed 313 P flows in 33 ms.
Exported basis to /tmp/petrispot-output-1668236983731814602.kers
Total runtime 35 ms.
[2026-05-25 13:27:59] [INFO ] Implicit Places using invariants in 3388 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 77, 91, 103, 113, 121, 127, 131, 133, 148, 150, 152, 156, 162, 170, 180, 192, 205, 217, 227, 235, 241, 245, 247, 249, 257, 259, 261, 263, 267, 273, 281, 291, 302, 312, 320, 326, 330, 332, 334, 336, 344, 346, 348, 350, 352, 356, 362, 370, 379, 387, 393, 397, 399, 401, 403, 405, 413, 415, 417, 419, 421, 423, 427, 433, 440, 446, 450, 452, 454, 456, 458, 460, 468, 470, 472, 474, 476, 478, 480, 484, 489, 493, 495, 497, 499, 501, 503, 505, 513, 515, 517, 519, 521, 523, 525, 527, 530, 532, 534, 536, 538, 540, 542, 544, 552, 554, 556, 558, 560, 562, 564, 566, 568, 570, 572, 574, 576, 578, 580, 582, 588, 590, 592, 594, 596, 598, 600, 602, 604, 606, 608, 610, 612, 614, 616, 618, 625, 627, 629, 631, 633, 635, 637, 639, 641, 643, 645, 647, 649, 651, 653, 655, 663, 665, 667, 669, 671, 673, 675, 677, 679, 682, 684, 686, 688, 690, 692, 694, 702, 704, 706, 708, 710, 712, 714, 716, 720, 725, 729, 731, 733, 735, 737, 739, 747, 749, 751, 753, 755, 757, 759, 763, 769, 776, 782, 786, 788, 790, 792, 794, 802, 804, 806, 808, 810, 812, 816, 822, 830, 839, 847, 853, 857, 859, 861, 863, 871, 873, 875, 877, 879, 883, 889, 897, 907, 918, 928, 936, 942, 946, 948, 950, 958, 960, 962, 964, 968, 974, 982, 992, 1004, 1017, 1029, 1039, 1042, 1048, 1052, 1054, 1060, 1062, 1064, 1068, 1074, 1082, 1092, 1104, 1118, 1133, 1147, 1159, 1169, 1177, 1183, 1187]
Discarding 272 places :
Implicit Place search using SMT only with invariants took 3420 ms to find 272 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 941/1628 places, 3156/3415 transitions.
Applied a total of 0 rules in 80 ms. Remains 941 /941 variables (removed 0) and now considering 3156/3156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 13780 ms. Remains : 941/1628 places, 3156/3415 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2148424979270012714.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9570493603135954577.kers'
[2026-05-25 13:27:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2148424979270012714.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9570493603135954577.kers]
Normalized transition count is 2759 out of 3156 initially.
Culling duplicate invariants (modulo rational): removing 30 columns.
Culled 30 columns in 1 ms.
// Phase 1: matrix 2759 rows 911 cols 7757 entries
Finished phase 1 with 894 SingleSign rule and 6 generalized
[2026-05-25 13:28:00] [INFO ] Computed 41 invariants in 26 ms
Computed 41 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-9570493603135954577.kers
Total runtime 29 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (42675 resets) in 11232 ms. (89 steps per ms)
BEST_FIRST walk for 1000000 steps (4677 resets) in 1849 ms. (540 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 13:28:13] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14422390128842570097.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5827085420435940656.kers'
[2026-05-25 13:28:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14422390128842570097.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5827085420435940656.kers]
Culling duplicate invariants (modulo rational): removing 30 columns.
Culled 30 columns in 3 ms.
// Phase 1: matrix 2759 rows 911 cols 7757 entries
Finished phase 1 with 894 SingleSign rule and 6 generalized
[2026-05-25 13:28:13] [INFO ] Computed 41 invariants in 51 ms
Computed 41 P flows in 53 ms.
Exported basis to /tmp/petrispot-output-5827085420435940656.kers
Total runtime 59 ms.
[2026-05-25 13:28:13] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2026-05-25 13:28:13] [INFO ] [Real]Absence check using 17 positive and 24 generalized place invariants in 7 ms returned sat
[2026-05-25 13:28:14] [INFO ] [Real]Absence check using state equation in 757 ms returned sat
[2026-05-25 13:28:14] [INFO ] State equation strengthened by 1627 read => feed constraints.
[2026-05-25 13:28:14] [INFO ] [Real]Added 1627 Read/Feed constraints in 266 ms returned sat
[2026-05-25 13:28:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 13:28:14] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2026-05-25 13:28:14] [INFO ] [Nat]Absence check using 17 positive and 24 generalized place invariants in 5 ms returned sat
[2026-05-25 13:28:15] [INFO ] [Nat]Absence check using state equation in 720 ms returned sat
[2026-05-25 13:28:16] [INFO ] [Nat]Added 1627 Read/Feed constraints in 1003 ms returned sat
[2026-05-25 13:28:16] [INFO ] Computed and/alt/rep : 1318/1894/1318 causal constraints (skipped 1379 transitions) in 210 ms.
[2026-05-25 13:28:17] [INFO ] Added : 11 causal constraints over 3 iterations in 888 ms. Result :sat
Minimization took 5045 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 941 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 3156/3156 transitions.
Applied a total of 0 rules in 93 ms. Remains 941 /941 variables (removed 0) and now considering 3156/3156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 941/941 places, 3156/3156 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 3156/3156 transitions.
Applied a total of 0 rules in 75 ms. Remains 941 /941 variables (removed 0) and now considering 3156/3156 (removed 0) transitions.
[2026-05-25 13:28:22] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-25 13:28:22] [INFO ] Invariant cache hit.
[2026-05-25 13:28:24] [INFO ] Implicit Places using invariants in 1424 ms returned []
[2026-05-25 13:28:24] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-25 13:28:24] [INFO ] Invariant cache hit.
[2026-05-25 13:28:25] [INFO ] State equation strengthened by 1627 read => feed constraints.
[2026-05-25 13:28:55] [INFO ] Performed 557/941 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-25 13:29:20] [INFO ] Implicit Places using invariants and state equation in 56584 ms returned []
Implicit Place search using SMT with State Equation took 58043 ms to find 0 implicit places.
[2026-05-25 13:29:20] [INFO ] Redundant transitions in 165 ms returned []
Running 3094 sub problems to find dead transitions.
[2026-05-25 13:29:21] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-25 13:29:21] [INFO ] Invariant cache hit.
[2026-05-25 13:29:21] [INFO ] State equation strengthened by 1627 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/938 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3094 unsolved
SMT process timed out in 32972ms, After SMT, problems are : Problem set: 0 solved, 3094 unsolved
Search for dead transitions found 0 dead transitions in 33022ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91378 ms. Remains : 941/941 places, 3156/3156 transitions.
RANDOM walk for 40000 steps (1703 resets) in 1246 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (183 resets) in 233 ms. (170 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (185 resets) in 351 ms. (113 steps per ms) remains 2/2 properties
[2026-05-25 13:29:54] [INFO ] Flatten gal took : 352 ms
[2026-05-25 13:29:55] [INFO ] Flatten gal took : 151 ms
[2026-05-25 13:29:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3844434610013591699.gal : 56 ms
[2026-05-25 13:29:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6102267849106513495.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/ReachabilityCardinality3844434610013591699.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6102267849106513495.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/ReachabilityCardinality6102267849106513495.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 24
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :24 after 28
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :28 after 37
Interrupted probabilistic random walk after 69835 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 2
Probabilistic random walk after 69835 steps, saw 29046 distinct states, run finished after 3004 ms. (steps per millisecond=23 ) properties seen :0
[2026-05-25 13:29:57] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-25 13:29:57] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :37 after 41
[2026-05-25 13:29:57] [INFO ] State equation strengthened by 1627 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :41 after 54
At refinement iteration 1 (OVERLAPS) 860/861 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :54 after 71
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :71 after 138
At refinement iteration 2 (INCLUDED_ONLY) 0/861 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/879 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :138 after 225
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :225 after 533
At refinement iteration 4 (INCLUDED_ONLY) 0/879 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :533 after 753
At refinement iteration 6 (OVERLAPS) 10/889 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/889 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 24/913 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :753 after 1289
SMT process timed out in 5680ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 941 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 3156/3156 transitions.
Applied a total of 0 rules in 108 ms. Remains 941 /941 variables (removed 0) and now considering 3156/3156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 941/941 places, 3156/3156 transitions.
RANDOM walk for 40000 steps (1707 resets) in 1097 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (186 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (186 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 68526 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 2
Probabilistic random walk after 68526 steps, saw 28512 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2026-05-25 13:30:06] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-25 13:30:06] [INFO ] Invariant cache hit.
[2026-05-25 13:30:06] [INFO ] State equation strengthened by 1627 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 860/861 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/861 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/879 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1289 after 2450
At refinement iteration 4 (INCLUDED_ONLY) 0/879 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/889 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/889 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 24/913 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2450 after 5051
At refinement iteration 9 (INCLUDED_ONLY) 0/913 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/913 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 14/927 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/927 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 14/941 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/941 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 2759/3700 variables, 941/1002 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3700 variables, 1627/2629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3700 variables, 0/2629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/3700 variables, 0/2629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3700/3700 variables, and 2629 constraints, problems are : Problem set: 0 solved, 2 unsolved in 17606 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 941/941 constraints, ReadFeed: 1627/1627 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 860/861 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/861 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/879 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/879 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/889 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/889 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 24/913 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/913 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/913 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/913 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 14/927 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/927 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 14/941 variables, 14/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/941 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2759/3700 variables, 941/1010 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3700 variables, 1627/2637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3700 variables, 2/2639 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3700 variables, 1/2640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3700 variables, 0/2640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :5051 after 9646
At refinement iteration 21 (OVERLAPS) 0/3700 variables, 0/2640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3700/3700 variables, and 2640 constraints, problems are : Problem set: 0 solved, 2 unsolved in 11592 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 941/941 constraints, ReadFeed: 1627/1627 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29237ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 94 ms.
Support contains 1 out of 941 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 3156/3156 transitions.
Applied a total of 0 rules in 85 ms. Remains 941 /941 variables (removed 0) and now considering 3156/3156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 941/941 places, 3156/3156 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 3156/3156 transitions.
Applied a total of 0 rules in 82 ms. Remains 941 /941 variables (removed 0) and now considering 3156/3156 (removed 0) transitions.
[2026-05-25 13:30:36] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-25 13:30:36] [INFO ] Invariant cache hit.
[2026-05-25 13:30:38] [INFO ] Implicit Places using invariants in 1655 ms returned []
[2026-05-25 13:30:38] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-25 13:30:38] [INFO ] Invariant cache hit.
[2026-05-25 13:30:38] [INFO ] State equation strengthened by 1627 read => feed constraints.
Detected timeout of ITS tools.
[2026-05-25 13:30:45] [INFO ] Flatten gal took : 107 ms
[2026-05-25 13:30:45] [INFO ] Applying decomposition
[2026-05-25 13:30:45] [INFO ] Flatten gal took : 89 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/graph8357443379737486057.txt' '-o' '/tmp/graph8357443379737486057.bin' '-w' '/tmp/graph8357443379737486057.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8357443379737486057.bin' '-l' '-1' '-v' '-w' '/tmp/graph8357443379737486057.weights' '-q' '0' '-e' '0.001'
[2026-05-25 13:30:45] [INFO ] Decomposing Gal with order
[2026-05-25 13:30:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 13:30:46] [INFO ] Removed a total of 4980 redundant transitions.
[2026-05-25 13:30:47] [INFO ] Flatten gal took : 960 ms
[2026-05-25 13:30:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 2369 labels/synchronizations in 210 ms.
[2026-05-25 13:30:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8206845587729023010.gal : 48 ms
[2026-05-25 13:30:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7061189451596896640.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/ReachabilityCardinality8206845587729023010.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7061189451596896640.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/ReachabilityCardinality7061189451596896640.prop.
[2026-05-25 13:31:09] [INFO ] Performed 541/941 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-25 13:31:35] [INFO ] Implicit Places using invariants and state equation in 57664 ms returned []
Implicit Place search using SMT with State Equation took 59324 ms to find 0 implicit places.
[2026-05-25 13:31:35] [INFO ] Redundant transitions in 164 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59581 ms. Remains : 941/941 places, 3156/3156 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-09
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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3830358017416536798.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9825273265686815230.kers'
[2026-05-25 13:31:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3830358017416536798.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9825273265686815230.kers]
Normalized transition count is 2759 out of 3156 initially.
Culling duplicate invariants (modulo rational): removing 30 columns.
Culled 30 columns in 18 ms.
// Phase 1: matrix 2759 rows 911 cols 7757 entries
Finished phase 1 with 894 SingleSign rule and 6 generalized
[2026-05-25 13:31:36] [INFO ] Computed 41 invariants in 37 ms
Computed 41 P flows in 38 ms.
Exported basis to /tmp/petrispot-output-9825273265686815230.kers
Total runtime 45 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (426 resets) in 114 ms. (86 steps per ms)
BEST_FIRST walk for 10001 steps (46 resets) in 18 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 13:31:36] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5786535618112326644.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3509189164275845288.kers'
[2026-05-25 13:31:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5786535618112326644.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3509189164275845288.kers]
Culling duplicate invariants (modulo rational): removing 30 columns.
Culled 30 columns in 3 ms.
// Phase 1: matrix 2759 rows 911 cols 7757 entries
Finished phase 1 with 894 SingleSign rule and 6 generalized
[2026-05-25 13:31:36] [INFO ] Computed 41 invariants in 37 ms
Computed 41 P flows in 37 ms.
Exported basis to /tmp/petrispot-output-3509189164275845288.kers
Total runtime 42 ms.
[2026-05-25 13:31:36] [INFO ] [Real]Absence check using 17 positive place invariants in 22 ms returned sat
[2026-05-25 13:31:36] [INFO ] [Real]Absence check using 17 positive and 24 generalized place invariants in 6 ms returned sat
[2026-05-25 13:31:37] [INFO ] [Real]Absence check using state equation in 801 ms returned sat
[2026-05-25 13:31:37] [INFO ] State equation strengthened by 1627 read => feed constraints.
[2026-05-25 13:31:37] [INFO ] [Real]Added 1627 Read/Feed constraints in 268 ms returned sat
[2026-05-25 13:31:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 13:31:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 13 ms returned sat
[2026-05-25 13:31:37] [INFO ] [Nat]Absence check using 17 positive and 24 generalized place invariants in 4 ms returned sat
[2026-05-25 13:31:38] [INFO ] [Nat]Absence check using state equation in 686 ms returned sat
[2026-05-25 13:31:39] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-25 13:31:39] [INFO ] [Nat]Added 1627 Read/Feed constraints in 1115 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 941 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 3156/3156 transitions.
Applied a total of 0 rules in 103 ms. Remains 941 /941 variables (removed 0) and now considering 3156/3156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 941/941 places, 3156/3156 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18215220130299908072.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15114502366210036103.kers'
[2026-05-25 13:31:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18215220130299908072.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15114502366210036103.kers]
Normalized transition count is 2759 out of 3156 initially.
Culling duplicate invariants (modulo rational): removing 30 columns.
Culled 30 columns in 4 ms.
// Phase 1: matrix 2759 rows 911 cols 7757 entries
Finished phase 1 with 894 SingleSign rule and 6 generalized
[2026-05-25 13:31:39] [INFO ] Computed 41 invariants in 37 ms
Computed 41 P flows in 39 ms.
Exported basis to /tmp/petrispot-output-15114502366210036103.kers
Total runtime 57 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (42665 resets) in 11545 ms. (86 steps per ms)
BEST_FIRST walk for 1000000 steps (4663 resets) in 1833 ms. (545 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 13:31:53] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18333477102385152328.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2581357480681367844.kers'
[2026-05-25 13:31:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18333477102385152328.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2581357480681367844.kers]
Culling duplicate invariants (modulo rational): removing 30 columns.
Culled 30 columns in 3 ms.
// Phase 1: matrix 2759 rows 911 cols 7757 entries
Finished phase 1 with 894 SingleSign rule and 6 generalized
[2026-05-25 13:31:53] [INFO ] Computed 41 invariants in 43 ms
Computed 41 P flows in 44 ms.
Exported basis to /tmp/petrispot-output-2581357480681367844.kers
Total runtime 50 ms.
[2026-05-25 13:31:53] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2026-05-25 13:31:53] [INFO ] [Real]Absence check using 17 positive and 24 generalized place invariants in 4 ms returned sat
[2026-05-25 13:31:54] [INFO ] [Real]Absence check using state equation in 958 ms returned sat
[2026-05-25 13:31:54] [INFO ] State equation strengthened by 1627 read => feed constraints.
[2026-05-25 13:31:54] [INFO ] [Real]Added 1627 Read/Feed constraints in 266 ms returned sat
[2026-05-25 13:31:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 13:31:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2026-05-25 13:31:55] [INFO ] [Nat]Absence check using 17 positive and 24 generalized place invariants in 3 ms returned sat
[2026-05-25 13:31:55] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2026-05-25 13:31:56] [INFO ] [Nat]Added 1627 Read/Feed constraints in 1127 ms returned sat
[2026-05-25 13:31:57] [INFO ] Computed and/alt/rep : 1318/1894/1318 causal constraints (skipped 1379 transitions) in 170 ms.
[2026-05-25 13:31:58] [INFO ] Added : 11 causal constraints over 3 iterations in 971 ms. Result :sat
Minimization took 5504 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 941 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 3156/3156 transitions.
Applied a total of 0 rules in 117 ms. Remains 941 /941 variables (removed 0) and now considering 3156/3156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 941/941 places, 3156/3156 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 3156/3156 transitions.
Applied a total of 0 rules in 136 ms. Remains 941 /941 variables (removed 0) and now considering 3156/3156 (removed 0) transitions.
[2026-05-25 13:32:03] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-25 13:32:03] [INFO ] Invariant cache hit.
[2026-05-25 13:32:05] [INFO ] Implicit Places using invariants in 1419 ms returned []
[2026-05-25 13:32:05] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-25 13:32:05] [INFO ] Invariant cache hit.
[2026-05-25 13:32:05] [INFO ] State equation strengthened by 1627 read => feed constraints.
[2026-05-25 13:32:36] [INFO ] Performed 546/941 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-25 13:33:00] [INFO ] Implicit Places using invariants and state equation in 55679 ms returned []
Implicit Place search using SMT with State Equation took 57111 ms to find 0 implicit places.
[2026-05-25 13:33:01] [INFO ] Redundant transitions in 111 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57368 ms. Remains : 941/941 places, 3156/3156 transitions.
[2026-05-25 13:33:01] [INFO ] Flatten gal took : 108 ms
[2026-05-25 13:33:01] [INFO ] Flatten gal took : 92 ms
[2026-05-25 13:33:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17797425993416288384.gal : 20 ms
[2026-05-25 13:33:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15249056221786615748.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/ReachabilityCardinality17797425993416288384.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15249056221786615748.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
RANDOM walk for 40000 steps (1703 resets) in 962 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (185 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (186 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality15249056221786615748.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 24
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :24 after 28
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :28 after 37
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :37 after 41
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :41 after 54
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :54 after 71
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :71 after 138
Interrupted probabilistic random walk after 73077 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 2
Probabilistic random walk after 73077 steps, saw 30393 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
SDD proceeding with computation,2 properties remain. new max is 512
[2026-05-25 13:33:04] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-25 13:33:04] [INFO ] Invariant cache hit.
SDD size :138 after 225
[2026-05-25 13:33:04] [INFO ] State equation strengthened by 1627 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 860/861 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/861 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/879 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :225 after 533
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :533 after 753
At refinement iteration 4 (INCLUDED_ONLY) 0/879 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/889 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/889 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 24/913 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :753 after 1289
SMT process timed out in 5103ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 941 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 3156/3156 transitions.
Applied a total of 0 rules in 101 ms. Remains 941 /941 variables (removed 0) and now considering 3156/3156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 941/941 places, 3156/3156 transitions.
RANDOM walk for 40000 steps (1704 resets) in 730 ms. (54 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (185 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (187 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 69106 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 2
Probabilistic random walk after 69106 steps, saw 28739 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2026-05-25 13:33:12] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-25 13:33:12] [INFO ] Invariant cache hit.
[2026-05-25 13:33:13] [INFO ] State equation strengthened by 1627 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 860/861 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/861 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/879 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1289 after 2450
At refinement iteration 4 (INCLUDED_ONLY) 0/879 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/889 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/889 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 24/913 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2450 after 5051
At refinement iteration 9 (INCLUDED_ONLY) 0/913 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/913 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 14/927 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/927 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 14/941 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/941 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 2759/3700 variables, 941/1002 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3700 variables, 1627/2629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3700 variables, 0/2629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/3700 variables, 0/2629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3700/3700 variables, and 2629 constraints, problems are : Problem set: 0 solved, 2 unsolved in 16816 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 941/941 constraints, ReadFeed: 1627/1627 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 860/861 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/861 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/879 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/879 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 10/889 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/889 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 24/913 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/913 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/913 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/913 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 14/927 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/927 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 14/941 variables, 14/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/941 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2759/3700 variables, 941/1010 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3700 variables, 1627/2637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3700 variables, 2/2639 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3700 variables, 1/2640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3700 variables, 0/2640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/3700 variables, 0/2640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3700/3700 variables, and 2640 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8983 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 941/941 constraints, ReadFeed: 1627/1627 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25824ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 84 ms.
Support contains 1 out of 941 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 3156/3156 transitions.
Applied a total of 0 rules in 81 ms. Remains 941 /941 variables (removed 0) and now considering 3156/3156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 941/941 places, 3156/3156 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 941/941 places, 3156/3156 transitions.
Applied a total of 0 rules in 72 ms. Remains 941 /941 variables (removed 0) and now considering 3156/3156 (removed 0) transitions.
[2026-05-25 13:33:39] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-25 13:33:39] [INFO ] Invariant cache hit.
[2026-05-25 13:33:40] [INFO ] Implicit Places using invariants in 1217 ms returned []
[2026-05-25 13:33:40] [INFO ] Flow matrix only has 2759 transitions (discarded 397 similar events)
[2026-05-25 13:33:40] [INFO ] Invariant cache hit.
[2026-05-25 13:33:41] [INFO ] State equation strengthened by 1627 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :5051 after 9646
Detected timeout of ITS tools.
[2026-05-25 13:33:51] [INFO ] Flatten gal took : 125 ms
[2026-05-25 13:33:51] [INFO ] Applying decomposition
[2026-05-25 13:33:51] [INFO ] Flatten gal took : 153 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/graph13572157816266165808.txt' '-o' '/tmp/graph13572157816266165808.bin' '-w' '/tmp/graph13572157816266165808.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13572157816266165808.bin' '-l' '-1' '-v' '-w' '/tmp/graph13572157816266165808.weights' '-q' '0' '-e' '0.001'
[2026-05-25 13:33:51] [INFO ] Decomposing Gal with order
[2026-05-25 13:33:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 13:33:52] [INFO ] Removed a total of 4828 redundant transitions.
[2026-05-25 13:33:52] [INFO ] Flatten gal took : 374 ms
[2026-05-25 13:33:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 2386 labels/synchronizations in 117 ms.
[2026-05-25 13:33:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16564689779509375380.gal : 22 ms
[2026-05-25 13:33:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15216619624547911205.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/ReachabilityCardinality16564689779509375380.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15216619624547911205.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality15216619624547911205.prop.
[2026-05-25 13:34:11] [INFO ] Performed 584/941 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-25 13:34:32] [INFO ] Implicit Places using invariants and state equation in 52278 ms returned []
Implicit Place search using SMT with State Equation took 53517 ms to find 0 implicit places.
[2026-05-25 13:34:32] [INFO ] Redundant transitions in 155 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53753 ms. Remains : 941/941 places, 3156/3156 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1039 edges and 941 vertex of which 17 / 941 are part of one of the 1 SCC in 4 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 299 transitions
Ensure Unique test removed 369 transitions
Reduce isomorphic transitions removed 668 transitions.
Graph (complete) has 3668 edges and 925 vertex of which 911 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node6DetectsThatNode9CanReplaceNode8.Node9IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 98 rules applied. Total rules applied 100 place count 894 transition count 2390
Reduce places removed 96 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 1 with 287 rules applied. Total rules applied 387 place count 798 transition count 2199
Reduce places removed 95 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 2 with 261 rules applied. Total rules applied 648 place count 703 transition count 2033
Reduce places removed 71 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 3 with 211 rules applied. Total rules applied 859 place count 632 transition count 1893
Reduce places removed 69 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 4 with 187 rules applied. Total rules applied 1046 place count 563 transition count 1775
Reduce places removed 49 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 5 with 145 rules applied. Total rules applied 1191 place count 514 transition count 1679
Reduce places removed 47 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 6 with 126 rules applied. Total rules applied 1317 place count 467 transition count 1600
Reduce places removed 32 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1411 place count 435 transition count 1538
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 78 rules applied. Total rules applied 1489 place count 405 transition count 1490
Reduce places removed 18 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1541 place count 387 transition count 1456
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1581 place count 371 transition count 1432
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1603 place count 363 transition count 1418
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1617 place count 357 transition count 1410
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 1621 place count 355 transition count 1408
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 8 Pre rules applied. Total rules applied 1621 place count 355 transition count 1400
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 14 with 16 rules applied. Total rules applied 1637 place count 347 transition count 1400
Discarding 285 places :
Symmetric choice reduction at 14 with 285 rule applications. Total rules 1922 place count 62 transition count 308
Iterating global reduction 14 with 285 rules applied. Total rules applied 2207 place count 62 transition count 308
Ensure Unique test removed 253 transitions
Reduce isomorphic transitions removed 253 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 14 with 266 rules applied. Total rules applied 2473 place count 62 transition count 42
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 15 with 13 rules applied. Total rules applied 2486 place count 49 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2486 place count 49 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2488 place count 48 transition count 41
Discarding 13 places :
Symmetric choice reduction at 16 with 13 rule applications. Total rules 2501 place count 35 transition count 28
Iterating global reduction 16 with 13 rules applied. Total rules applied 2514 place count 35 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2516 place count 34 transition count 27
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 16 with 8 rules applied. Total rules applied 2524 place count 34 transition count 19
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 2532 place count 26 transition count 19
Applied a total of 2532 rules in 392 ms. Remains 26 /941 variables (removed 915) and now considering 19/3156 (removed 3137) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15708108543785509124.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6113291664779586843.kers'
[2026-05-25 13:34:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15708108543785509124.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6113291664779586843.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 19 rows 24 cols 80 entries
Finished phase 1 with 9 SingleSign rule and 6 generalized
[2026-05-25 13:34:33] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6113291664779586843.kers
Total runtime 4 ms.
[2026-05-25 13:34:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 13:34:33] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2026-05-25 13:34:33] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 13:34:33] [INFO ] After 22ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2026-05-25 13:34:33] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
[2026-05-25 13:34:33] [INFO ] Flatten gal took : 1 ms
[2026-05-25 13:34:33] [INFO ] Flatten gal took : 1 ms
[2026-05-25 13:34:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2296461264261008057.gal : 1 ms
[2026-05-25 13:34:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality486266022488999466.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/ReachabilityCardinality2296461264261008057.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality486266022488999466.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 ...327
Loading property file /tmp/ReachabilityCardinality486266022488999466.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 11
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :11 after 20
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :20 after 40
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :40 after 75
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,190,0.011386,4496,2,503,10,1382,8,0,112,1045,0
Total reachable state count : 190

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,22,0.011819,4608,2,204,10,1382,8,0,114,1045,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,22,0.012029,4608,2,204,10,1382,8,0,114,1045,0
Over-approximation ignoring read arcs solved 0 properties in 485 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-09 in 177199 ms.
[2026-05-25 13:34:33] [INFO ] Flatten gal took : 70 ms
[2026-05-25 13:34:33] [INFO ] Applying decomposition
[2026-05-25 13:34:33] [INFO ] Flatten gal took : 65 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/graph16384371390427787297.txt' '-o' '/tmp/graph16384371390427787297.bin' '-w' '/tmp/graph16384371390427787297.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16384371390427787297.bin' '-l' '-1' '-v' '-w' '/tmp/graph16384371390427787297.weights' '-q' '0' '-e' '0.001'
[2026-05-25 13:34:33] [INFO ] Decomposing Gal with order
[2026-05-25 13:34:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 13:34:33] [INFO ] Removed a total of 4959 redundant transitions.
[2026-05-25 13:34:34] [INFO ] Flatten gal took : 315 ms
[2026-05-25 13:34:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 2688 labels/synchronizations in 105 ms.
[2026-05-25 13:34:34] [INFO ] Time to serialize gal into /tmp/UpperBounds4812226748965584403.gal : 25 ms
[2026-05-25 13:34:34] [INFO ] Time to serialize properties into /tmp/UpperBounds12864430489335154805.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/UpperBounds4812226748965584403.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12864430489335154805.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/UpperBounds12864430489335154805.prop.
Detected timeout of ITS tools.
[2026-05-25 13:57:26] [INFO ] Flatten gal took : 1019 ms
[2026-05-25 13:57:27] [INFO ] Time to serialize gal into /tmp/UpperBounds16490022830511692083.gal : 176 ms
[2026-05-25 13:57:27] [INFO ] Time to serialize properties into /tmp/UpperBounds4046212480206800449.prop : 8 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/UpperBounds16490022830511692083.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4046212480206800449.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 ...305
Loading property file /tmp/UpperBounds4046212480206800449.prop.
Detected timeout of ITS tools.
[2026-05-25 14:20:24] [INFO ] Flatten gal took : 646 ms
[2026-05-25 14:20:30] [INFO ] Input system was already deterministic with 3156 transitions.
[2026-05-25 14:20:30] [INFO ] Transformed 941 places.
[2026-05-25 14:20:30] [INFO ] Transformed 3156 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 14:20:31] [INFO ] Time to serialize gal into /tmp/UpperBounds17405636656392864035.gal : 81 ms
[2026-05-25 14:20:31] [INFO ] Time to serialize properties into /tmp/UpperBounds10897772312117602382.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17405636656392864035.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10897772312117602382.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 ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds10897772312117602382.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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ 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="MultiCrashLeafsetExtension-PT-S16C04"
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 MultiCrashLeafsetExtension-PT-S16C04, 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 r178-oct2-177969020200405"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C04.tgz
mv MultiCrashLeafsetExtension-PT-S16C04 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;