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-177946841700069.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-V50P20N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946841700069
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 7.7K Mar 5 08:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 5 08:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 5 08:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Mar 5 08:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K Mar 15 07:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 15 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 15 07:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Mar 5 08:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 193K Mar 5 08:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 5 08:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Mar 5 08:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 07:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:34 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 42K 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-V50P20N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779494140767

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-V50P20N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202604301425
[2026-05-22 23:55:41] [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-22 23:55:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 23:55:42] [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-22 23:55:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-22 23:55:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 552 ms
[2026-05-22 23:55:42] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 128 PT places and 114798.0 transition bindings in 18 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 10
[2026-05-22 23:55:42] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2026-05-22 23:55:42] [INFO ] Skeletonized 10 HLPN properties in 0 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-14855347578896407740.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2946395501077277348.kers'
[2026-05-22 23:55:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14855347578896407740.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2946395501077277348.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-22 23:55:42] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2946395501077277348.kers
Total runtime 1 ms.
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 1, 0, 1, 0, 0, 1, 0, 20] Max Struct:[20, 1, 1, 50, 1, 50, 50, 1, 1, 20]
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-12 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2026-05-22 23:55:42] [INFO ] Invariant cache hit.
[2026-05-22 23:55:42] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2026-05-22 23:55:42] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-22 23:55:42] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-22 23:55:42] [INFO ] Added : 2 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 7 ms.
[2026-05-22 23:55:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:55:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-22 23:55:42] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2026-05-22 23:55:42] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-22 23:55:42] [INFO ] Added : 2 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 5 ms.
[2026-05-22 23:55:42] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-22 23:55:42] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-22 23:55:42] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-22 23:55:43] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2026-05-22 23:55:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:55:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-22 23:55:43] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2026-05-22 23:55:43] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-22 23:55:43] [INFO ] Added : 2 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 11 ms.
[2026-05-22 23:55:43] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-22 23:55:43] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-22 23:55:43] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-22 23:55:43] [INFO ] Added : 2 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 4 ms.
[2026-05-22 23:55:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-22 23:55:43] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-22 23:55:43] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-22 23:55:43] [INFO ] Added : 4 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2026-05-22 23:55:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:55:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-22 23:55:43] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-22 23:55:43] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-22 23:55:43] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2026-05-22 23:55:43] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-22 23:55:43] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-22 23:55:43] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-22 23:55:43] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2026-05-22 23:55:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:55:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-22 23:55:43] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-22 23:55:43] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-22 23:55:43] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2026-05-22 23:55:43] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-22 23:55:43] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-22 23:55:43] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-22 23:55:43] [INFO ] Added : 2 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 7 ms.
[2026-05-22 23:55:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:55:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-22 23:55:43] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-22 23:55:43] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-22 23:55:43] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[20, 1, 50, 50, 50, 1]
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] 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-22 23:55:43] [INFO ] Unfolded HLPN to a Petri net with 128 places and 1328 transitions 10010 arcs in 79 ms.
[2026-05-22 23:55:43] [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:[20, 1, 50, 50, 50, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[20, 1, 50, 50, 50, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11605704489805525510.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1931856568993847668.kers'
[2026-05-22 23:55:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11605704489805525510.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1931856568993847668.kers]
Normalized transition count is 250 out of 1328 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 250 rows 128 cols 1290 entries
Finished phase 1 with 21 SingleSign rule and 100 generalized
[2026-05-22 23:55:43] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1931856568993847668.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[20, 1, 50, 50, 50, 1]
RANDOM walk for 10000 steps (22 resets) in 181 ms. (54 steps per ms)
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-09 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-03 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-06 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (17 resets) in 97 ms. (204 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2026-05-22 23:55:43] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17551822617288957211.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9221615343973390099.kers'
[2026-05-22 23:55:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17551822617288957211.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9221615343973390099.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 250 rows 128 cols 1290 entries
Finished phase 1 with 21 SingleSign rule and 100 generalized
[2026-05-22 23:55:43] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-9221615343973390099.kers
Total runtime 6 ms.
[2026-05-22 23:55:43] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-22 23:55:43] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2026-05-22 23:55:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-22 23:55:43] [INFO ] [Real]Added 22 Read/Feed constraints in 15 ms returned sat
[2026-05-22 23:55:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:55:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-22 23:55:44] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2026-05-22 23:55:44] [INFO ] [Nat]Added 22 Read/Feed constraints in 24 ms returned sat
[2026-05-22 23:55:44] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 62 ms.
[2026-05-22 23:55:44] [INFO ] Added : 10 causal constraints over 2 iterations in 401 ms. Result :sat
Minimization took 113 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 1222 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output 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 3 place count 125 transition count 1327
Applied a total of 3 rules in 202 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
Running 1324 sub problems to find dead transitions.
[2026-05-22 23:55:45] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12667577664936268479.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10889908800605707575.kers'
[2026-05-22 23:55:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12667577664936268479.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10889908800605707575.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 249 rows 124 cols 1135 entries
Finished phase 1 with 120 SingleSign rule and 0 generalized
[2026-05-22 23:55:45] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10889908800605707575.kers
Total runtime 1 ms.
[2026-05-22 23:55:45] [INFO ] State equation strengthened by 22 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1324 unsolved
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 2/7 constraints. Problems are: Problem set: 100 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/374 variables, and 7 constraints, problems are : Problem set: 100 solved, 1224 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1324/1123 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 100 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 2/7 constraints. Problems are: Problem set: 100 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 100 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD104 is UNSAT
At refinement iteration 3 (OVERLAPS) 249/374 variables, 125/132 constraints. Problems are: Problem set: 102 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 22/154 constraints. Problems are: Problem set: 102 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 1275 constraints, problems are : Problem set: 102 solved, 1222 unsolved in 21429 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1222/1123 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43911ms problems are : Problem set: 102 solved, 1222 unsolved
Search for dead transitions found 102 dead transitions in 43936ms
Found 102 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 102 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 125/128 places, 1225/1328 transitions.
Applied a total of 0 rules in 66 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44238 ms. Remains : 125/128 places, 1225/1328 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16052289014022102206.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7094799239646533002.kers'
[2026-05-22 23:56:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16052289014022102206.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7094799239646533002.kers]
Normalized transition count is 245 out of 1225 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 245 rows 124 cols 1123 entries
Finished phase 1 with 117 SingleSign rule and 1 generalized
[2026-05-22 23:56:29] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7094799239646533002.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (2622 resets) in 5519 ms. (181 steps per ms)
BEST_FIRST walk for 1000001 steps (1085 resets) in 2250 ms. (444 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2026-05-22 23:56:36] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2477001329854918036.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1683227498924569721.kers'
[2026-05-22 23:56:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2477001329854918036.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1683227498924569721.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 245 rows 124 cols 1123 entries
Finished phase 1 with 117 SingleSign rule and 1 generalized
[2026-05-22 23:56:36] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1683227498924569721.kers
Total runtime 1 ms.
[2026-05-22 23:56:36] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-22 23:56:36] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2026-05-22 23:56:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-22 23:56:36] [INFO ] [Real]Added 20 Read/Feed constraints in 17 ms returned sat
[2026-05-22 23:56:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:56:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-22 23:56:37] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2026-05-22 23:56:37] [INFO ] [Nat]Added 20 Read/Feed constraints in 17 ms returned sat
[2026-05-22 23:56:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2026-05-22 23:56:37] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 37 ms.
[2026-05-22 23:56:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2026-05-22 23:56:37] [INFO ] Added : 11 causal constraints over 3 iterations in 399 ms. Result :sat
Minimization took 166 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1225/1225 transitions.
Applied a total of 0 rules in 51 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 125/125 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1225/1225 transitions.
Applied a total of 0 rules in 81 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2026-05-22 23:56:38] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-22 23:56:38] [INFO ] Invariant cache hit.
[2026-05-22 23:56:38] [INFO ] Implicit Places using invariants in 306 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 312 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/125 places, 1225/1225 transitions.
Applied a total of 0 rules in 55 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 448 ms. Remains : 123/125 places, 1225/1225 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6235062722764490152.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17016863225225105891.kers'
[2026-05-22 23:56:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6235062722764490152.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17016863225225105891.kers]
Normalized transition count is 245 out of 1225 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 245 rows 122 cols 923 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-22 23:56:38] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17016863225225105891.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (2622 resets) in 4839 ms. (206 steps per ms)
BEST_FIRST walk for 1000001 steps (1088 resets) in 2022 ms. (494 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2026-05-22 23:56:45] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12207145742473492168.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16246248974861729446.kers'
[2026-05-22 23:56:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12207145742473492168.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16246248974861729446.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 245 rows 122 cols 923 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-22 23:56:45] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16246248974861729446.kers
Total runtime 4 ms.
[2026-05-22 23:56:45] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-22 23:56:45] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2026-05-22 23:56:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:56:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-22 23:56:45] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2026-05-22 23:56:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-22 23:56:45] [INFO ] [Nat]Added 20 Read/Feed constraints in 18 ms returned sat
[2026-05-22 23:56:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2026-05-22 23:56:45] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 22 ms.
[2026-05-22 23:56:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2026-05-22 23:56:46] [INFO ] Added : 10 causal constraints over 2 iterations in 311 ms. Result :sat
Minimization took 150 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 50 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 50 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2026-05-22 23:56:46] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-22 23:56:46] [INFO ] Invariant cache hit.
[2026-05-22 23:56:46] [INFO ] Implicit Places using invariants in 247 ms returned []
[2026-05-22 23:56:46] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-22 23:56:46] [INFO ] Invariant cache hit.
[2026-05-22 23:56:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-22 23:56:47] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1051 ms to find 0 implicit places.
[2026-05-22 23:56:47] [INFO ] Redundant transitions in 67 ms returned []
Running 1222 sub problems to find dead transitions.
[2026-05-22 23:56:47] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-22 23:56:47] [INFO ] Invariant cache hit.
[2026-05-22 23:56:47] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1221 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1221/1370 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1370 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1221 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62098ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 62101ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63284 ms. Remains : 123/123 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (104 resets) in 713 ms. (56 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (40 resets) in 269 ms. (148 steps per ms) remains 2/2 properties
[2026-05-22 23:57:50] [INFO ] Flatten gal took : 172 ms
BEST_FIRST walk for 40010 steps (42 resets) in 241 ms. (165 steps per ms) remains 2/2 properties
[2026-05-22 23:57:50] [INFO ] Flatten gal took : 162 ms
[2026-05-22 23:57:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8431476755730401198.gal : 60 ms
[2026-05-22 23:57:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6172526244107700276.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/ReachabilityCardinality8431476755730401198.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6172526244107700276.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/ReachabilityCardinality6172526244107700276.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
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :233 after 566
Interrupted probabilistic random walk after 378485 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 2
Probabilistic random walk after 378485 steps, saw 104970 distinct states, run finished after 3006 ms. (steps per millisecond=125 ) properties seen :0
[2026-05-22 23:57:53] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-22 23:57:53] [INFO ] Invariant cache hit.
[2026-05-22 23:57:53] [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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 84/266 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 101/367 variables, 51/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/368 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 676 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 256
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :566 after 1013
At refinement iteration 12 (OVERLAPS) 84/266 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 101/367 variables, 51/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/367 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/368 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1754 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2440ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 135 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 48 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 123/123 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (104 resets) in 368 ms. (108 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (42 resets) in 232 ms. (171 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (42 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 410271 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 2
Probabilistic random walk after 410271 steps, saw 113493 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
[2026-05-22 23:57:59] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-22 23:57:59] [INFO ] Invariant cache hit.
[2026-05-22 23:57:59] [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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 84/266 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1013 after 3956
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 101/367 variables, 51/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/368 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 619 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 84/266 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 101/367 variables, 51/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/367 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/368 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1750 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2386ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 118 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 48 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 48 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2026-05-22 23:58:01] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-22 23:58:01] [INFO ] Invariant cache hit.
[2026-05-22 23:58:01] [INFO ] Implicit Places using invariants in 220 ms returned []
[2026-05-22 23:58:01] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-22 23:58:01] [INFO ] Invariant cache hit.
[2026-05-22 23:58:02] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-22 23:58:02] [INFO ] Implicit Places using invariants and state equation in 743 ms returned []
Implicit Place search using SMT with State Equation took 966 ms to find 0 implicit places.
[2026-05-22 23:58:02] [INFO ] Redundant transitions in 51 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1077 ms. Remains : 123/123 places, 1225/1225 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 980 transitions
Reduce isomorphic transitions removed 980 transitions.
Iterating post reduction 0 with 980 rules applied. Total rules applied 980 place count 123 transition count 245
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 984 place count 121 transition count 243
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 986 place count 121 transition count 241
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 988 place count 119 transition count 241
Applied a total of 988 rules in 15 ms. Remains 119 /123 variables (removed 4) and now considering 241/1225 (removed 984) 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-10984578849992751078.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16618028218113547763.kers'
[2026-05-22 23:58:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10984578849992751078.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16618028218113547763.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 3 ms.
// Phase 1: matrix 241 rows 118 cols 911 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-22 23:58:02] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16618028218113547763.kers
Total runtime 4 ms.
[2026-05-22 23:58:02] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-22 23:58:02] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-22 23:58:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-22 23:58:03] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-22 23:58:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 23:58:03] [INFO ] After 53ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-22 23:58:03] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-22 23:58:03] [INFO ] After 283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-22 23:58:03] [INFO ] Flatten gal took : 12 ms
[2026-05-22 23:58:03] [INFO ] Flatten gal took : 10 ms
[2026-05-22 23:58:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11564922439640968616.gal : 3 ms
[2026-05-22 23:58:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9103578480242906826.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/ReachabilityCardinality11564922439640968616.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9103578480242906826.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/ReachabilityCardinality9103578480242906826.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 190
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :190 after 196
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :196 after 215
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :215 after 417
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :417 after 608
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :608 after 2718
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2718 after 3831
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3831 after 7037
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :51358 after 75974
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,9.15214e+08,2.76817,85916,2,21609,19,221243,8,0,721,216232,0
Total reachable state count : 915214160

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,50854,2.77059,85916,2,3766,19,221243,8,0,723,216232,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,50854,2.7724,85916,2,3766,19,221243,8,0,723,216232,0
Over-approximation ignoring read arcs solved 0 properties in 3275 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 23:58:06] [INFO ] Flatten gal took : 37 ms
[2026-05-22 23:58:06] [INFO ] Applying decomposition
[2026-05-22 23:58:06] [INFO ] Flatten gal took : 35 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/graph1503053736889212791.txt' '-o' '/tmp/graph1503053736889212791.bin' '-w' '/tmp/graph1503053736889212791.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1503053736889212791.bin' '-l' '-1' '-v' '-w' '/tmp/graph1503053736889212791.weights' '-q' '0' '-e' '0.001'
[2026-05-22 23:58:06] [INFO ] Decomposing Gal with order
[2026-05-22 23:58:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 23:58:06] [INFO ] Removed a total of 2636 redundant transitions.
[2026-05-22 23:58:06] [INFO ] Flatten gal took : 382 ms
[2026-05-22 23:58:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 332 labels/synchronizations in 23 ms.
[2026-05-22 23:58:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13626688279220216884.gal : 3 ms
[2026-05-22 23:58:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality255073893520901399.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/ReachabilityCardinality13626688279220216884.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality255073893520901399.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/ReachabilityCardinality255073893520901399.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 32
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :32 after 48
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :48 after 57
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :57 after 74
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :74 after 112
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :112 after 566
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :566 after 10764
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :10764 after 20647
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :20647 after 65992
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :65992 after 128053
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :128053 after 262303
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3.85694e+06 after 5.19536e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.81162e+07 after 2.83592e+07
Detected timeout of ITS tools.
Starting property specific reduction for BridgeAndVehicles-COL-V50P20N10-UpperBounds-00
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:[20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[20]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7583512113435246699.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17679142446443627367.kers'
[2026-05-22 23:58:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7583512113435246699.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17679142446443627367.kers]
Normalized transition count is 245 out of 1225 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 245 rows 122 cols 923 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-22 23:58:56] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17679142446443627367.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[20]
RANDOM walk for 10000 steps (26 resets) in 58 ms. (169 steps per ms)
BEST_FIRST walk for 10000 steps (10 resets) in 21 ms. (454 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2026-05-22 23:58:57] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11351657955767858141.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17661076317106756277.kers'
[2026-05-22 23:58:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11351657955767858141.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17661076317106756277.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 245 rows 122 cols 923 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-22 23:58:57] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17661076317106756277.kers
Total runtime 5 ms.
[2026-05-22 23:58:57] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2026-05-22 23:58:57] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2026-05-22 23:58:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:58:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-22 23:58:57] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2026-05-22 23:58:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-22 23:58:57] [INFO ] [Nat]Added 20 Read/Feed constraints in 29 ms returned sat
[2026-05-22 23:58:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2026-05-22 23:58:57] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 37 ms.
[2026-05-22 23:58:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2026-05-22 23:58:58] [INFO ] Added : 10 causal constraints over 2 iterations in 385 ms. Result :sat
Minimization took 152 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 51 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 123/123 places, 1225/1225 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12773753032513872455.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3983148015709641165.kers'
[2026-05-22 23:58:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12773753032513872455.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3983148015709641165.kers]
Normalized transition count is 245 out of 1225 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 245 rows 122 cols 923 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-22 23:58:58] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3983148015709641165.kers
Total runtime 4 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (2622 resets) in 4997 ms. (200 steps per ms)
BEST_FIRST walk for 1000001 steps (1085 resets) in 2074 ms. (481 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2026-05-22 23:59:05] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17035752451225836854.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18025823412648453029.kers'
[2026-05-22 23:59:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17035752451225836854.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18025823412648453029.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 245 rows 122 cols 923 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-22 23:59:05] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18025823412648453029.kers
Total runtime 2 ms.
[2026-05-22 23:59:05] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-22 23:59:05] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2026-05-22 23:59:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 23:59:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-22 23:59:05] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2026-05-22 23:59:05] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-22 23:59:05] [INFO ] [Nat]Added 20 Read/Feed constraints in 24 ms returned sat
[2026-05-22 23:59:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2026-05-22 23:59:06] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 40 ms.
[2026-05-22 23:59:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2026-05-22 23:59:06] [INFO ] Added : 10 causal constraints over 2 iterations in 307 ms. Result :sat
Minimization took 156 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 62 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 67 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2026-05-22 23:59:06] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-22 23:59:06] [INFO ] Invariant cache hit.
[2026-05-22 23:59:07] [INFO ] Implicit Places using invariants in 230 ms returned []
[2026-05-22 23:59:07] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-22 23:59:07] [INFO ] Invariant cache hit.
[2026-05-22 23:59:07] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-22 23:59:07] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
[2026-05-22 23:59:07] [INFO ] Redundant transitions in 28 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1114 ms. Remains : 123/123 places, 1225/1225 transitions.
[2026-05-22 23:59:08] [INFO ] Flatten gal took : 42 ms
[2026-05-22 23:59:08] [INFO ] Flatten gal took : 58 ms
[2026-05-22 23:59:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13242647919201114571.gal : 18 ms
[2026-05-22 23:59:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13491652433995369836.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/ReachabilityCardinality13242647919201114571.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13491652433995369836.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 (104 resets) in 567 ms. (70 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (40 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40017 steps (40 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality13491652433995369836.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
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :233 after 566
Interrupted probabilistic random walk after 378516 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 2
Probabilistic random walk after 378516 steps, saw 104976 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
[2026-05-22 23:59:11] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-22 23:59:11] [INFO ] Invariant cache hit.
[2026-05-22 23:59:11] [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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 84/266 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 101/367 variables, 51/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/368 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :566 after 1013
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 84/266 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 101/367 variables, 51/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/367 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/368 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1730 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2504ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 182 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 70 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 123/123 places, 1225/1225 transitions.
RANDOM walk for 40000 steps (104 resets) in 417 ms. (95 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (40 resets) in 196 ms. (203 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (41 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1013 after 3956
Interrupted probabilistic random walk after 389739 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 2
Probabilistic random walk after 389739 steps, saw 107993 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
[2026-05-22 23:59:17] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-22 23:59:17] [INFO ] Invariant cache hit.
[2026-05-22 23:59:17] [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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/182 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 84/266 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 101/367 variables, 51/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/368 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 673 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 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) 51/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 125/178 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/182 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 84/266 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/266 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 101/367 variables, 51/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/367 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/368 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/368 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1747 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2428ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 147 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 64 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 49 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2026-05-22 23:59:19] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-22 23:59:19] [INFO ] Invariant cache hit.
[2026-05-22 23:59:20] [INFO ] Implicit Places using invariants in 227 ms returned []
[2026-05-22 23:59:20] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-22 23:59:20] [INFO ] Invariant cache hit.
[2026-05-22 23:59:20] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-22 23:59:20] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 999 ms to find 0 implicit places.
[2026-05-22 23:59:20] [INFO ] Redundant transitions in 16 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1070 ms. Remains : 123/123 places, 1225/1225 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 980 transitions
Reduce isomorphic transitions removed 980 transitions.
Iterating post reduction 0 with 980 rules applied. Total rules applied 980 place count 123 transition count 245
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 984 place count 121 transition count 243
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 986 place count 121 transition count 241
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 988 place count 119 transition count 241
Applied a total of 988 rules in 12 ms. Remains 119 /123 variables (removed 4) and now considering 241/1225 (removed 984) 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-3004509606371600047.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6698618768339435215.kers'
[2026-05-22 23:59:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3004509606371600047.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6698618768339435215.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 241 rows 118 cols 911 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-22 23:59:21] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6698618768339435215.kers
Total runtime 1 ms.
[2026-05-22 23:59:21] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-22 23:59:21] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-22 23:59:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-22 23:59:21] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-22 23:59:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 23:59:21] [INFO ] After 48ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-22 23:59:21] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-22 23:59:21] [INFO ] After 267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-22 23:59:21] [INFO ] Flatten gal took : 9 ms
[2026-05-22 23:59:21] [INFO ] Flatten gal took : 7 ms
[2026-05-22 23:59:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14820867545153869945.gal : 1 ms
[2026-05-22 23:59:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2744014786551028965.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/ReachabilityCardinality14820867545153869945.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2744014786551028965.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/ReachabilityCardinality2744014786551028965.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 190
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :190 after 196
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :196 after 215
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :215 after 417
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :417 after 608
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :608 after 2718
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2718 after 3831
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3831 after 7037
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :51358 after 75974
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,9.15214e+08,2.73017,86032,2,21609,19,221243,8,0,721,216232,0
Total reachable state count : 915214160

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,50854,2.73253,86032,2,3766,19,221243,8,0,723,216232,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,50854,2.73429,86032,2,3766,19,221243,8,0,723,216232,0
Over-approximation ignoring read arcs solved 0 properties in 3202 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 23:59:24] [INFO ] Flatten gal took : 22 ms
[2026-05-22 23:59:24] [INFO ] Applying decomposition
[2026-05-22 23:59:24] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3498550418542303427.txt' '-o' '/tmp/graph3498550418542303427.bin' '-w' '/tmp/graph3498550418542303427.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3498550418542303427.bin' '-l' '-1' '-v' '-w' '/tmp/graph3498550418542303427.weights' '-q' '0' '-e' '0.001'
[2026-05-22 23:59:24] [INFO ] Decomposing Gal with order
[2026-05-22 23:59:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 23:59:24] [INFO ] Removed a total of 2633 redundant transitions.
[2026-05-22 23:59:24] [INFO ] Flatten gal took : 145 ms
[2026-05-22 23:59:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 335 labels/synchronizations in 17 ms.
[2026-05-22 23:59:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3320949901984174823.gal : 2 ms
[2026-05-22 23:59:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3862501524613872755.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/ReachabilityCardinality3320949901984174823.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3862501524613872755.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/ReachabilityCardinality3862501524613872755.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 24
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :24 after 49
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :49 after 94
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :94 after 179
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :179 after 344
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :344 after 545
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :545 after 8150
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :8150 after 36096
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :36096 after 76083
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :76083 after 137404
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :261713 after 437265
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4.40611e+06 after 5.84e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3.48743e+07 after 3.82328e+07
Detected timeout of ITS tools.
Ending property specific reduction for BridgeAndVehicles-COL-V50P20N10-UpperBounds-00 in 77760 ms.
[2026-05-23 00:00:14] [INFO ] Flatten gal took : 25 ms
[2026-05-23 00:00:14] [INFO ] Applying decomposition
[2026-05-23 00:00:14] [INFO ] Flatten gal took : 19 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/graph15937853390594541766.txt' '-o' '/tmp/graph15937853390594541766.bin' '-w' '/tmp/graph15937853390594541766.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15937853390594541766.bin' '-l' '-1' '-v' '-w' '/tmp/graph15937853390594541766.weights' '-q' '0' '-e' '0.001'
[2026-05-23 00:00:14] [INFO ] Decomposing Gal with order
[2026-05-23 00:00:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 00:00:15] [INFO ] Removed a total of 2134 redundant transitions.
[2026-05-23 00:00:15] [INFO ] Flatten gal took : 185 ms
[2026-05-23 00:00:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 285 labels/synchronizations in 11 ms.
[2026-05-23 00:00:15] [INFO ] Time to serialize gal into /tmp/UpperBounds1522851248392413095.gal : 1 ms
[2026-05-23 00:00:15] [INFO ] Time to serialize properties into /tmp/UpperBounds5319322011857790440.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/UpperBounds1522851248392413095.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5319322011857790440.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/UpperBounds5319322011857790440.prop.
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\_mod\_flat,2.04953e+08,674.611,3429280,982,28698,254205,3.42158e+06,103,2.11914e+06,413,5.64893e+07,0
Total reachable state count : 204953172

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property BridgeAndVehicles-COL-V50P20N10-UpperBounds-00 :0 <= u0.SUR_PONT_A <= 10
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-15 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-UpperBounds-00 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-COL-V50P20N10-UpperBounds-00,0,675.708,3429280,1,0,254205,3.42158e+06,130,2.11914e+06,483,5.64893e+07,128
Total runtime 950448 ms.

BK_STOP 1779495092407

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V50P20N10"
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-V50P20N10, 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-177946841700069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V50P20N10.tgz
mv BridgeAndVehicles-COL-V50P20N10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;