fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r034-tall-177946841700045
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for BridgeAndVehicles-COL-V20P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
729.831 114588.00 156232.00 702.90 1 20 1 20 1 20 1 1 1 20 1 10 20 1 20 20 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r034-tall-177946841700045.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-V20P20N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946841700045
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 9.3K Mar 5 08:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Mar 5 08:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 5 08:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 5 08:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Mar 15 07:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 15 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 5 08:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Mar 5 08:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 5 08:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 5 08:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 07:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:33 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 39K 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-V20P20N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779488781854

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-V20P20N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202604301425
[2026-05-22 22:26:22] [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 22:26:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 22:26:23] [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 22:26:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-22 22:26:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 529 ms
[2026-05-22 22:26:23] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 68 PT places and 19578.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 9
[2026-05-22 22:26:23] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2026-05-22 22:26:23] [INFO ] Skeletonized 9 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-6260901049561606243.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8686166985369345516.kers'
[2026-05-22 22:26:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6260901049561606243.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8686166985369345516.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 22:26:23] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8686166985369345516.kers
Total runtime 1 ms.
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[1, 0, 1, 1, 20, 20, 0, 0, 0] Max Struct:[1, 20, 1, 1, 20, 20, 20, 1, 20]
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-12 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-15 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-09 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-05 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2026-05-22 22:26:23] [INFO ] Invariant cache hit.
[2026-05-22 22:26:23] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-22 22:26:23] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2026-05-22 22:26:23] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-22 22:26:23] [INFO ] Added : 2 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 6 ms.
[2026-05-22 22:26:23] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-22 22:26:23] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-22 22:26:23] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-22 22:26:24] [INFO ] Added : 3 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 5 ms.
[2026-05-22 22:26:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:26:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-22 22:26:24] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-22 22:26:24] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 3 ms.
[2026-05-22 22:26:24] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2026-05-22 22:26:24] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-22 22:26:24] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-22 22:26:24] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-22 22:26:24] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 3 ms.
[2026-05-22 22:26:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:26:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-22 22:26:24] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2026-05-22 22:26:24] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-22 22:26:24] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2026-05-22 22:26:24] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-22 22:26:24] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-22 22:26:24] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-22 22:26:24] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2026-05-22 22:26:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:26:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2026-05-22 22:26:24] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2026-05-22 22:26:24] [INFO ] Computed and/alt/rep : 6/9/6 causal constraints (skipped 0 transitions) in 4 ms.
[2026-05-22 22:26:24] [INFO ] Added : 2 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0] Max Struct:[20, 20, 1, 20]
Arc [1:1*[(MOD (ADD $cA 1) 21)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 21) 21) 21)]] 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 22:26:24] [INFO ] Unfolded HLPN to a Petri net with 68 places and 548 transitions 4070 arcs in 44 ms.
[2026-05-22 22:26:24] [INFO ] Unfolded 4 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0] Max Struct:[20, 20, 1, 20]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[20, 20, 1, 20]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7422163181652144579.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6866428675388221454.kers'
[2026-05-22 22:26:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7422163181652144579.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6866428675388221454.kers]
Normalized transition count is 130 out of 548 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 68 cols 630 entries
Finished phase 1 with 21 SingleSign rule and 40 generalized
[2026-05-22 22:26:24] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6866428675388221454.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[20, 20, 1, 20]
RANDOM walk for 10000 steps (56 resets) in 79 ms. (125 steps per ms)
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-14 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-03 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-01 20 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10000 steps (20 resets) in 28 ms. (344 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[20]
[2026-05-22 22:26:24] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7687789156187676348.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7503102918380408949.kers'
[2026-05-22 22:26:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7687789156187676348.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7503102918380408949.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 68 cols 630 entries
Finished phase 1 with 21 SingleSign rule and 40 generalized
[2026-05-22 22:26:24] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7503102918380408949.kers
Total runtime 1 ms.
[2026-05-22 22:26:24] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-22 22:26:24] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2026-05-22 22:26:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-22 22:26:24] [INFO ] [Real]Added 22 Read/Feed constraints in 10 ms returned sat
[2026-05-22 22:26:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:26:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-22 22:26:24] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2026-05-22 22:26:24] [INFO ] [Nat]Added 22 Read/Feed constraints in 8 ms returned sat
[2026-05-22 22:26:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2026-05-22 22:26:24] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 26 ms.
[2026-05-22 22:26:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2026-05-22 22:26:25] [INFO ] Added : 3 causal constraints over 2 iterations in 176 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[20]
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 562 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 65 transition count 547
Applied a total of 3 rules in 67 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
Running 544 sub problems to find dead transitions.
[2026-05-22 22:26:25] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11337638522242641755.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15980715830554984932.kers'
[2026-05-22 22:26:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11337638522242641755.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15980715830554984932.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 129 rows 64 cols 565 entries
Finished phase 1 with 60 SingleSign rule and 0 generalized
[2026-05-22 22:26:25] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15980715830554984932.kers
Total runtime 1 ms.
[2026-05-22 22:26:25] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 544 unsolved
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/7 constraints. Problems are: Problem set: 40 solved, 504 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 40 solved, 504 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 3 (OVERLAPS) 129/194 variables, 65/72 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 22/94 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/94 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 0/194 variables, 0/94 constraints. Problems are: Problem set: 42 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 94 constraints, problems are : Problem set: 42 solved, 502 unsolved in 16361 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 65/65 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 42 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/7 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 129/194 variables, 65/72 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 22/94 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 502/596 constraints. Problems are: Problem set: 42 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 194/194 variables, and 596 constraints, problems are : Problem set: 42 solved, 502 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 65/65 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 502/544 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37343ms problems are : Problem set: 42 solved, 502 unsolved
Search for dead transitions found 42 dead transitions in 37409ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 42 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 65/68 places, 505/548 transitions.
Applied a total of 0 rules in 22 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37532 ms. Remains : 65/68 places, 505/548 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12839169580878690351.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17555971334850810367.kers'
[2026-05-22 22:27:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12839169580878690351.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17555971334850810367.kers]
Normalized transition count is 125 out of 505 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 125 rows 64 cols 553 entries
Finished phase 1 with 57 SingleSign rule and 1 generalized
[2026-05-22 22:27:02] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17555971334850810367.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[20]
RANDOM walk for 1000000 steps (6488 resets) in 2558 ms. (390 steps per ms)
BEST_FIRST walk for 1000001 steps (2456 resets) in 1002 ms. (997 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2026-05-22 22:27:06] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15618857487692784659.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15925231828715242009.kers'
[2026-05-22 22:27:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15618857487692784659.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15925231828715242009.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 125 rows 64 cols 553 entries
Finished phase 1 with 57 SingleSign rule and 1 generalized
[2026-05-22 22:27:06] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15925231828715242009.kers
Total runtime 1 ms.
[2026-05-22 22:27:06] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-22 22:27:06] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2026-05-22 22:27:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:27:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-22 22:27:06] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2026-05-22 22:27:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-22 22:27:06] [INFO ] [Nat]Added 20 Read/Feed constraints in 13 ms returned sat
[2026-05-22 22:27:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2026-05-22 22:27:06] [INFO ] Computed and/alt/rep : 48/96/48 causal constraints (skipped 74 transitions) in 18 ms.
[2026-05-22 22:27:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2026-05-22 22:27:06] [INFO ] Added : 3 causal constraints over 2 iterations in 150 ms. Result :sat
Minimization took 37 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 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 505/505 transitions.
Applied a total of 0 rules in 19 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 65/65 places, 505/505 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 505/505 transitions.
Applied a total of 0 rules in 16 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2026-05-22 22:27:06] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2026-05-22 22:27:06] [INFO ] Invariant cache hit.
[2026-05-22 22:27:06] [INFO ] Implicit Places using invariants in 128 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 134 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 63/65 places, 505/505 transitions.
Applied a total of 0 rules in 23 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 173 ms. Remains : 63/65 places, 505/505 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2710490447904207771.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13489915788351226286.kers'
[2026-05-22 22:27:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2710490447904207771.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13489915788351226286.kers]
Normalized transition count is 125 out of 505 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 125 rows 62 cols 473 entries
Finished phase 1 with 58 SingleSign rule and 0 generalized
[2026-05-22 22:27:06] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13489915788351226286.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (6487 resets) in 2334 ms. (428 steps per ms)
BEST_FIRST walk for 1000001 steps (2451 resets) in 935 ms. (1068 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2026-05-22 22:27:10] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6603072606923088761.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4121521357553628437.kers'
[2026-05-22 22:27:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6603072606923088761.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4121521357553628437.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 125 rows 62 cols 473 entries
Finished phase 1 with 58 SingleSign rule and 0 generalized
[2026-05-22 22:27:10] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4121521357553628437.kers
Total runtime 3 ms.
[2026-05-22 22:27:10] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-22 22:27:10] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2026-05-22 22:27:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 22:27:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-22 22:27:10] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2026-05-22 22:27:10] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-22 22:27:10] [INFO ] [Nat]Added 20 Read/Feed constraints in 6 ms returned sat
[2026-05-22 22:27:10] [INFO ] Computed and/alt/rep : 48/96/48 causal constraints (skipped 74 transitions) in 20 ms.
[2026-05-22 22:27:10] [INFO ] Added : 12 causal constraints over 10 iterations in 123 ms. Result :sat
Minimization took 37 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 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 14 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 63/63 places, 505/505 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 17 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2026-05-22 22:27:10] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2026-05-22 22:27:10] [INFO ] Invariant cache hit.
[2026-05-22 22:27:10] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-22 22:27:10] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2026-05-22 22:27:10] [INFO ] Invariant cache hit.
[2026-05-22 22:27:10] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-22 22:27:10] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2026-05-22 22:27:10] [INFO ] Redundant transitions in 32 ms returned []
Running 502 sub problems to find dead transitions.
[2026-05-22 22:27:10] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2026-05-22 22:27:10] [INFO ] Invariant cache hit.
[2026-05-22 22:27:10] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 89 constraints, problems are : Problem set: 0 solved, 502 unsolved in 14443 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 125/188 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 502/591 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 188/188 variables, and 591 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44892ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 44895ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45240 ms. Remains : 63/63 places, 505/505 transitions.
RANDOM walk for 40000 steps (256 resets) in 700 ms. (57 steps per ms) remains 2/2 properties
[2026-05-22 22:27:56] [INFO ] Flatten gal took : 178 ms
BEST_FIRST walk for 40003 steps (95 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (96 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
[2026-05-22 22:27:56] [INFO ] Flatten gal took : 89 ms
[2026-05-22 22:27:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14673349493442844785.gal : 45 ms
[2026-05-22 22:27:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7003087459518739906.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/ReachabilityCardinality14673349493442844785.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7003087459518739906.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/ReachabilityCardinality7003087459518739906.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 20
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :20 after 42
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :42 after 90
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :90 after 163
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1032 after 1037
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1037 after 1098
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1098 after 1218
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1218 after 1570
Interrupted probabilistic random walk after 616587 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :0 out of 2
Probabilistic random walk after 616587 steps, saw 153786 distinct states, run finished after 3004 ms. (steps per millisecond=205 ) properties seen :0
[2026-05-22 22:27:59] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2026-05-22 22:27:59] [INFO ] Invariant cache hit.
[2026-05-22 22:27: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) 21/23 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 65/88 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/92 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/146 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/146 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/146 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 41/187 variables, 21/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/187 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/188 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/188 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/188 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 90 constraints, problems are : Problem set: 0 solved, 2 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 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) 21/23 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 65/88 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/92 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 54/146 variables, 16/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/146 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/146 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 41/187 variables, 21/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/187 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/187 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/188 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/188 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/188 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 92 constraints, problems are : Problem set: 0 solved, 2 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 710ms problems are : Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :11934 after 12282
Parikh walk visited 0 properties in 102 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 12 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 63/63 places, 505/505 transitions.
RANDOM walk for 40000 steps (256 resets) in 262 ms. (152 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (96 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (97 resets) in 230 ms. (173 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 648718 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :0 out of 2
Probabilistic random walk after 648718 steps, saw 161449 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
[2026-05-22 22:28:03] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2026-05-22 22:28:03] [INFO ] Invariant cache hit.
[2026-05-22 22:28:03] [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) 21/23 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 65/88 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/92 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/146 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/146 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/146 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 41/187 variables, 21/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/187 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/187 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/188 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/188 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/188 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 90 constraints, problems are : Problem set: 0 solved, 2 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 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) 21/23 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 65/88 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/92 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 54/146 variables, 16/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/146 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/146 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 41/187 variables, 21/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/187 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/187 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/187 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/188 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/188 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/188 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 92 constraints, problems are : Problem set: 0 solved, 2 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 63/63 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 654ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 75 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 13 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 63/63 places, 505/505 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 505/505 transitions.
Applied a total of 0 rules in 11 ms. Remains 63 /63 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2026-05-22 22:28:04] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2026-05-22 22:28:04] [INFO ] Invariant cache hit.
[2026-05-22 22:28:04] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-22 22:28:04] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2026-05-22 22:28:04] [INFO ] Invariant cache hit.
[2026-05-22 22:28:04] [INFO ] State equation strengthened by 20 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :30603 after 35468
[2026-05-22 22:28:04] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2026-05-22 22:28:04] [INFO ] Redundant transitions in 10 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 319 ms. Remains : 63/63 places, 505/505 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 380 transitions
Reduce isomorphic transitions removed 380 transitions.
Iterating post reduction 0 with 380 rules applied. Total rules applied 380 place count 63 transition count 125
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 384 place count 61 transition count 123
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 386 place count 61 transition count 121
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 388 place count 59 transition count 121
Applied a total of 388 rules in 14 ms. Remains 59 /63 variables (removed 4) and now considering 121/505 (removed 384) 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-15989114310710243886.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9400481528302178445.kers'
[2026-05-22 22:28:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15989114310710243886.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9400481528302178445.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 121 rows 58 cols 461 entries
Finished phase 1 with 54 SingleSign rule and 0 generalized
[2026-05-22 22:28:04] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9400481528302178445.kers
Total runtime 1 ms.
[2026-05-22 22:28:04] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-22 22:28:04] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-22 22:28:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-22 22:28:04] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-22 22:28:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 22:28:04] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-22 22:28:04] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-22 22:28:04] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-22 22:28:04] [INFO ] Flatten gal took : 11 ms
[2026-05-22 22:28:04] [INFO ] Flatten gal took : 8 ms
[2026-05-22 22:28:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16526949950513400500.gal : 4 ms
[2026-05-22 22:28:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12319139944777916315.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/ReachabilityCardinality16526949950513400500.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12319139944777916315.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality12319139944777916315.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 10
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :10 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 50
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :50 after 145
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :145 after 546
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :546 after 3494
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :26298 after 27248
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :365638 after 392771
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.24436e+07,0.298229,15124,2,5576,17,37959,8,0,361,32495,0
Total reachable state count : 12443600

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,7864,0.299008,15260,2,826,17,37959,8,0,363,32495,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,7864,0.299632,15388,2,826,17,37959,8,0,364,32495,0
Over-approximation ignoring read arcs solved 0 properties in 556 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 22:28:04] [INFO ] Flatten gal took : 33 ms
[2026-05-22 22:28:04] [INFO ] Applying decomposition
[2026-05-22 22:28:05] [INFO ] Flatten gal took : 39 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/graph14501508335675596506.txt' '-o' '/tmp/graph14501508335675596506.bin' '-w' '/tmp/graph14501508335675596506.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14501508335675596506.bin' '-l' '-1' '-v' '-w' '/tmp/graph14501508335675596506.weights' '-q' '0' '-e' '0.001'
[2026-05-22 22:28:05] [INFO ] Decomposing Gal with order
[2026-05-22 22:28:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 22:28:05] [INFO ] Removed a total of 1198 redundant transitions.
[2026-05-22 22:28:05] [INFO ] Flatten gal took : 155 ms
[2026-05-22 22:28:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 199 labels/synchronizations in 11 ms.
[2026-05-22 22:28:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality841074275894580598.gal : 4 ms
[2026-05-22 22:28:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13613227014445685466.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/ReachabilityCardinality841074275894580598.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13613227014445685466.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/ReachabilityCardinality13613227014445685466.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 11
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :11 after 20
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1742 after 1902
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1902 after 2562
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :6802 after 7740
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :23006 after 26766
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :151717 after 158989
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.59298e+06 after 1.61951e+06
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,4.05339e+06,8.55979,215372,1137,2792,282783,132969,160,616091,197,1.33746e+06,0
Total reachable state count : 4053390

Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

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,0,8.56042,215372,1,0,282783,132969,160,616091,198,1.33746e+06,0
Invariant property MIN0 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
MIN0,0,8.56088,215372,1,0,282783,132969,163,616091,199,1.33746e+06,0
FORMULA BridgeAndVehicles-COL-V20P20N10-UpperBounds-11 10 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16361763316590449816.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9408641395708582793.kers'
[2026-05-22 22:28:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16361763316590449816.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9408641395708582793.kers]
Normalized transition count is 125 out of 505 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 125 rows 62 cols 473 entries
Finished phase 1 with 58 SingleSign rule and 0 generalized
[2026-05-22 22:28:13] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9408641395708582793.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (6488 resets) in 2415 ms. (413 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 113404 ms.

BK_STOP 1779488896442

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

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

Sequence of Actions to be Executed by the VM

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

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

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P20N10.tgz
mv BridgeAndVehicles-COL-V20P20N10 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 ;