fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r143-smll-177955812400015
Last Updated
Jun 17, 2026

About the Execution of 2025-gold for FamilyReunion-PT-L00050M0005C002P002G001

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
592.979 113276.00 140039.00 792.80 51 2 51 51 51 2 51 2 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r143-smll-177955812400015.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 gold2025
Input is FamilyReunion-PT-L00050M0005C002P002G001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-smll-177955812400015
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.3M
-rw-r--r-- 1 mcc users 45K Mar 6 05:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 278K Mar 6 05:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 237K Mar 6 05:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 842K 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 34K Mar 15 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 157K Mar 15 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 89K Mar 15 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 264K Mar 15 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 168K Mar 6 05:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Mar 6 05:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 328K Mar 6 05:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Mar 6 05:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 15 10:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 29K Mar 15 10:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 4.7M 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-PT-L00050M0005C002P002G001-UpperBounds-00
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-01
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-02
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-03
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-04
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-05
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-06
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-07
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-08
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-09
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-10
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-11
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-12
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-13
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-14
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779624315579

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00050M0005C002P002G001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-24 12:05:18] [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 12:05:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 12:05:19] [INFO ] Load time of PNML (sax parser for PT used): 994 ms
[2026-05-24 12:05:19] [INFO ] Transformed 12194 places.
[2026-05-24 12:05:19] [INFO ] Transformed 10560 transitions.
[2026-05-24 12:05:19] [INFO ] Parsed PT model containing 12194 places and 10560 transitions and 32238 arcs in 1293 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 35 ms.
Reduce places removed 17 places and 0 transitions.
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 (Before main loop) : 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]
// Phase 1: matrix 10560 rows 12177 cols
[2026-05-24 12:05:21] [INFO ] Computed 2768 invariants in 1366 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:[+inf, +inf, +inf, +inf, 53, +inf, 53, 1, 1, 1, +inf, 1, 1, 1, 1]
RANDOM walk for 10000 steps (3 resets) in 588 ms. (16 steps per ms)
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100010 steps (20 resets) in 399 ms. (250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 8, 9, 9, 2, 49, 1, 1, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 53, +inf, 53, +inf, 1, 1]
[2026-05-24 12:05:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:05:29] [INFO ] [Real]Absence check using 149 positive place invariants in 632 ms returned sat
[2026-05-24 12:05:31] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 2040 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:05:34] [INFO ] [Real]Absence check using 149 positive place invariants in 738 ms returned sat
[2026-05-24 12:05:36] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1927 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:05:42] [INFO ] [Real]Absence check using 149 positive place invariants in 611 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:05:47] [INFO ] [Real]Absence check using 149 positive place invariants in 606 ms returned sat
[2026-05-24 12:05:49] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1927 ms returned sat
[2026-05-24 12:05:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:854)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:05:52] [INFO ] [Real]Absence check using 149 positive place invariants in 592 ms returned sat
[2026-05-24 12:05:53] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 691 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:05:56] [INFO ] [Real]Absence check using 149 positive place invariants in 645 ms returned sat
[2026-05-24 12:05:58] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1815 ms returned sat
[2026-05-24 12:05:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:854)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:06:01] [INFO ] [Real]Absence check using 149 positive place invariants in 586 ms returned sat
[2026-05-24 12:06:03] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-24 12:06:03] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 2046 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[7, 8, 9, 9, 2, 49, 1, 1, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 2, +inf, 53, 1, 1, 1]
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7, 8, 9, 9, 49, 1, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, 53, 1, 1]
Support contains 765 out of 12177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12177/12177 places, 10560/10560 transitions.
Graph (complete) has 18927 edges and 12177 vertex of which 11950 are kept as prefixes of interest. Removing 227 places using SCC suffix rule.61 ms
Discarding 227 places :
Also discarding 54 output transitions
Drop transitions (Output transitions of discarded places.) removed 54 transitions
Drop transitions (Empty/Sink Transition effects.) removed 153 transitions
Reduce isomorphic transitions removed 153 transitions.
Discarding 1836 places :
Implicit places reduction removed 1836 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4743 transitions
Trivial Post-agglo rules discarded 4743 transitions
Performed 4743 trivial Post agglomeration. Transition count delta: 4743
Iterating post reduction 0 with 6732 rules applied. Total rules applied 6733 place count 10114 transition count 5610
Reduce places removed 4743 places and 0 transitions.
Iterating post reduction 1 with 4743 rules applied. Total rules applied 11476 place count 5371 transition count 5610
Performed 459 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 459 Pre rules applied. Total rules applied 11476 place count 5371 transition count 5151
Deduced a syphon composed of 459 places in 8 ms
Ensure Unique test removed 153 places
Reduce places removed 612 places and 0 transitions.
Iterating global reduction 2 with 1071 rules applied. Total rules applied 12547 place count 4759 transition count 5151
Discarding 153 places :
Implicit places reduction removed 153 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 2 with 204 rules applied. Total rules applied 12751 place count 4606 transition count 5100
Reduce places removed 51 places and 0 transitions.
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Iterating post reduction 3 with 204 rules applied. Total rules applied 12955 place count 4555 transition count 4947
Reduce places removed 153 places and 0 transitions.
Iterating post reduction 4 with 153 rules applied. Total rules applied 13108 place count 4402 transition count 4947
Discarding 1072 places :
Symmetric choice reduction at 5 with 1072 rule applications. Total rules 14180 place count 3330 transition count 3825
Iterating global reduction 5 with 1072 rules applied. Total rules applied 15252 place count 3330 transition count 3825
Discarding 102 places :
Implicit places reduction removed 102 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 5 with 306 rules applied. Total rules applied 15558 place count 3228 transition count 3621
Reduce places removed 204 places and 0 transitions.
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Iterating post reduction 6 with 306 rules applied. Total rules applied 15864 place count 3024 transition count 3519
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 7 with 102 rules applied. Total rules applied 15966 place count 2922 transition count 3519
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 102 Pre rules applied. Total rules applied 15966 place count 2922 transition count 3417
Deduced a syphon composed of 102 places in 7 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 8 with 204 rules applied. Total rules applied 16170 place count 2820 transition count 3417
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 16175 place count 2815 transition count 3162
Iterating global reduction 8 with 5 rules applied. Total rules applied 16180 place count 2815 transition count 3162
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 8 with 204 rules applied. Total rules applied 16384 place count 2764 transition count 3009
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 9 with 51 rules applied. Total rules applied 16435 place count 2713 transition count 3009
Performed 204 Post agglomeration using F-continuation condition.Transition count delta: 204
Deduced a syphon composed of 204 places in 7 ms
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 10 with 408 rules applied. Total rules applied 16843 place count 2509 transition count 2805
Free-agglomeration rule (complex) applied 459 times.
Iterating global reduction 10 with 459 rules applied. Total rules applied 17302 place count 2509 transition count 2346
Ensure Unique test removed 51 places
Reduce places removed 510 places and 0 transitions.
Iterating post reduction 10 with 510 rules applied. Total rules applied 17812 place count 1999 transition count 2346
Applied a total of 17812 rules in 3057 ms. Remains 1999 /12177 variables (removed 10178) and now considering 2346/10560 (removed 8214) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3077 ms. Remains : 1999/12177 places, 2346/10560 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 2346 rows 1999 cols
[2026-05-24 12:06:08] [INFO ] Computed 362 invariants in 45 ms
Current structural bounds on expressions (after invariants) : Max Seen:[7, 8, 9, 9, 49, 1, 0, 0] Max Struct:[453, 453, 906, 151, 203, 52, 1, 1]
RANDOM walk for 993185 steps (1482 resets) in 30001 ms. (33 steps per ms)
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5153938 steps (122 resets) in 25218 ms. (204 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[51, 51, 51, 51, 51, 2] Max Struct:[453, 453, 906, 151, 203, 52]
[2026-05-24 12:07:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:07:04] [INFO ] [Real]Absence check using 101 positive place invariants in 97 ms returned sat
[2026-05-24 12:07:04] [INFO ] [Real]Absence check using 101 positive and 261 generalized place invariants in 81 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:07:05] [INFO ] [Real]Absence check using 101 positive place invariants in 102 ms returned sat
[2026-05-24 12:07:05] [INFO ] [Real]Absence check using 101 positive and 261 generalized place invariants in 93 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:07:06] [INFO ] [Real]Absence check using 101 positive place invariants in 61 ms returned sat
[2026-05-24 12:07:06] [INFO ] [Real]Absence check using 101 positive and 261 generalized place invariants in 65 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:07:06] [INFO ] [Real]Absence check using 101 positive place invariants in 63 ms returned sat
[2026-05-24 12:07:06] [INFO ] [Real]Absence check using 101 positive and 261 generalized place invariants in 63 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:07:07] [INFO ] [Real]Absence check using 101 positive place invariants in 86 ms returned sat
[2026-05-24 12:07:07] [INFO ] [Real]Absence check using 101 positive and 261 generalized place invariants in 125 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:07:07] [INFO ] [Real]Absence check using 101 positive place invariants in 62 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[51, 51, 51, 51, 51, 2] Max Struct:[51, 51, 51, 51, 51, 2]
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-06 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-04 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-03 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-02 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-00 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 7 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-05-24 12:07:08] [INFO ] Flatten gal took : 330 ms
[2026-05-24 12:07:08] [INFO ] Flatten gal took : 183 ms
[2026-05-24 12:07:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5748633941900526869.gal : 76 ms
[2026-05-24 12:07:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8795519870249796857.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5748633941900526869.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8795519870249796857.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 110605 ms.

BK_STOP 1779624428855

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-PT-L00050M0005C002P002G001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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 gold2025"
echo " Input is FamilyReunion-PT-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 r143-smll-177955812400015"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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