About the Execution of ITS-Tools for BridgeAndVehicles-COL-V80P50N10
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r034-tall-177946841800141.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is BridgeAndVehicles-COL-V80P50N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946841800141
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.1K Mar 5 07:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 5 07:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 5 07:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 5 07:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Mar 15 07:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 15 07:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Mar 5 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 5 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 5 08:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Mar 5 08:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 07:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 45K 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 BridgeAndVehicles-COL-V80P50N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779522516356
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V80P50N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202604301425
[2026-05-23 07:48:37] [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-23 07:48:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 07:48:37] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-23 07:48:37] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-23 07:48:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 540 ms
[2026-05-23 07:48:38] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 188 PT places and 289218.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Reduction of identical properties reduced properties to check from 16 to 11
[2026-05-23 07:48:38] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2026-05-23 07:48:38] [INFO ] Skeletonized 11 HLPN properties in 1 ms.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-419799665027587278.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2196559608890671845.kers'
[2026-05-23 07:48:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-419799665027587278.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2196559608890671845.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 12 cols 28 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-23 07:48:38] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2196559608890671845.kers
Total runtime 0 ms.
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 50, 1, 0, 0, 1, 80, 1] Max Struct:[1, 50, 80, 80, 50, 1, 80, 50, 1, 80, 1]
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-14 80 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-06 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2026-05-23 07:48:38] [INFO ] Invariant cache hit.
[2026-05-23 07:48:38] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2026-05-23 07:48:38] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-23 07:48:38] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-23 07:48:38] [INFO ] Added : 2 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 7 ms.
[2026-05-23 07:48:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:48:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-23 07:48:38] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2026-05-23 07:48:38] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-23 07:48:38] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 3 ms.
[2026-05-23 07:48:38] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-23 07:48:38] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-23 07:48:38] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-23 07:48:38] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 2 ms.
[2026-05-23 07:48:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:48:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-23 07:48:38] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2026-05-23 07:48:38] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-23 07:48:38] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 3 ms.
[2026-05-23 07:48:38] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-23 07:48:38] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-23 07:48:38] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-23 07:48:38] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2026-05-23 07:48:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:48:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-23 07:48:38] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-23 07:48:38] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-23 07:48:38] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2026-05-23 07:48:38] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-23 07:48:38] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-23 07:48:38] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-23 07:48:38] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2026-05-23 07:48:38] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-23 07:48:38] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-23 07:48:38] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-23 07:48:38] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2026-05-23 07:48:38] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-23 07:48:38] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-23 07:48:38] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-23 07:48:38] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2026-05-23 07:48:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:48:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-23 07:48:38] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-23 07:48:38] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-23 07:48:38] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 50, 80, 80, 80, 50]
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2026-05-23 07:48:38] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions 15950 arcs in 117 ms.
[2026-05-23 07:48:38] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 50, 80, 80, 80, 50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 50, 80, 80, 80, 50]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7931918058867921584.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14257004948085388202.kers'
[2026-05-23 07:48:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7931918058867921584.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14257004948085388202.kers]
Normalized transition count is 370 out of 2108 initially.
Culled 0 columns in 2 ms.
// Phase 1: matrix 370 rows 188 cols 1950 entries
Finished phase 1 with 21 SingleSign rule and 160 generalized
[2026-05-23 07:48:39] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14257004948085388202.kers
Total runtime 6 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 50, 80, 80, 80, 50]
RANDOM walk for 10000 steps (14 resets) in 243 ms. (40 steps per ms)
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-09 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-05 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-08 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-03 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V80P50N10-UpperBounds-04 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20001 steps (11 resets) in 80 ms. (246 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 5] Max Struct:[50, 50]
[2026-05-23 07:48:39] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13659964655467426208.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18415588666987343881.kers'
[2026-05-23 07:48:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13659964655467426208.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18415588666987343881.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 370 rows 188 cols 1950 entries
Finished phase 1 with 21 SingleSign rule and 160 generalized
[2026-05-23 07:48:39] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18415588666987343881.kers
Total runtime 3 ms.
[2026-05-23 07:48:39] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-23 07:48:39] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2026-05-23 07:48:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 07:48:39] [INFO ] [Real]Added 22 Read/Feed constraints in 46 ms returned sat
[2026-05-23 07:48:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:48:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-23 07:48:39] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2026-05-23 07:48:39] [INFO ] [Nat]Added 22 Read/Feed constraints in 50 ms returned sat
[2026-05-23 07:48:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 356 ms
[2026-05-23 07:48:40] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 89 ms.
[2026-05-23 07:48:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
[2026-05-23 07:48:40] [INFO ] Added : 11 causal constraints over 10 iterations in 807 ms. Result :sat
Minimization took 315 ms.
[2026-05-23 07:48:41] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-23 07:48:41] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-23 07:48:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:48:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-23 07:48:41] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2026-05-23 07:48:41] [INFO ] [Nat]Added 22 Read/Feed constraints in 29 ms returned sat
[2026-05-23 07:48:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
[2026-05-23 07:48:41] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 93 ms.
[2026-05-23 07:48:42] [INFO ] Added : 10 causal constraints over 2 iterations in 317 ms. Result :sat
Minimization took 263 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7, 5] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7, 5] Max Struct:[50, 50]
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 347 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
Running 2105 sub problems to find dead transitions.
[2026-05-23 07:48:43] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16163972516576648261.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-886867221056404316.kers'
[2026-05-23 07:48:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16163972516576648261.kers, --Pflows, --basisKERS=/tmp/petrispot-output-886867221056404316.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 370 rows 186 cols 1948 entries
Finished phase 1 with 181 SingleSign rule and 0 generalized
[2026-05-23 07:48:43] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-886867221056404316.kers
Total runtime 2 ms.
[2026-05-23 07:48:43] [INFO ] State equation strengthened by 22 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/182 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1923/182 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42080ms problems are : Problem set: 0 solved, 2105 unsolved
Search for dead transitions found 0 dead transitions in 42112ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42516 ms. Remains : 186/188 places, 2108/2108 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10044894966697368181.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1147880515015797779.kers'
[2026-05-23 07:49:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10044894966697368181.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1147880515015797779.kers]
Normalized transition count is 370 out of 2108 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 370 rows 186 cols 1948 entries
Finished phase 1 with 181 SingleSign rule and 0 generalized
[2026-05-23 07:49:25] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1147880515015797779.kers
Total runtime 9 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[7, 5] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (1424 resets) in 7669 ms. (130 steps per ms)
BEST_FIRST walk for 2000002 steps (1082 resets) in 5702 ms. (350 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[50, 50]
[2026-05-23 07:49:39] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13380800182666658735.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12584671239451823020.kers'
[2026-05-23 07:49:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13380800182666658735.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12584671239451823020.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 370 rows 186 cols 1948 entries
Finished phase 1 with 181 SingleSign rule and 0 generalized
[2026-05-23 07:49:39] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12584671239451823020.kers
Total runtime 6 ms.
[2026-05-23 07:49:39] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-23 07:49:39] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2026-05-23 07:49:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 07:49:39] [INFO ] [Real]Added 22 Read/Feed constraints in 21 ms returned sat
[2026-05-23 07:49:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:49:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 07:49:39] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2026-05-23 07:49:39] [INFO ] [Nat]Added 22 Read/Feed constraints in 55 ms returned sat
[2026-05-23 07:49:39] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 44 ms.
[2026-05-23 07:49:39] [INFO ] Added : 7 causal constraints over 6 iterations in 367 ms. Result :sat
Minimization took 206 ms.
[2026-05-23 07:49:40] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 07:49:40] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2026-05-23 07:49:40] [INFO ] [Real]Added 22 Read/Feed constraints in 18 ms returned sat
[2026-05-23 07:49:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:49:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 07:49:40] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2026-05-23 07:49:40] [INFO ] [Nat]Added 22 Read/Feed constraints in 33 ms returned sat
[2026-05-23 07:49:40] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 31 ms.
[2026-05-23 07:49:40] [INFO ] Added : 10 causal constraints over 2 iterations in 290 ms. Result :sat
Minimization took 320 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[50, 50]
Support contains 2 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 187 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 186/186 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 165 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2026-05-23 07:49:42] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2026-05-23 07:49:42] [INFO ] Invariant cache hit.
[2026-05-23 07:49:42] [INFO ] Implicit Places using invariants in 477 ms returned []
[2026-05-23 07:49:42] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2026-05-23 07:49:42] [INFO ] Invariant cache hit.
[2026-05-23 07:49:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 07:49:47] [INFO ] Implicit Places using invariants and state equation in 4875 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5366 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 184/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 165 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5697 ms. Remains : 184/186 places, 2108/2108 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9412067946211046709.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9968162900023683308.kers'
[2026-05-23 07:49:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9412067946211046709.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9968162900023683308.kers]
Normalized transition count is 370 out of 2108 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 370 rows 184 cols 1626 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-05-23 07:49:47] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9968162900023683308.kers
Total runtime 6 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (1424 resets) in 6835 ms. (146 steps per ms)
BEST_FIRST walk for 2000002 steps (1083 resets) in 5111 ms. (391 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[50, 50]
[2026-05-23 07:49:59] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8860582731953108082.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2018990024453297090.kers'
[2026-05-23 07:49:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8860582731953108082.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2018990024453297090.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 370 rows 184 cols 1626 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-05-23 07:49:59] [INFO ] Computed 5 invariants in 5 ms
Computed 5 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-2018990024453297090.kers
Total runtime 7 ms.
[2026-05-23 07:49:59] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2026-05-23 07:49:59] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-23 07:49:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:49:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 07:49:59] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2026-05-23 07:49:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 07:49:59] [INFO ] [Nat]Added 22 Read/Feed constraints in 32 ms returned sat
[2026-05-23 07:49:59] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 61 ms.
[2026-05-23 07:50:00] [INFO ] Added : 12 causal constraints over 10 iterations in 375 ms. Result :sat
Minimization took 274 ms.
[2026-05-23 07:50:00] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 07:50:00] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2026-05-23 07:50:00] [INFO ] [Real]Added 22 Read/Feed constraints in 18 ms returned sat
[2026-05-23 07:50:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:50:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 07:50:00] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2026-05-23 07:50:00] [INFO ] [Nat]Added 22 Read/Feed constraints in 32 ms returned sat
[2026-05-23 07:50:00] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 28 ms.
[2026-05-23 07:50:01] [INFO ] Added : 10 causal constraints over 2 iterations in 319 ms. Result :sat
Minimization took 171 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[50, 50]
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2108/2108 transitions.
Applied a total of 0 rules in 133 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 184/184 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2108/2108 transitions.
Applied a total of 0 rules in 149 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2026-05-23 07:50:02] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2026-05-23 07:50:02] [INFO ] Invariant cache hit.
[2026-05-23 07:50:02] [INFO ] Implicit Places using invariants in 428 ms returned []
[2026-05-23 07:50:02] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2026-05-23 07:50:02] [INFO ] Invariant cache hit.
[2026-05-23 07:50:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 07:50:04] [INFO ] Implicit Places using invariants and state equation in 1921 ms returned []
Implicit Place search using SMT with State Equation took 2353 ms to find 0 implicit places.
[2026-05-23 07:50:04] [INFO ] Redundant transitions in 112 ms returned []
Running 2105 sub problems to find dead transitions.
[2026-05-23 07:50:04] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2026-05-23 07:50:04] [INFO ] Invariant cache hit.
[2026-05-23 07:50:04] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/554 variables, and 7 constraints, problems are : Problem set: 80 solved, 2025 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/182 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 80 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 80 solved, 2025 unsolved
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 2/7 constraints. Problems are: Problem set: 160 solved, 1945 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/554 variables, and 7 constraints, problems are : Problem set: 160 solved, 1945 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1843/182 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61911ms problems are : Problem set: 160 solved, 1945 unsolved
Search for dead transitions found 160 dead transitions in 61917ms
Found 160 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 160 transitions
Dead transitions reduction (with SMT) removed 160 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 184/184 places, 1948/2108 transitions.
Applied a total of 0 rules in 116 ms. Remains 184 /184 variables (removed 0) and now considering 1948/1948 (removed 0) transitions.
[2026-05-23 07:51:06] [INFO ] Redundant transitions in 127 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64801 ms. Remains : 184/184 places, 1948/2108 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6762205728686612232.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-962948838214425744.kers'
[2026-05-23 07:51:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6762205728686612232.kers, --Pflows, --basisKERS=/tmp/petrispot-output-962948838214425744.kers]
Normalized transition count is 368 out of 1948 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 368 rows 184 cols 1622 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-05-23 07:51:06] [INFO ] Computed 5 invariants in 7 ms
Computed 5 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-962948838214425744.kers
Total runtime 9 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[10, 10] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (1423 resets) in 6594 ms. (151 steps per ms)
BEST_FIRST walk for 2000001 steps (1082 resets) in 4958 ms. (403 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 10] Max Struct:[50, 50]
[2026-05-23 07:51:18] [INFO ] Flow matrix only has 368 transitions (discarded 1580 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4281509010596064617.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9445472539243366768.kers'
[2026-05-23 07:51:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4281509010596064617.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9445472539243366768.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 368 rows 184 cols 1622 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-05-23 07:51:18] [INFO ] Computed 5 invariants in 8 ms
Computed 5 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-9445472539243366768.kers
Total runtime 10 ms.
[2026-05-23 07:51:18] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-23 07:51:18] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-23 07:51:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:51:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-23 07:51:18] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2026-05-23 07:51:18] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 07:51:18] [INFO ] [Nat]Added 20 Read/Feed constraints in 33 ms returned sat
[2026-05-23 07:51:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2026-05-23 07:51:18] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 195 transitions) in 27 ms.
[2026-05-23 07:51:19] [INFO ] Added : 11 causal constraints over 10 iterations in 349 ms. Result :sat
Minimization took 280 ms.
[2026-05-23 07:51:19] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 07:51:19] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2026-05-23 07:51:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:51:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 07:51:19] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2026-05-23 07:51:19] [INFO ] [Nat]Added 20 Read/Feed constraints in 31 ms returned sat
[2026-05-23 07:51:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2026-05-23 07:51:20] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 195 transitions) in 31 ms.
[2026-05-23 07:51:20] [INFO ] Added : 10 causal constraints over 2 iterations in 231 ms. Result :sat
Minimization took 224 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 10] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 10] Max Struct:[50, 50]
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 1948/1948 transitions.
Applied a total of 0 rules in 117 ms. Remains 184 /184 variables (removed 0) and now considering 1948/1948 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 184/184 places, 1948/1948 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 1948/1948 transitions.
Applied a total of 0 rules in 116 ms. Remains 184 /184 variables (removed 0) and now considering 1948/1948 (removed 0) transitions.
[2026-05-23 07:51:21] [INFO ] Flow matrix only has 368 transitions (discarded 1580 similar events)
[2026-05-23 07:51:21] [INFO ] Invariant cache hit.
[2026-05-23 07:51:21] [INFO ] Implicit Places using invariants in 399 ms returned []
[2026-05-23 07:51:21] [INFO ] Flow matrix only has 368 transitions (discarded 1580 similar events)
[2026-05-23 07:51:21] [INFO ] Invariant cache hit.
[2026-05-23 07:51:21] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 07:51:22] [INFO ] Implicit Places using invariants and state equation in 1146 ms returned []
Implicit Place search using SMT with State Equation took 1547 ms to find 0 implicit places.
[2026-05-23 07:51:22] [INFO ] Redundant transitions in 39 ms returned []
Running 1945 sub problems to find dead transitions.
[2026-05-23 07:51:22] [INFO ] Flow matrix only has 368 transitions (discarded 1580 similar events)
[2026-05-23 07:51:22] [INFO ] Invariant cache hit.
[2026-05-23 07:51:22] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1945 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/552 variables, and 6 constraints, problems are : Problem set: 0 solved, 1945 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1945/182 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1945 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1945 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1945 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/552 variables, and 6 constraints, problems are : Problem set: 0 solved, 1945 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1763/182 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61633ms problems are : Problem set: 0 solved, 1945 unsolved
Search for dead transitions found 0 dead transitions in 61639ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63355 ms. Remains : 184/184 places, 1948/1948 transitions.
RANDOM walk for 40000 steps (56 resets) in 993 ms. (40 steps per ms) remains 4/4 properties
[2026-05-23 07:52:25] [INFO ] Flatten gal took : 395 ms
BEST_FIRST walk for 40002 steps (20 resets) in 475 ms. (84 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (20 resets) in 351 ms. (113 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (20 resets) in 292 ms. (136 steps per ms) remains 4/4 properties
[2026-05-23 07:52:25] [INFO ] Flatten gal took : 249 ms
BEST_FIRST walk for 40000 steps (20 resets) in 256 ms. (155 steps per ms) remains 4/4 properties
[2026-05-23 07:52:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality318514576893505793.gal : 53 ms
[2026-05-23 07:52:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12007745392522714133.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/ReachabilityCardinality318514576893505793.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12007745392522714133.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/ReachabilityCardinality12007745392522714133.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :8 after 32
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :32 after 67
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :67 after 168
Interrupted probabilistic random walk after 244106 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 4
Probabilistic random walk after 244106 steps, saw 67416 distinct states, run finished after 3007 ms. (steps per millisecond=81 ) properties seen :0
[2026-05-23 07:52:28] [INFO ] Flow matrix only has 368 transitions (discarded 1580 similar events)
[2026-05-23 07:52:28] [INFO ] Invariant cache hit.
[2026-05-23 07:52:28] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 372/537 variables, 166/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/539 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/539 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/539 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :168 after 562
At refinement iteration 13 (OVERLAPS) 13/552 variables, 13/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/552 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/552 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 210 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1593 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 372/537 variables, 166/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :562 after 709
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/537 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/539 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/539 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/539 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 213 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/5 constraints, State Equation: 184/184 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6630ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 1948/1948 transitions.
Applied a total of 0 rules in 103 ms. Remains 184 /184 variables (removed 0) and now considering 1948/1948 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 184/184 places, 1948/1948 transitions.
RANDOM walk for 40000 steps (56 resets) in 696 ms. (57 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (20 resets) in 275 ms. (144 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (20 resets) in 261 ms. (152 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (20 resets) in 304 ms. (131 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (20 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :709 after 2766
Interrupted probabilistic random walk after 263394 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 4
Probabilistic random walk after 263394 steps, saw 72598 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
[2026-05-23 07:52:38] [INFO ] Flow matrix only has 368 transitions (discarded 1580 similar events)
[2026-05-23 07:52:38] [INFO ] Invariant cache hit.
[2026-05-23 07:52:38] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 372/537 variables, 166/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/539 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/539 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/539 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 13/552 variables, 13/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/552 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/552 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 210 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1427 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 162/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 372/537 variables, 166/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/537 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/539 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/539 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/539 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 13/552 variables, 13/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/552 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/552 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/552 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :2766 after 10930
After SMT solving in domain Int declared 552/552 variables, and 214 constraints, problems are : Problem set: 0 solved, 4 unsolved in 13122 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14559ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 924 ms.
Support contains 2 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 1948/1948 transitions.
Applied a total of 0 rules in 124 ms. Remains 184 /184 variables (removed 0) and now considering 1948/1948 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 184/184 places, 1948/1948 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 1948/1948 transitions.
Applied a total of 0 rules in 115 ms. Remains 184 /184 variables (removed 0) and now considering 1948/1948 (removed 0) transitions.
[2026-05-23 07:52:54] [INFO ] Flow matrix only has 368 transitions (discarded 1580 similar events)
[2026-05-23 07:52:54] [INFO ] Invariant cache hit.
[2026-05-23 07:52:54] [INFO ] Implicit Places using invariants in 380 ms returned []
[2026-05-23 07:52:54] [INFO ] Flow matrix only has 368 transitions (discarded 1580 similar events)
[2026-05-23 07:52:54] [INFO ] Invariant cache hit.
[2026-05-23 07:52:54] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 07:52:55] [INFO ] Implicit Places using invariants and state equation in 1100 ms returned []
Implicit Place search using SMT with State Equation took 1482 ms to find 0 implicit places.
[2026-05-23 07:52:55] [INFO ] Redundant transitions in 38 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1642 ms. Remains : 184/184 places, 1948/1948 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 1580 transitions
Reduce isomorphic transitions removed 1580 transitions.
Iterating post reduction 0 with 1580 rules applied. Total rules applied 1580 place count 184 transition count 368
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1584 place count 182 transition count 366
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1586 place count 182 transition count 364
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1588 place count 180 transition count 364
Applied a total of 1588 rules in 29 ms. Remains 180 /184 variables (removed 4) and now considering 364/1948 (removed 1584) transitions.
Running SMT prover for 4 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11457757741699205976.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17618492592193472079.kers'
[2026-05-23 07:52:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11457757741699205976.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17618492592193472079.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 180 cols 1610 entries
Finished phase 1 with 175 SingleSign rule and 0 generalized
[2026-05-23 07:52:56] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17618492592193472079.kers
Total runtime 2 ms.
[2026-05-23 07:52:56] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 07:52:56] [INFO ] After 475ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2026-05-23 07:52:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 07:52:56] [INFO ] After 429ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2026-05-23 07:52:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 07:52:57] [INFO ] After 218ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2026-05-23 07:52:57] [INFO ] After 487ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2026-05-23 07:52:57] [INFO ] After 1190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2026-05-23 07:52:57] [INFO ] Flatten gal took : 39 ms
[2026-05-23 07:52:57] [INFO ] Flatten gal took : 22 ms
[2026-05-23 07:52:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3706257445864886719.gal : 7 ms
[2026-05-23 07:52:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17113774273846468370.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/ReachabilityCardinality3706257445864886719.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17113774273846468370.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17113774273846468370.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 12
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :12 after 20
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :20 after 60
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :60 after 140
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :140 after 280
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :280 after 840
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :840 after 2860
Invariant property MIN1 does not hold.
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :2860 after 17392
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :17392 after 52210
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :52210 after 197602
Reachability property MAX1 is true.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :197602 after 1.01888e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.01888e+06 after 4.22713e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4.22713e+06 after 4.32882e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :4.32882e+06 after 4.4608e+06
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :4.4608e+06 after 5.24079e+06
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :5.24079e+06 after 6.80575e+06
Detected timeout of ITS tools.
[2026-05-23 07:53:12] [INFO ] Flatten gal took : 15 ms
[2026-05-23 07:53:12] [INFO ] Applying decomposition
[2026-05-23 07:53:12] [INFO ] Flatten gal took : 17 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/graph13809724420657944686.txt' '-o' '/tmp/graph13809724420657944686.bin' '-w' '/tmp/graph13809724420657944686.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13809724420657944686.bin' '-l' '-1' '-v' '-w' '/tmp/graph13809724420657944686.weights' '-q' '0' '-e' '0.001'
[2026-05-23 07:53:13] [INFO ] Decomposing Gal with order
[2026-05-23 07:53:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 07:53:13] [INFO ] Removed a total of 426 redundant transitions.
[2026-05-23 07:53:13] [INFO ] Flatten gal took : 98 ms
[2026-05-23 07:53:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 463 labels/synchronizations in 19 ms.
[2026-05-23 07:53:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11095483681271764790.gal : 4 ms
[2026-05-23 07:53:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9053137053222974818.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/ReachabilityCardinality11095483681271764790.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9053137053222974818.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality9053137053222974818.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 2465
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2465 after 63680
Detected timeout of ITS tools.
[2026-05-23 07:53:15] [INFO ] Flatten gal took : 47 ms
[2026-05-23 07:53:15] [INFO ] Applying decomposition
[2026-05-23 07:53:15] [INFO ] Flatten gal took : 46 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/graph7044691366353718884.txt' '-o' '/tmp/graph7044691366353718884.bin' '-w' '/tmp/graph7044691366353718884.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7044691366353718884.bin' '-l' '-1' '-v' '-w' '/tmp/graph7044691366353718884.weights' '-q' '0' '-e' '0.001'
[2026-05-23 07:53:15] [INFO ] Decomposing Gal with order
[2026-05-23 07:53:15] [INFO ] Rewriting arrays to variables to allow decomposition.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :63680 after 243628
[2026-05-23 07:53:16] [INFO ] Removed a total of 3639 redundant transitions.
[2026-05-23 07:53:16] [INFO ] Flatten gal took : 480 ms
[2026-05-23 07:53:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 416 labels/synchronizations in 27 ms.
[2026-05-23 07:53:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7791858396280521499.gal : 4 ms
[2026-05-23 07:53:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2209746326570328927.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/ReachabilityCardinality7791858396280521499.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2209746326570328927.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/ReachabilityCardinality2209746326570328927.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1 after 28
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :28 after 30
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :30 after 33
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :33 after 81
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :81 after 110
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :110 after 20490
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :20490 after 53771
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :243628 after 593417
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :156404 after 219268
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 32292 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting property specific reduction for BridgeAndVehicles-COL-V80P50N10-UpperBounds-01
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:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12550839265917489099.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16259497771935191280.kers'
[2026-05-23 07:53:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12550839265917489099.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16259497771935191280.kers]
Normalized transition count is 368 out of 1948 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 368 rows 184 cols 1622 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-05-23 07:53:28] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16259497771935191280.kers
Total runtime 6 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (14 resets) in 64 ms. (153 steps per ms)
BEST_FIRST walk for 10001 steps (5 resets) in 23 ms. (416 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2026-05-23 07:53:28] [INFO ] Flow matrix only has 368 transitions (discarded 1580 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3235906995494841654.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15923978370037755704.kers'
[2026-05-23 07:53:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3235906995494841654.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15923978370037755704.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 368 rows 184 cols 1622 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-05-23 07:53:28] [INFO ] Computed 5 invariants in 5 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15923978370037755704.kers
Total runtime 6 ms.
[2026-05-23 07:53:28] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2026-05-23 07:53:28] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2026-05-23 07:53:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:53:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 07:53:28] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2026-05-23 07:53:28] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 07:53:28] [INFO ] [Nat]Added 20 Read/Feed constraints in 32 ms returned sat
[2026-05-23 07:53:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2026-05-23 07:53:28] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 195 transitions) in 34 ms.
[2026-05-23 07:53:29] [INFO ] Added : 11 causal constraints over 10 iterations in 346 ms. Result :sat
Minimization took 268 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 1948/1948 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 183 transition count 1947
Applied a total of 2 rules in 113 ms. Remains 183 /184 variables (removed 1) and now considering 1947/1948 (removed 1) transitions.
Running 1944 sub problems to find dead transitions.
[2026-05-23 07:53:30] [INFO ] Flow matrix only has 367 transitions (discarded 1580 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13540408053490483450.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17588283712281878576.kers'
[2026-05-23 07:53:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13540408053490483450.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17588283712281878576.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 367 rows 182 cols 1379 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-23 07:53:30] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17588283712281878576.kers
Total runtime 2 ms.
[2026-05-23 07:53:30] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1944 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/550 variables, and 6 constraints, problems are : Problem set: 0 solved, 1944 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1944/181 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1944 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1944 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1944 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 183/550 variables, and 6 constraints, problems are : Problem set: 0 solved, 1944 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1763/181 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41544ms problems are : Problem set: 0 solved, 1944 unsolved
Search for dead transitions found 0 dead transitions in 41551ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41672 ms. Remains : 183/184 places, 1947/1948 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4211775719275591297.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9252132635357079941.kers'
[2026-05-23 07:54:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4211775719275591297.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9252132635357079941.kers]
Normalized transition count is 367 out of 1947 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 367 rows 182 cols 1379 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-23 07:54:11] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9252132635357079941.kers
Total runtime 7 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[50]
RANDOM walk for 1000000 steps (1643 resets) in 6633 ms. (150 steps per ms)
BEST_FIRST walk for 1000001 steps (671 resets) in 2632 ms. (379 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2026-05-23 07:54:20] [INFO ] Flow matrix only has 367 transitions (discarded 1580 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10713609892472171068.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15853694913407509954.kers'
[2026-05-23 07:54:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10713609892472171068.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15853694913407509954.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 367 rows 182 cols 1379 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-23 07:54:20] [INFO ] Computed 5 invariants in 5 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15853694913407509954.kers
Total runtime 7 ms.
[2026-05-23 07:54:20] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 07:54:21] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2026-05-23 07:54:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:54:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 07:54:21] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2026-05-23 07:54:21] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 07:54:21] [INFO ] [Nat]Added 20 Read/Feed constraints in 34 ms returned sat
[2026-05-23 07:54:21] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 194 transitions) in 26 ms.
[2026-05-23 07:54:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2026-05-23 07:54:21] [INFO ] Added : 8 causal constraints over 8 iterations in 566 ms. Result :sat
Minimization took 305 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 1947/1947 transitions.
Applied a total of 0 rules in 103 ms. Remains 183 /183 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 183/183 places, 1947/1947 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 1947/1947 transitions.
Applied a total of 0 rules in 108 ms. Remains 183 /183 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
[2026-05-23 07:54:22] [INFO ] Flow matrix only has 367 transitions (discarded 1580 similar events)
[2026-05-23 07:54:22] [INFO ] Invariant cache hit.
[2026-05-23 07:54:23] [INFO ] Implicit Places using invariants in 382 ms returned []
[2026-05-23 07:54:23] [INFO ] Flow matrix only has 367 transitions (discarded 1580 similar events)
[2026-05-23 07:54:23] [INFO ] Invariant cache hit.
[2026-05-23 07:54:23] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 07:54:24] [INFO ] Implicit Places using invariants and state equation in 1699 ms returned []
Implicit Place search using SMT with State Equation took 2083 ms to find 0 implicit places.
[2026-05-23 07:54:24] [INFO ] Redundant transitions in 40 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2238 ms. Remains : 183/183 places, 1947/1947 transitions.
[2026-05-23 07:54:24] [INFO ] Flatten gal took : 41 ms
[2026-05-23 07:54:24] [INFO ] Flatten gal took : 35 ms
[2026-05-23 07:54:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality793040380863424717.gal : 11 ms
[2026-05-23 07:54:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8335016607808341205.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/ReachabilityCardinality793040380863424717.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8335016607808341205.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
RANDOM walk for 40000 steps (64 resets) in 528 ms. (75 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40009 steps (24 resets) in 266 ms. (149 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (24 resets) in 226 ms. (176 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality8335016607808341205.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 30
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :30 after 90
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :90 after 159
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :159 after 566
Interrupted probabilistic random walk after 269482 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :0 out of 2
Probabilistic random walk after 269482 steps, saw 81389 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
[2026-05-23 07:54:28] [INFO ] Flow matrix only has 367 transitions (discarded 1580 similar events)
[2026-05-23 07:54:28] [INFO ] Invariant cache hit.
[2026-05-23 07:54:28] [INFO ] State equation strengthened by 20 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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/269 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/273 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 114/387 variables, 16/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/387 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 162/549 variables, 81/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/549 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/549 variables, 10/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/549 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/550 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/550 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/550 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 210 constraints, problems are : Problem set: 0 solved, 2 unsolved in 937 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/269 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/273 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :566 after 1391
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 114/387 variables, 16/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/387 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 10/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/387 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 162/549 variables, 81/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/549 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/549 variables, 10/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/549 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/550 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/550 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/550 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 550/550 variables, and 212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3777 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4721ms problems are : Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1391 after 4694
Parikh walk visited 0 properties in 191 ms.
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 1947/1947 transitions.
Applied a total of 0 rules in 109 ms. Remains 183 /183 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 183/183 places, 1947/1947 transitions.
RANDOM walk for 40000 steps (64 resets) in 425 ms. (93 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (24 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (24 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 280811 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 2
Probabilistic random walk after 280811 steps, saw 84339 distinct states, run finished after 3002 ms. (steps per millisecond=93 ) properties seen :0
[2026-05-23 07:54:36] [INFO ] Flow matrix only has 367 transitions (discarded 1580 similar events)
[2026-05-23 07:54:36] [INFO ] Invariant cache hit.
[2026-05-23 07:54:36] [INFO ] State equation strengthened by 20 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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/269 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/273 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 114/387 variables, 16/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/387 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 162/549 variables, 81/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/549 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/549 variables, 10/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/549 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/550 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/550 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/550 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 210 constraints, problems are : Problem set: 0 solved, 2 unsolved in 912 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/269 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/273 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 114/387 variables, 16/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/387 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 10/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/387 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 162/549 variables, 81/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/549 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/549 variables, 10/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :16116 after 16578
At refinement iteration 20 (INCLUDED_ONLY) 0/549 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/550 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/550 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/550 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 550/550 variables, and 212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3731 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4650ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 157 ms.
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 1947/1947 transitions.
Applied a total of 0 rules in 102 ms. Remains 183 /183 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 183/183 places, 1947/1947 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 1947/1947 transitions.
Applied a total of 0 rules in 115 ms. Remains 183 /183 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
[2026-05-23 07:54:41] [INFO ] Flow matrix only has 367 transitions (discarded 1580 similar events)
[2026-05-23 07:54:41] [INFO ] Invariant cache hit.
[2026-05-23 07:54:41] [INFO ] Implicit Places using invariants in 357 ms returned []
[2026-05-23 07:54:41] [INFO ] Flow matrix only has 367 transitions (discarded 1580 similar events)
[2026-05-23 07:54:41] [INFO ] Invariant cache hit.
[2026-05-23 07:54:41] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 07:54:43] [INFO ] Implicit Places using invariants and state equation in 1633 ms returned []
Implicit Place search using SMT with State Equation took 1993 ms to find 0 implicit places.
[2026-05-23 07:54:43] [INFO ] Redundant transitions in 39 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2152 ms. Remains : 183/183 places, 1947/1947 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 1580 transitions
Reduce isomorphic transitions removed 1580 transitions.
Iterating post reduction 0 with 1580 rules applied. Total rules applied 1580 place count 183 transition count 367
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1584 place count 181 transition count 365
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1586 place count 181 transition count 363
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1588 place count 179 transition count 363
Applied a total of 1588 rules in 21 ms. Remains 179 /183 variables (removed 4) and now considering 363/1947 (removed 1584) 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-9027928182799777747.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4466055974014746198.kers'
[2026-05-23 07:54:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9027928182799777747.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4466055974014746198.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 363 rows 178 cols 1367 entries
Finished phase 1 with 174 SingleSign rule and 0 generalized
[2026-05-23 07:54:43] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4466055974014746198.kers
Total runtime 2 ms.
[2026-05-23 07:54:43] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-23 07:54:43] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-23 07:54:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 07:54:44] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-23 07:54:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 07:54:44] [INFO ] After 117ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-23 07:54:44] [INFO ] After 235ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-23 07:54:44] [INFO ] After 573ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-23 07:54:44] [INFO ] Flatten gal took : 15 ms
[2026-05-23 07:54:44] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:54:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14302788015510758697.gal : 2 ms
[2026-05-23 07:54:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8018936321885735519.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/ReachabilityCardinality14302788015510758697.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8018936321885735519.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8018936321885735519.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 20
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :20 after 30
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30 after 71
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :71 after 990
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :990 after 4319
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4319 after 4431
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4431 after 4901
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4901 after 6155
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :6155 after 9169
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :9169 after 28923
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :16578 after 17829
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,1.13445e+10,6.87858,208608,2,48228,18,542982,8,0,1089,434481,0
Total reachable state count : 11344503360
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,263288,6.88315,208608,2,7517,18,542982,8,0,1091,434481,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,263288,6.88662,208608,2,7517,18,542982,8,0,1091,434481,0
Over-approximation ignoring read arcs solved 0 properties in 7829 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 07:54:51] [INFO ] Flatten gal took : 33 ms
[2026-05-23 07:54:51] [INFO ] Applying decomposition
[2026-05-23 07:54:51] [INFO ] Flatten gal took : 32 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/graph2598606975613478193.txt' '-o' '/tmp/graph2598606975613478193.bin' '-w' '/tmp/graph2598606975613478193.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2598606975613478193.bin' '-l' '-1' '-v' '-w' '/tmp/graph2598606975613478193.weights' '-q' '0' '-e' '0.001'
[2026-05-23 07:54:51] [INFO ] Decomposing Gal with order
[2026-05-23 07:54:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 07:54:52] [INFO ] Removed a total of 3404 redundant transitions.
[2026-05-23 07:54:52] [INFO ] Flatten gal took : 417 ms
[2026-05-23 07:54:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 590 labels/synchronizations in 26 ms.
[2026-05-23 07:54:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5908623119401044610.gal : 3 ms
[2026-05-23 07:54:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3685156946879908905.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/ReachabilityCardinality5908623119401044610.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3685156946879908905.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/ReachabilityCardinality3685156946879908905.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 22
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :22 after 39
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :39 after 72
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :72 after 122
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :122 after 5686
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5686 after 6561
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :6561 after 6561
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :6561 after 6561
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :51921 after 58321
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :109758 after 116238
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.8968e+06 after 3.11385e+06
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.09556e+07 after 1.11536e+07
Detected timeout of ITS tools.
Ending property specific reduction for BridgeAndVehicles-COL-V80P50N10-UpperBounds-01 in 133954 ms.
Starting property specific reduction for BridgeAndVehicles-COL-V80P50N10-UpperBounds-12
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:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12573192900211883454.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-732062280148617978.kers'
[2026-05-23 07:55:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12573192900211883454.kers, --Pflows, --basisKERS=/tmp/petrispot-output-732062280148617978.kers]
Normalized transition count is 368 out of 1948 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 368 rows 184 cols 1622 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-05-23 07:55:42] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-732062280148617978.kers
Total runtime 7 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (14 resets) in 67 ms. (147 steps per ms)
BEST_FIRST walk for 10001 steps (5 resets) in 24 ms. (400 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2026-05-23 07:55:42] [INFO ] Flow matrix only has 368 transitions (discarded 1580 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7352220404790751428.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2251993503419023191.kers'
[2026-05-23 07:55:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7352220404790751428.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2251993503419023191.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 368 rows 184 cols 1622 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-05-23 07:55:42] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2251993503419023191.kers
Total runtime 2 ms.
[2026-05-23 07:55:42] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 07:55:42] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2026-05-23 07:55:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:55:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 07:55:42] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2026-05-23 07:55:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 07:55:42] [INFO ] [Nat]Added 20 Read/Feed constraints in 31 ms returned sat
[2026-05-23 07:55:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2026-05-23 07:55:42] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 195 transitions) in 24 ms.
[2026-05-23 07:55:43] [INFO ] Added : 10 causal constraints over 2 iterations in 219 ms. Result :sat
Minimization took 201 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 1948/1948 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 183 transition count 1947
Applied a total of 2 rules in 127 ms. Remains 183 /184 variables (removed 1) and now considering 1947/1948 (removed 1) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 183/184 places, 1947/1948 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2925494264539706977.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9709641572023664758.kers'
[2026-05-23 07:55:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2925494264539706977.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9709641572023664758.kers]
Normalized transition count is 367 out of 1947 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 367 rows 182 cols 1379 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-23 07:55:43] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9709641572023664758.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[50]
RANDOM walk for 1000000 steps (1643 resets) in 6643 ms. (150 steps per ms)
BEST_FIRST walk for 1000001 steps (695 resets) in 2676 ms. (373 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[50]
[2026-05-23 07:55:52] [INFO ] Flow matrix only has 367 transitions (discarded 1580 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17399849281006299362.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4790323810807105100.kers'
[2026-05-23 07:55:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17399849281006299362.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4790323810807105100.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 367 rows 182 cols 1379 entries
Finished phase 1 with 178 SingleSign rule and 0 generalized
[2026-05-23 07:55:52] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-4790323810807105100.kers
Total runtime 5 ms.
[2026-05-23 07:55:52] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 07:55:53] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2026-05-23 07:55:53] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 07:55:53] [INFO ] [Real]Added 20 Read/Feed constraints in 41 ms returned sat
[2026-05-23 07:55:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 07:55:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 07:55:53] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2026-05-23 07:55:53] [INFO ] [Nat]Added 20 Read/Feed constraints in 54 ms returned sat
[2026-05-23 07:55:53] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 194 transitions) in 27 ms.
[2026-05-23 07:55:53] [INFO ] Added : 10 causal constraints over 2 iterations in 251 ms. Result :sat
Minimization took 164 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[50]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 1947/1947 transitions.
Applied a total of 0 rules in 108 ms. Remains 183 /183 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 183/183 places, 1947/1947 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 1947/1947 transitions.
Applied a total of 0 rules in 107 ms. Remains 183 /183 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
[2026-05-23 07:55:54] [INFO ] Flow matrix only has 367 transitions (discarded 1580 similar events)
[2026-05-23 07:55:54] [INFO ] Invariant cache hit.
[2026-05-23 07:55:54] [INFO ] Implicit Places using invariants in 396 ms returned []
[2026-05-23 07:55:54] [INFO ] Flow matrix only has 367 transitions (discarded 1580 similar events)
[2026-05-23 07:55:54] [INFO ] Invariant cache hit.
[2026-05-23 07:55:54] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 07:55:56] [INFO ] Implicit Places using invariants and state equation in 2162 ms returned []
Implicit Place search using SMT with State Equation took 2560 ms to find 0 implicit places.
[2026-05-23 07:55:56] [INFO ] Redundant transitions in 39 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2719 ms. Remains : 183/183 places, 1947/1947 transitions.
[2026-05-23 07:55:56] [INFO ] Flatten gal took : 69 ms
[2026-05-23 07:55:56] [INFO ] Flatten gal took : 48 ms
[2026-05-23 07:55:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13357377044970728239.gal : 9 ms
[2026-05-23 07:55:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15533122553112067197.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/ReachabilityCardinality13357377044970728239.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15533122553112067197.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 (64 resets) in 449 ms. (88 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40010 steps (26 resets) in 192 ms. (207 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (25 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality15533122553112067197.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 100
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :100 after 233
Interrupted probabilistic random walk after 302550 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 2
Probabilistic random walk after 302550 steps, saw 82915 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
[2026-05-23 07:56:00] [INFO ] Flow matrix only has 367 transitions (discarded 1580 similar events)
[2026-05-23 07:56:00] [INFO ] Invariant cache hit.
[2026-05-23 07:56:00] [INFO ] State equation strengthened by 20 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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/269 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/273 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 114/387 variables, 16/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 10/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/387 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 162/549 variables, 81/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/549 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/549 variables, 10/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/549 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/550 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/550 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 0/550 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 209 constraints, problems are : Problem set: 0 solved, 2 unsolved in 920 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/269 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/273 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :233 after 566
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 114/387 variables, 16/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/387 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 10/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :566 after 709
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 162/549 variables, 81/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/549 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/549 variables, 10/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/549 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/550 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/550 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/550 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 550/550 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3910 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4837ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 671 ms.
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 1947/1947 transitions.
Applied a total of 0 rules in 104 ms. Remains 183 /183 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 183/183 places, 1947/1947 transitions.
RANDOM walk for 40000 steps (64 resets) in 512 ms. (77 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40007 steps (26 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (25 resets) in 170 ms. (233 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 284791 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 2
Probabilistic random walk after 284791 steps, saw 78249 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
[2026-05-23 07:56:08] [INFO ] Flow matrix only has 367 transitions (discarded 1580 similar events)
[2026-05-23 07:56:08] [INFO ] Invariant cache hit.
[2026-05-23 07:56:08] [INFO ] State equation strengthened by 20 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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/269 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/273 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 114/387 variables, 16/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 10/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/387 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 162/549 variables, 81/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/549 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/549 variables, 10/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/549 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/550 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/550 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 0/550 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 209 constraints, problems are : Problem set: 0 solved, 2 unsolved in 884 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/83 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 186/269 variables, 83/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/273 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 114/387 variables, 16/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/387 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/387 variables, 10/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/387 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 162/549 variables, 81/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/549 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/549 variables, 10/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :709 after 2766
At refinement iteration 19 (INCLUDED_ONLY) 0/549 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/550 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/550 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/550 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 550/550 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3936 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 183/183 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4827ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 646 ms.
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 1947/1947 transitions.
Applied a total of 0 rules in 102 ms. Remains 183 /183 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 183/183 places, 1947/1947 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 1947/1947 transitions.
Applied a total of 0 rules in 102 ms. Remains 183 /183 variables (removed 0) and now considering 1947/1947 (removed 0) transitions.
[2026-05-23 07:56:14] [INFO ] Flow matrix only has 367 transitions (discarded 1580 similar events)
[2026-05-23 07:56:14] [INFO ] Invariant cache hit.
[2026-05-23 07:56:15] [INFO ] Implicit Places using invariants in 485 ms returned []
[2026-05-23 07:56:15] [INFO ] Flow matrix only has 367 transitions (discarded 1580 similar events)
[2026-05-23 07:56:15] [INFO ] Invariant cache hit.
[2026-05-23 07:56:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 07:56:17] [INFO ] Implicit Places using invariants and state equation in 2175 ms returned []
Implicit Place search using SMT with State Equation took 2662 ms to find 0 implicit places.
[2026-05-23 07:56:17] [INFO ] Redundant transitions in 37 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2810 ms. Remains : 183/183 places, 1947/1947 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 1580 transitions
Reduce isomorphic transitions removed 1580 transitions.
Iterating post reduction 0 with 1580 rules applied. Total rules applied 1580 place count 183 transition count 367
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1584 place count 181 transition count 365
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1586 place count 181 transition count 363
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1588 place count 179 transition count 363
Applied a total of 1588 rules in 14 ms. Remains 179 /183 variables (removed 4) and now considering 363/1947 (removed 1584) 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-10776073690290102003.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-176186051100671562.kers'
[2026-05-23 07:56:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10776073690290102003.kers, --Pflows, --basisKERS=/tmp/petrispot-output-176186051100671562.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 363 rows 178 cols 1367 entries
Finished phase 1 with 174 SingleSign rule and 0 generalized
[2026-05-23 07:56:17] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-176186051100671562.kers
Total runtime 4 ms.
[2026-05-23 07:56:17] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 07:56:17] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-23 07:56:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 07:56:17] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-23 07:56:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 07:56:17] [INFO ] After 126ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-23 07:56:18] [INFO ] After 235ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-23 07:56:18] [INFO ] After 594ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-23 07:56:18] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:56:18] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:56:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1773366764855837186.gal : 2 ms
[2026-05-23 07:56:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15463500392454066411.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/ReachabilityCardinality1773366764855837186.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15463500392454066411.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality15463500392454066411.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 68
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :68 after 300
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :300 after 310
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :310 after 431
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :431 after 716
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :716 after 1089
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1089 after 4717
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4717 after 7884
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :7884 after 24778
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,1.13445e+10,7.7477,233684,2,50077,18,568299,8,0,1089,473966,0
Total reachable state count : 11344503360
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,263288,7.75236,233684,2,7573,18,568299,8,0,1091,473966,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,263288,7.75603,233684,2,7573,18,568299,8,0,1092,473966,0
Over-approximation ignoring read arcs solved 0 properties in 8667 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 07:56:26] [INFO ] Flatten gal took : 33 ms
[2026-05-23 07:56:26] [INFO ] Applying decomposition
[2026-05-23 07:56:26] [INFO ] Flatten gal took : 41 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/graph10709854237072876376.txt' '-o' '/tmp/graph10709854237072876376.bin' '-w' '/tmp/graph10709854237072876376.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10709854237072876376.bin' '-l' '-1' '-v' '-w' '/tmp/graph10709854237072876376.weights' '-q' '0' '-e' '0.001'
[2026-05-23 07:56:26] [INFO ] Decomposing Gal with order
[2026-05-23 07:56:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 07:56:26] [INFO ] Removed a total of 4992 redundant transitions.
[2026-05-23 07:56:26] [INFO ] Flatten gal took : 157 ms
[2026-05-23 07:56:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 668 labels/synchronizations in 30 ms.
[2026-05-23 07:56:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16586338272753442111.gal : 3 ms
[2026-05-23 07:56:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8706664610941904605.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/ReachabilityCardinality16586338272753442111.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8706664610941904605.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality8706664610941904605.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 142
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :142 after 243
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :243 after 316
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :316 after 360
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :360 after 366
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :366 after 53280
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :53280 after 181187
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.28537e+06 after 1.30954e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :5.30051e+06 after 5.43446e+06
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.92784e+07 after 2.00281e+07
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :7.1203e+07 after 7.12992e+07
Detected timeout of ITS tools.
Ending property specific reduction for BridgeAndVehicles-COL-V80P50N10-UpperBounds-12 in 94373 ms.
[2026-05-23 07:57:16] [INFO ] Flatten gal took : 32 ms
[2026-05-23 07:57:16] [INFO ] Applying decomposition
[2026-05-23 07:57:16] [INFO ] Flatten gal took : 30 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/graph4967462305432505283.txt' '-o' '/tmp/graph4967462305432505283.bin' '-w' '/tmp/graph4967462305432505283.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4967462305432505283.bin' '-l' '-1' '-v' '-w' '/tmp/graph4967462305432505283.weights' '-q' '0' '-e' '0.001'
[2026-05-23 07:57:16] [INFO ] Decomposing Gal with order
[2026-05-23 07:57:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 07:57:17] [INFO ] Removed a total of 4071 redundant transitions.
[2026-05-23 07:57:17] [INFO ] Flatten gal took : 279 ms
[2026-05-23 07:57:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 456 labels/synchronizations in 28 ms.
[2026-05-23 07:57:17] [INFO ] Time to serialize gal into /tmp/UpperBounds3228400313814098188.gal : 3 ms
[2026-05-23 07:57:17] [INFO ] Time to serialize properties into /tmp/UpperBounds3486710056796366888.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/UpperBounds3228400313814098188.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3486710056796366888.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 ...283
Loading property file /tmp/UpperBounds3486710056796366888.prop.
Detected timeout of ITS tools.
[2026-05-23 08:20:10] [INFO ] Applying decomposition
[2026-05-23 08:20:10] [INFO ] Flatten gal took : 27 ms
[2026-05-23 08:20:10] [INFO ] Decomposing Gal with order
[2026-05-23 08:20:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:20:10] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to CAPACITE in partition [CONTROLEUR_0, CHOIX_0, VIDANGE_0],[CONTROLEUR_1, CHOIX_1, VIDANGE_1],[COMPTEUR_0],[COMPTEUR_1],[COMPTEUR_2],[COMPTEUR_3],[COMPTEUR_4],[COMPTEUR_5],[COMPTEUR_6],[COMPTEUR_7],[COMPTEUR_8],[COMPTEUR_9],[COMPTEUR_10],[NB_ATTENTE_A_0],[NB_ATTENTE_A_1],[NB_ATTENTE_A_2],[NB_ATTENTE_A_3],[NB_ATTENTE_A_4],[NB_ATTENTE_A_5],[NB_ATTENTE_A_6],[NB_ATTENTE_A_7],[NB_ATTENTE_A_8],[NB_ATTENTE_A_9],[NB_ATTENTE_A_10],[NB_ATTENTE_A_11],[NB_ATTENTE_A_12],[NB_ATTENTE_A_13],[NB_ATTENTE_A_14],[NB_ATTENTE_A_15],[NB_ATTENTE_A_16],[NB_ATTENTE_A_17],[NB_ATTENTE_A_18],[NB_ATTENTE_A_19],[NB_ATTENTE_A_20],[NB_ATTENTE_A_21],[NB_ATTENTE_A_22],[NB_ATTENTE_A_23],[NB_ATTENTE_A_24],[NB_ATTENTE_A_25],[NB_ATTENTE_A_26],[NB_ATTENTE_A_27],[NB_ATTENTE_A_28],[NB_ATTENTE_A_29],[NB_ATTENTE_A_30],[NB_ATTENTE_A_31],[NB_ATTENTE_A_32],[NB_ATTENTE_A_33],[NB_ATTENTE_A_34],[NB_ATTENTE_A_35],[NB_ATTENTE_A_36],[NB_ATTENTE_A_37],[NB_ATTENTE_A_38],[NB_ATTENTE_A_39],[NB_ATTENTE_A_40],[NB_ATTENTE_A_41],[NB_ATTENTE_A_42],[NB_ATTENTE_A_43],[NB_ATTENTE_A_44],[NB_ATTENTE_A_45],[NB_ATTENTE_A_46],[NB_ATTENTE_A_47],[NB_ATTENTE_A_48],[NB_ATTENTE_A_49],[NB_ATTENTE_A_50],[NB_ATTENTE_A_51],[NB_ATTENTE_A_52],[NB_ATTENTE_A_53],[NB_ATTENTE_A_54],[NB_ATTENTE_A_55],[NB_ATTENTE_A_56],[NB_ATTENTE_A_57],[NB_ATTENTE_A_58],[NB_ATTENTE_A_59],[NB_ATTENTE_A_60],[NB_ATTENTE_A_61],[NB_ATTENTE_A_62],[NB_ATTENTE_A_63],[NB_ATTENTE_A_64],[NB_ATTENTE_A_65],[NB_ATTENTE_A_66],[NB_ATTENTE_A_67],[NB_ATTENTE_A_68],[NB_ATTENTE_A_69],[NB_ATTENTE_A_70],[NB_ATTENTE_A_71],[NB_ATTENTE_A_72],[NB_ATTENTE_A_73],[NB_ATTENTE_A_74],[NB_ATTENTE_A_75],[NB_ATTENTE_A_76],[NB_ATTENTE_A_77],[NB_ATTENTE_A_78],[NB_ATTENTE_A_79],[NB_ATTENTE_A_80],[NB_ATTENTE_B_0],[NB_ATTENTE_B_1],[NB_ATTENTE_B_2],[NB_ATTENTE_B_3],[NB_ATTENTE_B_4],[NB_ATTENTE_B_5],[NB_ATTENTE_B_6],[NB_ATTENTE_B_7],[NB_ATTENTE_B_8],[NB_ATTENTE_B_9],[NB_ATTENTE_B_10],[NB_ATTENTE_B_11],[NB_ATTENTE_B_12],[NB_ATTENTE_B_13],[NB_ATTENTE_B_14],[NB_ATTENTE_B_15],[NB_ATTENTE_B_16],[NB_ATTENTE_B_17],[NB_ATTENTE_B_18],[NB_ATTENTE_B_19],[NB_ATTENTE_B_20],[NB_ATTENTE_B_21],[NB_ATTENTE_B_22],[NB_ATTENTE_B_23],[NB_ATTENTE_B_24],[NB_ATTENTE_B_25],[NB_ATTENTE_B_26],[NB_ATTENTE_B_27],[NB_ATTENTE_B_28],[NB_ATTENTE_B_29],[NB_ATTENTE_B_30],[NB_ATTENTE_B_31],[NB_ATTENTE_B_32],[NB_ATTENTE_B_33],[NB_ATTENTE_B_34],[NB_ATTENTE_B_35],[NB_ATTENTE_B_36],[NB_ATTENTE_B_37],[NB_ATTENTE_B_38],[NB_ATTENTE_B_39],[NB_ATTENTE_B_40],[NB_ATTENTE_B_41],[NB_ATTENTE_B_42],[NB_ATTENTE_B_43],[NB_ATTENTE_B_44],[NB_ATTENTE_B_45],[NB_ATTENTE_B_46],[NB_ATTENTE_B_47],[NB_ATTENTE_B_48],[NB_ATTENTE_B_49],[NB_ATTENTE_B_50],[NB_ATTENTE_B_51],[NB_ATTENTE_B_52],[NB_ATTENTE_B_53],[NB_ATTENTE_B_54],[NB_ATTENTE_B_55],[NB_ATTENTE_B_56],[NB_ATTENTE_B_57],[NB_ATTENTE_B_58],[NB_ATTENTE_B_59],[NB_ATTENTE_B_60],[NB_ATTENTE_B_61],[NB_ATTENTE_B_62],[NB_ATTENTE_B_63],[NB_ATTENTE_B_64],[NB_ATTENTE_B_65],[NB_ATTENTE_B_66],[NB_ATTENTE_B_67],[NB_ATTENTE_B_68],[NB_ATTENTE_B_69],[NB_ATTENTE_B_70],[NB_ATTENTE_B_71],[NB_ATTENTE_B_72],[NB_ATTENTE_B_73],[NB_ATTENTE_B_74],[NB_ATTENTE_B_75],[NB_ATTENTE_B_76],[NB_ATTENTE_B_77],[NB_ATTENTE_B_78],[NB_ATTENTE_B_79],[NB_ATTENTE_B_80],
at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:834)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-23 08:20:10] [INFO ] Flatten gal took : 28 ms
[2026-05-23 08:20:10] [INFO ] Time to serialize gal into /tmp/UpperBounds9382664636980943767.gal : 9 ms
[2026-05-23 08:20:10] [INFO ] Time to serialize properties into /tmp/UpperBounds13686194774831488267.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/UpperBounds9382664636980943767.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13686194774831488267.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/UpperBounds13686194774831488267.prop.
Detected timeout of ITS tools.
[2026-05-23 08:43:15] [INFO ] Flatten gal took : 428 ms
[2026-05-23 08:43:18] [INFO ] Input system was already deterministic with 1948 transitions.
[2026-05-23 08:43:20] [INFO ] Transformed 184 places.
[2026-05-23 08:43:21] [INFO ] Transformed 1948 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-23 08:43:21] [INFO ] Time to serialize gal into /tmp/UpperBounds16715870742399193189.gal : 38 ms
[2026-05-23 08:43:21] [INFO ] Time to serialize properties into /tmp/UpperBounds3317881759263688891.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/UpperBounds16715870742399193189.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3317881759263688891.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds3317881759263688891.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V80P50N10"
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 BridgeAndVehicles-COL-V80P50N10, 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 r034-tall-177946841800141"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V80P50N10.tgz
mv BridgeAndVehicles-COL-V80P50N10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;