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.r130-smll-177955808900021.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 FamilyReunion-COL-L00050M0005C002P002G001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955808900021
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 5.8K Mar 6 05:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 6 05:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 6 05:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 6 05:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 15 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Mar 6 05:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Mar 6 05:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 6 05:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 05:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 10:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 24 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 137K 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 FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-00
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-01
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-02
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-03
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-04
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-05
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-06
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-07
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-08
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-09
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-10
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-11
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-12
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-13
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-14
FORMULA_NAME FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779630213290

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L00050M0005C002P002G001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202604301425
[2026-05-24 13:43:35] [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-24 13:43:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 13:43:35] [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-24 13:43:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-24 13:43:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1436 ms
[2026-05-24 13:43:37] [INFO ] Detected 5 constant HL places corresponding to 17 PT places.
[2026-05-24 13:43:37] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 12245 PT places and 10611.0 transition bindings in 56 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
[2026-05-24 13:43:37] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 9 ms.
[2026-05-24 13:43:37] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 5 places and 0 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12399882411472268514.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-128205420578583831.kers'
[2026-05-24 13:43:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12399882411472268514.kers, --Pflows, --basisKERS=/tmp/petrispot-output-128205420578583831.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 66 rows 99 cols 188 entries
Finished phase 1 with 45 SingleSign rule and 21 generalized
[2026-05-24 13:43:37] [INFO ] Computed 33 invariants in 0 ms
Computed 33 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-128205420578583831.kers
Total runtime 2 ms.
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[51, 2, 51, 51, 106, 2, 106, 2, 255, 51, 51, 51, 106, 106, 51, 51]
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2026-05-24 13:43:37] [INFO ] Invariant cache hit.
[2026-05-24 13:43:38] [INFO ] [Real]Absence check using 8 positive place invariants in 17 ms returned sat
[2026-05-24 13:43:38] [INFO ] [Real]Absence check using 8 positive and 25 generalized place invariants in 22 ms returned sat
[2026-05-24 13:43:38] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2026-05-24 13:43:38] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 19 ms.
[2026-05-24 13:43:38] [INFO ] Added : 32 causal constraints over 7 iterations in 158 ms. Result :sat
Minimization took 40 ms.
[2026-05-24 13:43:38] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2026-05-24 13:43:38] [INFO ] [Real]Absence check using 8 positive and 25 generalized place invariants in 21 ms returned sat
[2026-05-24 13:43:38] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2026-05-24 13:43:38] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 25 ms.
[2026-05-24 13:43:38] [INFO ] Added : 32 causal constraints over 7 iterations in 136 ms. Result :sat
Minimization took 36 ms.
[2026-05-24 13:43:38] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-24 13:43:38] [INFO ] [Real]Absence check using 8 positive and 25 generalized place invariants in 9 ms returned sat
[2026-05-24 13:43:38] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2026-05-24 13:43:38] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-24 13:43:39] [INFO ] Added : 32 causal constraints over 7 iterations in 122 ms. Result :sat
Minimization took 37 ms.
[2026-05-24 13:43:39] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-24 13:43:39] [INFO ] [Real]Absence check using 8 positive and 25 generalized place invariants in 11 ms returned sat
[2026-05-24 13:43:39] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2026-05-24 13:43:39] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-24 13:43:39] [INFO ] Added : 38 causal constraints over 8 iterations in 109 ms. Result :sat
Minimization took 23 ms.
[2026-05-24 13:43:39] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-24 13:43:39] [INFO ] [Real]Absence check using 8 positive and 25 generalized place invariants in 9 ms returned sat
[2026-05-24 13:43:39] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2026-05-24 13:43:39] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-24 13:43:39] [INFO ] Added : 63 causal constraints over 13 iterations in 147 ms. Result :sat
Minimization took 26 ms.
[2026-05-24 13:43:39] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-24 13:43:39] [INFO ] [Real]Absence check using 8 positive and 25 generalized place invariants in 7 ms returned sat
[2026-05-24 13:43:39] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2026-05-24 13:43:39] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-24 13:43:39] [INFO ] Added : 55 causal constraints over 11 iterations in 162 ms. Result :sat
Minimization took 39 ms.
[2026-05-24 13:43:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 13:43:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-24 13:43:40] [INFO ] [Nat]Absence check using 8 positive and 25 generalized place invariants in 7 ms returned sat
[2026-05-24 13:43:40] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2026-05-24 13:43:40] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 12 ms.
[2026-05-24 13:43:40] [INFO ] Added : 55 causal constraints over 11 iterations in 190 ms. Result :sat
Minimization took 39 ms.
[2026-05-24 13:43:40] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2026-05-24 13:43:40] [INFO ] [Real]Absence check using 8 positive and 25 generalized place invariants in 14 ms returned sat
[2026-05-24 13:43:40] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2026-05-24 13:43:40] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-24 13:43:40] [INFO ] Added : 64 causal constraints over 13 iterations in 195 ms. Result :sat
Minimization took 39 ms.
[2026-05-24 13:43:40] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-24 13:43:40] [INFO ] [Real]Absence check using 8 positive and 25 generalized place invariants in 11 ms returned sat
[2026-05-24 13:43:40] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2026-05-24 13:43:41] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-24 13:43:41] [INFO ] Added : 32 causal constraints over 7 iterations in 87 ms. Result :sat
Minimization took 22 ms.
[2026-05-24 13:43:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 13:43:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-24 13:43:41] [INFO ] [Nat]Absence check using 8 positive and 25 generalized place invariants in 9 ms returned sat
[2026-05-24 13:43:41] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2026-05-24 13:43:41] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-24 13:43:41] [INFO ] Added : 32 causal constraints over 7 iterations in 92 ms. Result :sat
Minimization took 38 ms.
[2026-05-24 13:43:41] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-24 13:43:41] [INFO ] [Real]Absence check using 8 positive and 25 generalized place invariants in 11 ms returned sat
[2026-05-24 13:43:41] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2026-05-24 13:43:41] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-24 13:43:41] [INFO ] Added : 38 causal constraints over 8 iterations in 116 ms. Result :sat
Minimization took 19 ms.
[2026-05-24 13:43:41] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-24 13:43:41] [INFO ] [Real]Absence check using 8 positive and 25 generalized place invariants in 11 ms returned sat
[2026-05-24 13:43:41] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2026-05-24 13:43:41] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-24 13:43:41] [INFO ] Added : 32 causal constraints over 7 iterations in 100 ms. Result :sat
Minimization took 40 ms.
[2026-05-24 13:43:42] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-24 13:43:42] [INFO ] [Real]Absence check using 8 positive and 25 generalized place invariants in 10 ms returned sat
[2026-05-24 13:43:42] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2026-05-24 13:43:42] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-24 13:43:42] [INFO ] Added : 63 causal constraints over 13 iterations in 189 ms. Result :sat
Minimization took 47 ms.
[2026-05-24 13:43:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 13:43:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-24 13:43:42] [INFO ] [Nat]Absence check using 8 positive and 25 generalized place invariants in 10 ms returned sat
[2026-05-24 13:43:42] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2026-05-24 13:43:42] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-24 13:43:42] [INFO ] Added : 63 causal constraints over 13 iterations in 158 ms. Result :sat
Minimization took 42 ms.
[2026-05-24 13:43:42] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-24 13:43:42] [INFO ] [Real]Absence check using 8 positive and 25 generalized place invariants in 13 ms returned sat
[2026-05-24 13:43:42] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2026-05-24 13:43:42] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-24 13:43:43] [INFO ] Added : 49 causal constraints over 10 iterations in 174 ms. Result :sat
Minimization took 36 ms.
[2026-05-24 13:43:43] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-24 13:43:43] [INFO ] [Real]Absence check using 8 positive and 25 generalized place invariants in 13 ms returned sat
[2026-05-24 13:43:43] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2026-05-24 13:43:43] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-24 13:43:43] [INFO ] Added : 52 causal constraints over 11 iterations in 182 ms. Result :sat
Minimization took 37 ms.
[2026-05-24 13:43:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 13:43:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2026-05-24 13:43:43] [INFO ] [Nat]Absence check using 8 positive and 25 generalized place invariants in 9 ms returned sat
[2026-05-24 13:43:43] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2026-05-24 13:43:43] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-24 13:43:43] [INFO ] Added : 52 causal constraints over 11 iterations in 144 ms. Result :sat
Minimization took 25 ms.
[2026-05-24 13:43:43] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-24 13:43:43] [INFO ] [Real]Absence check using 8 positive and 25 generalized place invariants in 9 ms returned sat
[2026-05-24 13:43:43] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2026-05-24 13:43:43] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 11 ms.
[2026-05-24 13:43:44] [INFO ] Added : 32 causal constraints over 7 iterations in 120 ms. Result :sat
Minimization took 36 ms.
[2026-05-24 13:43:44] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-24 13:43:44] [INFO ] [Real]Absence check using 8 positive and 25 generalized place invariants in 11 ms returned sat
[2026-05-24 13:43:44] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2026-05-24 13:43:44] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-24 13:43:44] [INFO ] Added : 63 causal constraints over 13 iterations in 191 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[51, 51, 51, 106, 2, 106, 2, 255, 51, 51, 51, 106, 106, 51, 51]
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 3
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 2
[2026-05-24 13:43:44] [INFO ] Unfolded HLPN to a Petri net with 11467 places and 9336 transitions 26832 arcs in 259 ms.
[2026-05-24 13:43:44] [INFO ] Unfolded 15 HLPN properties in 1 ms.
Deduced a syphon composed of 51 places in 97 ms
Reduce places removed 64 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[51, 51, 51, 106, 2, 106, 2, 255, 51, 51, 51, 106, 106, 51, 51]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[51, 51, 51, 106, 2, 106, 2, 255, 51, 51, 51, 106, 106, 51, 51]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3294066227881639584.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-722754237315907111.kers'
[2026-05-24 13:43:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3294066227881639584.kers, --Pflows, --basisKERS=/tmp/petrispot-output-722754237315907111.kers]
Culled 0 columns in 11 ms.
// Phase 1: matrix 9336 rows 11403 cols 26832 entries
Finished phase 1 with 5164 SingleSign rule and 3472 generalized
[2026-05-24 13:43:45] [INFO ] Computed 2767 invariants in 230 ms
Computed 2767 P flows in 231 ms.
Exported basis to /tmp/petrispot-output-722754237315907111.kers
Total runtime 247 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[51, 51, 51, 106, 2, 106, 2, 255, 51, 51, 51, 106, 106, 51, 51]
RANDOM walk for 10000 steps (3 resets) in 841 ms. (11 steps per ms)
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-11 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120012 steps (24 resets) in 534 ms. (224 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 9, 11, 9, 49, 28, 5, 28, 7, 7, 31, 7] Max Struct:[51, 51, 51, 106, 106, 255, 51, 51, 106, 106, 51, 51]
[2026-05-24 13:43:46] [INFO ] Invariant cache hit.
[2026-05-24 13:43:50] [INFO ] [Real]Absence check using 152 positive place invariants in 770 ms returned sat
[2026-05-24 13:43:51] [INFO ] [Real]Absence check using 152 positive and 2615 generalized place invariants in 1652 ms returned sat
[2026-05-24 13:43:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:857)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2278)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-24 13:43:54] [INFO ] [Real]Absence check using 152 positive place invariants in 607 ms returned sat
[2026-05-24 13:43:56] [INFO ] [Real]Absence check using 152 positive and 2615 generalized place invariants in 1419 ms returned sat
[2026-05-24 13:43:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:857)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2278)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-24 13:43:59] [INFO ] [Real]Absence check using 152 positive place invariants in 753 ms returned sat
[2026-05-24 13:44:01] [INFO ] [Real]Absence check using 152 positive and 2615 generalized place invariants in 1507 ms returned sat
[2026-05-24 13:44:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:857)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2278)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-24 13:44:05] [INFO ] [Real]Absence check using 152 positive place invariants in 694 ms returned sat
[2026-05-24 13:44:06] [INFO ] [Real]Absence check using 152 positive and 2615 generalized place invariants in 1540 ms returned sat
[2026-05-24 13:44:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:857)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2278)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-24 13:44:09] [INFO ] [Real]Absence check using 152 positive place invariants in 548 ms returned sat
[2026-05-24 13:44:11] [INFO ] [Real]Absence check using 152 positive and 2615 generalized place invariants in 1721 ms returned sat
[2026-05-24 13:44:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:857)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2278)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-24 13:44:17] [INFO ] [Real]Absence check using 152 positive place invariants in 599 ms returned sat
[2026-05-24 13:44:18] [INFO ] [Real]Absence check using 152 positive and 2615 generalized place invariants in 1322 ms returned sat
[2026-05-24 13:44:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:857)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2278)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-24 13:44:21] [INFO ] [Real]Absence check using 152 positive place invariants in 551 ms returned sat
[2026-05-24 13:44:23] [INFO ] [Real]Absence check using 152 positive and 2615 generalized place invariants in 1306 ms returned sat
[2026-05-24 13:44:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:857)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2278)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-24 13:44:26] [INFO ] [Real]Absence check using 152 positive place invariants in 555 ms returned sat
[2026-05-24 13:44:28] [INFO ] [Real]Absence check using 152 positive and 2615 generalized place invariants in 1307 ms returned sat
[2026-05-24 13:44:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:857)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2278)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-24 13:44:32] [INFO ] [Real]Absence check using 152 positive place invariants in 717 ms returned sat
[2026-05-24 13:44:33] [INFO ] [Real]Absence check using 152 positive and 2615 generalized place invariants in 1572 ms returned sat
[2026-05-24 13:44:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:857)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2278)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-24 13:44:37] [INFO ] [Real]Absence check using 152 positive place invariants in 578 ms returned sat
[2026-05-24 13:44:38] [INFO ] [Real]Absence check using 152 positive and 2615 generalized place invariants in 1708 ms returned sat
[2026-05-24 13:44:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:857)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2278)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-24 13:44:42] [INFO ] [Real]Absence check using 152 positive place invariants in 568 ms returned sat
[2026-05-24 13:44:43] [INFO ] [Real]Absence check using 152 positive and 2615 generalized place invariants in 1333 ms returned sat
[2026-05-24 13:44:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:857)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2278)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Current structural bounds on expressions (after SMT) : Max Seen:[7, 9, 11, 9, 49, 28, 5, 28, 7, 7, 31, 7] Max Struct:[51, 51, 51, 106, 106, 255, 51, 51, 106, 106, 51, 51]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7, 9, 11, 9, 49, 28, 5, 28, 7, 7, 31, 7] Max Struct:[51, 51, 51, 106, 106, 255, 51, 51, 106, 106, 51, 51]
Support contains 1479 out of 11403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11403/11403 places, 9336/9336 transitions.
Graph (complete) has 16989 edges and 11403 vertex of which 10772 are kept as prefixes of interest. Removing 631 places using SCC suffix rule.68 ms
Discarding 631 places :
Also discarding 462 output transitions
Drop transitions (Output transitions of discarded places.) removed 462 transitions
Discarding 1683 places :
Implicit places reduction removed 1683 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2907 transitions
Trivial Post-agglo rules discarded 2907 transitions
Performed 2907 trivial Post agglomeration. Transition count delta: 2907
Iterating post reduction 0 with 4590 rules applied. Total rules applied 4591 place count 9089 transition count 5967
Reduce places removed 2907 places and 0 transitions.
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Iterating post reduction 1 with 3264 rules applied. Total rules applied 7855 place count 6182 transition count 5610
Reduce places removed 357 places and 0 transitions.
Iterating post reduction 2 with 357 rules applied. Total rules applied 8212 place count 5825 transition count 5610
Performed 867 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 867 Pre rules applied. Total rules applied 8212 place count 5825 transition count 4743
Deduced a syphon composed of 867 places in 16 ms
Ensure Unique test removed 459 places
Reduce places removed 1326 places and 0 transitions.
Iterating global reduction 3 with 2193 rules applied. Total rules applied 10405 place count 4499 transition count 4743
Discarding 153 places :
Implicit places reduction removed 153 places
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Iterating post reduction 3 with 306 rules applied. Total rules applied 10711 place count 4346 transition count 4590
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 4 with 153 rules applied. Total rules applied 10864 place count 4193 transition count 4590
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 51 Pre rules applied. Total rules applied 10864 place count 4193 transition count 4539
Deduced a syphon composed of 51 places in 13 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 10966 place count 4142 transition count 4539
Discarding 714 places :
Symmetric choice reduction at 5 with 714 rule applications. Total rules 11680 place count 3428 transition count 3825
Iterating global reduction 5 with 714 rules applied. Total rules applied 12394 place count 3428 transition count 3825
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 51 Pre rules applied. Total rules applied 12394 place count 3428 transition count 3774
Deduced a syphon composed of 51 places in 12 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 5 with 102 rules applied. Total rules applied 12496 place count 3377 transition count 3774
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 12498 place count 3375 transition count 3672
Iterating global reduction 5 with 2 rules applied. Total rules applied 12500 place count 3375 transition count 3672
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 8 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 5 with 204 rules applied. Total rules applied 12704 place count 3273 transition count 3570
Free-agglomeration rule (complex) applied 714 times.
Iterating global reduction 5 with 714 rules applied. Total rules applied 13418 place count 3273 transition count 2856
Ensure Unique test removed 51 places
Reduce places removed 765 places and 0 transitions.
Iterating post reduction 5 with 765 rules applied. Total rules applied 14183 place count 2508 transition count 2856
Applied a total of 14183 rules in 3514 ms. Remains 2508 /11403 variables (removed 8895) and now considering 2856/9336 (removed 6480) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3532 ms. Remains : 2508/11403 places, 2856/9336 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5491488803432107130.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16737963104063051398.kers'
[2026-05-24 13:44:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5491488803432107130.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16737963104063051398.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2856 rows 2508 cols 7752 entries
Finished phase 1 with 1994 SingleSign rule and 255 generalized
[2026-05-24 13:44:48] [INFO ] Computed 259 invariants in 32 ms
Computed 259 P flows in 33 ms.
Exported basis to /tmp/petrispot-output-16737963104063051398.kers
Total runtime 39 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[7, 9, 11, 9, 49, 28, 5, 28, 7, 7, 31, 7] Max Struct:[51, 51, 51, 106, 106, 255, 51, 51, 106, 106, 51, 51]
RANDOM walk for 771932 steps (794 resets) in 30001 ms. (25 steps per ms)
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-00 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-02 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-09 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-10 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 7261116 steps (125 resets) in 31539 ms. (230 steps per ms)
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-15 51 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[22, 51, 49, 51, 18, 51, 32] Max Struct:[51, 106, 106, 255, 106, 106, 51]
[2026-05-24 13:45:49] [INFO ] Invariant cache hit.
[2026-05-24 13:45:50] [INFO ] [Real]Absence check using 0 positive and 259 generalized place invariants in 220 ms returned sat
[2026-05-24 13:45:52] [INFO ] [Real]Absence check using state equation in 1713 ms returned sat
[2026-05-24 13:45:52] [INFO ] Computed and/alt/rep : 2346/2958/2346 causal constraints (skipped 459 transitions) in 390 ms.
[2026-05-24 13:46:03] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 13:46:03] [INFO ] [Nat]Absence check using 0 positive and 259 generalized place invariants in 217 ms returned sat
[2026-05-24 13:46:05] [INFO ] [Nat]Absence check using state equation in 1651 ms returned sat
[2026-05-24 13:46:05] [INFO ] Computed and/alt/rep : 2346/2958/2346 causal constraints (skipped 459 transitions) in 257 ms.
[2026-05-24 13:46:22] [INFO ] Added : 289 causal constraints over 58 iterations in 17155 ms. Result :sat
Minimization took 4783 ms.
[2026-05-24 13:46:28] [INFO ] [Real]Absence check using 0 positive and 259 generalized place invariants in 131 ms returned sat
[2026-05-24 13:46:29] [INFO ] [Real]Absence check using state equation in 975 ms returned unsat
[2026-05-24 13:46:29] [INFO ] [Real]Absence check using 0 positive and 259 generalized place invariants in 131 ms returned sat
[2026-05-24 13:46:31] [INFO ] [Real]Absence check using state equation in 1680 ms returned sat
[2026-05-24 13:46:32] [INFO ] Computed and/alt/rep : 2346/2958/2346 causal constraints (skipped 459 transitions) in 815 ms.
[2026-05-24 13:46:51] [INFO ] Added : 335 causal constraints over 67 iterations in 20081 ms.(timeout) Result :sat
Minimization took 4829 ms.
[2026-05-24 13:46:57] [INFO ] [Real]Absence check using 0 positive and 259 generalized place invariants in 213 ms returned sat
[2026-05-24 13:46:58] [INFO ] [Real]Absence check using state equation in 1180 ms returned unsat
[2026-05-24 13:46:59] [INFO ] [Real]Absence check using 0 positive and 259 generalized place invariants in 142 ms returned sat
[2026-05-24 13:47:00] [INFO ] [Real]Absence check using state equation in 1686 ms returned sat
[2026-05-24 13:47:01] [INFO ] Computed and/alt/rep : 2346/2958/2346 causal constraints (skipped 459 transitions) in 205 ms.
[2026-05-24 13:47:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 13:47:15] [INFO ] [Nat]Absence check using 0 positive and 259 generalized place invariants in 224 ms returned sat
[2026-05-24 13:47:18] [INFO ] [Nat]Absence check using state equation in 2107 ms returned sat
[2026-05-24 13:47:18] [INFO ] Computed and/alt/rep : 2346/2958/2346 causal constraints (skipped 459 transitions) in 273 ms.
[2026-05-24 13:47:38] [INFO ] Added : 355 causal constraints over 71 iterations in 20097 ms.(timeout) Result :sat
Minimization took 5032 ms.
[2026-05-24 13:47:43] [INFO ] [Real]Absence check using 0 positive and 259 generalized place invariants in 148 ms returned sat
[2026-05-24 13:47:45] [INFO ] [Real]Absence check using state equation in 1299 ms returned unsat
[2026-05-24 13:47:45] [INFO ] [Real]Absence check using 0 positive and 259 generalized place invariants in 165 ms returned sat
[2026-05-24 13:47:47] [INFO ] [Real]Absence check using state equation in 1532 ms returned sat
[2026-05-24 13:47:48] [INFO ] Computed and/alt/rep : 2346/2958/2346 causal constraints (skipped 459 transitions) in 348 ms.
[2026-05-24 13:47:58] [INFO ] Added : 156 causal constraints over 32 iterations in 10256 ms. Result :sat
Minimization took 4811 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[22, 51, 49, 51, 18, 51, 32] Max Struct:[51, 51, 106, 51, 106, 51, 51]
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-13 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-08 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-04 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[22, 49, 18, 32] Max Struct:[51, 106, 106, 51]
Support contains 714 out of 2508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2508/2508 places, 2856/2856 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 561 transitions
Trivial Post-agglo rules discarded 561 transitions
Performed 561 trivial Post agglomeration. Transition count delta: 561
Iterating post reduction 0 with 612 rules applied. Total rules applied 612 place count 2457 transition count 2295
Reduce places removed 561 places and 0 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 1 with 612 rules applied. Total rules applied 1224 place count 1896 transition count 2244
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 2 with 51 rules applied. Total rules applied 1275 place count 1845 transition count 2244
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 1275 place count 1845 transition count 2142
Deduced a syphon composed of 102 places in 2 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 1479 place count 1743 transition count 2142
Discarding 102 places :
Symmetric choice reduction at 3 with 102 rule applications. Total rules 1581 place count 1641 transition count 2040
Iterating global reduction 3 with 102 rules applied. Total rules applied 1683 place count 1641 transition count 2040
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 3 with 102 rules applied. Total rules applied 1785 place count 1641 transition count 1938
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 2 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 4 with 153 rules applied. Total rules applied 1938 place count 1539 transition count 1887
Free-agglomeration rule (complex) applied 51 times.
Iterating global reduction 4 with 51 rules applied. Total rules applied 1989 place count 1539 transition count 1836
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 4 with 51 rules applied. Total rules applied 2040 place count 1488 transition count 1836
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 5 with 51 rules applied. Total rules applied 2091 place count 1437 transition count 1785
Applied a total of 2091 rules in 467 ms. Remains 1437 /2508 variables (removed 1071) and now considering 1785/2856 (removed 1071) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 467 ms. Remains : 1437/2508 places, 1785/2856 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12510417446057486401.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16382651858382098138.kers'
[2026-05-24 13:48:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12510417446057486401.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16382651858382098138.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1785 rows 1437 cols 5151 entries
Finished phase 1 with 1076 SingleSign rule and 204 generalized
[2026-05-24 13:48:03] [INFO ] Computed 157 invariants in 23 ms
Computed 157 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-16382651858382098138.kers
Total runtime 25 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[22, 49, 18, 32] Max Struct:[51, 106, 106, 51]
RANDOM walk for 1000000 steps (2164 resets) in 24969 ms. (40 steps per ms)
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-03 51 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2104761 steps (76 resets) in 13555 ms. (155 steps per ms)
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-14 51 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[51, 22] Max Struct:[106, 106]
[2026-05-24 13:48:42] [INFO ] Invariant cache hit.
[2026-05-24 13:48:42] [INFO ] [Real]Absence check using 0 positive and 157 generalized place invariants in 110 ms returned sat
[2026-05-24 13:48:43] [INFO ] [Real]Absence check using state equation in 889 ms returned unsat
[2026-05-24 13:48:43] [INFO ] [Real]Absence check using 0 positive and 157 generalized place invariants in 71 ms returned sat
[2026-05-24 13:48:44] [INFO ] [Real]Absence check using state equation in 1145 ms returned sat
[2026-05-24 13:48:45] [INFO ] Computed and/alt/rep : 1020/1020/1020 causal constraints (skipped 459 transitions) in 185 ms.
[2026-05-24 13:48:51] [INFO ] Added : 156 causal constraints over 32 iterations in 6442 ms. Result :sat
Minimization took 4581 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[51, 22] Max Struct:[51, 106]
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-06 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[22] Max Struct:[106]
Support contains 51 out of 1437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1437/1437 places, 1785/1785 transitions.
Graph (complete) has 3367 edges and 1437 vertex of which 1282 are kept as prefixes of interest. Removing 155 places using SCC suffix rule.1 ms
Discarding 155 places :
Also discarding 102 output transitions
Drop transitions (Output transitions of discarded places.) removed 102 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 612 transitions
Trivial Post-agglo rules discarded 612 transitions
Performed 612 trivial Post agglomeration. Transition count delta: 612
Iterating post reduction 0 with 612 rules applied. Total rules applied 613 place count 1282 transition count 1071
Reduce places removed 612 places and 0 transitions.
Iterating post reduction 1 with 612 rules applied. Total rules applied 1225 place count 670 transition count 1071
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1230 place count 665 transition count 816
Iterating global reduction 2 with 5 rules applied. Total rules applied 1235 place count 665 transition count 816
Discarding 255 places :
Symmetric choice reduction at 2 with 255 rule applications. Total rules 1490 place count 410 transition count 561
Iterating global reduction 2 with 255 rules applied. Total rules applied 1745 place count 410 transition count 561
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 2000 place count 410 transition count 306
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 2000 place count 410 transition count 255
Deduced a syphon composed of 51 places in 1 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 153 rules applied. Total rules applied 2153 place count 308 transition count 255
Free-agglomeration rule (complex) applied 51 times.
Iterating global reduction 3 with 51 rules applied. Total rules applied 2204 place count 308 transition count 204
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 3 with 102 rules applied. Total rules applied 2306 place count 206 transition count 204
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 4 with 51 rules applied. Total rules applied 2357 place count 155 transition count 153
Applied a total of 2357 rules in 98 ms. Remains 155 /1437 variables (removed 1282) and now considering 153/1785 (removed 1632) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 155/1437 places, 153/1785 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1809209450913431672.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11863380976119797769.kers'
[2026-05-24 13:48:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1809209450913431672.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11863380976119797769.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 153 rows 155 cols 408 entries
Finished phase 1 with 51 SingleSign rule and 102 generalized
[2026-05-24 13:48:56] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11863380976119797769.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[22] Max Struct:[106]
RANDOM walk for 1000000 steps (6493 resets) in 5995 ms. (166 steps per ms)
BEST_FIRST walk for 1000001 steps (149 resets) in 2546 ms. (392 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[51] Max Struct:[106]
[2026-05-24 13:49:04] [INFO ] Invariant cache hit.
[2026-05-24 13:49:05] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-24 13:49:05] [INFO ] [Real]Absence check using state equation in 86 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[51] Max Struct:[51]
FORMULA FamilyReunion-COL-L00050M0005C002P002G001-UpperBounds-12 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 329482 ms.

BK_STOP 1779630545205

--------------------
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="FamilyReunion-COL-L00050M0005C002P002G001"
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 FamilyReunion-COL-L00050M0005C002P002G001, 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 r130-smll-177955808900021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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