fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r237-smll-174903502600035
Last Updated
June 24, 2025

About the Execution of 2024-gold for StigmergyElection-PT-09a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15686.540 26299.00 44576.00 249.10 1 1 1 1 1 1 1 1 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/mcc2025-input.r237-smll-174903502600035.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is StigmergyElection-PT-09a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r237-smll-174903502600035
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 17M May 29 14:33 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 StigmergyElection-PT-09a-UpperBounds-00
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-01
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-02
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-03
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-04
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-05
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-06
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-07
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-08
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-09
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-10
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-11
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-12
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-13
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-14
FORMULA_NAME StigmergyElection-PT-09a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749107801728

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-09a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-05 07:16:43] [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]
[2025-06-05 07:16:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 07:16:45] [INFO ] Load time of PNML (sax parser for PT used): 1564 ms
[2025-06-05 07:16:45] [INFO ] Transformed 128 places.
[2025-06-05 07:16:45] [INFO ] Transformed 18490 transitions.
[2025-06-05 07:16:45] [INFO ] Found NUPN structural information;
[2025-06-05 07:16:45] [INFO ] Parsed PT model containing 128 places and 18490 transitions and 329609 arcs in 1984 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Ensure Unique test removed 17295 transitions
Reduce redundant transitions removed 17295 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-05 07:16:46] [INFO ] Flow matrix only has 1168 transitions (discarded 27 similar events)
// Phase 1: matrix 1168 rows 128 cols
[2025-06-05 07:16:46] [INFO ] Computed 10 invariants in 74 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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (7 resets) in 701 ms. (14 steps per ms)
FORMULA StigmergyElection-PT-09a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (6 resets) in 47 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-06-05 07:16:47] [INFO ] Flow matrix only has 1168 transitions (discarded 27 similar events)
[2025-06-05 07:16:47] [INFO ] Invariant cache hit.
[2025-06-05 07:16:47] [INFO ] [Real]Absence check using 10 positive place invariants in 18 ms returned sat
[2025-06-05 07:16:48] [INFO ] [Real]Absence check using state equation in 640 ms returned sat
[2025-06-05 07:16:48] [INFO ] State equation strengthened by 1066 read => feed constraints.
[2025-06-05 07:16:48] [INFO ] [Real]Added 1066 Read/Feed constraints in 416 ms returned sat
[2025-06-05 07:16:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:16:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-05 07:16:49] [INFO ] [Nat]Absence check using state equation in 551 ms returned sat
[2025-06-05 07:16:50] [INFO ] [Nat]Added 1066 Read/Feed constraints in 372 ms returned sat
[2025-06-05 07:16:50] [INFO ] Deduced a trap composed of 15 places in 731 ms of which 29 ms to minimize.
[2025-06-05 07:16:51] [INFO ] Deduced a trap composed of 14 places in 660 ms of which 3 ms to minimize.
[2025-06-05 07:16:52] [INFO ] Deduced a trap composed of 12 places in 552 ms of which 2 ms to minimize.
[2025-06-05 07:16:52] [INFO ] Deduced a trap composed of 13 places in 526 ms of which 3 ms to minimize.
[2025-06-05 07:16:53] [INFO ] Deduced a trap composed of 13 places in 576 ms of which 2 ms to minimize.
[2025-06-05 07:16:54] [INFO ] Deduced a trap composed of 13 places in 586 ms of which 3 ms to minimize.
[2025-06-05 07:16:54] [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: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-05 07:16:54] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-05 07:16:54] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2025-06-05 07:16:55] [INFO ] [Real]Added 1066 Read/Feed constraints in 264 ms returned sat
[2025-06-05 07:16:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:16:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-05 07:16:55] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2025-06-05 07:16:55] [INFO ] [Nat]Added 1066 Read/Feed constraints in 270 ms returned sat
[2025-06-05 07:16:56] [INFO ] Deduced a trap composed of 13 places in 559 ms of which 3 ms to minimize.
[2025-06-05 07:16:57] [INFO ] Deduced a trap composed of 13 places in 471 ms of which 2 ms to minimize.
[2025-06-05 07:16:57] [INFO ] Deduced a trap composed of 12 places in 492 ms of which 3 ms to minimize.
[2025-06-05 07:16:58] [INFO ] Deduced a trap composed of 13 places in 383 ms of which 1 ms to minimize.
[2025-06-05 07:16:58] [INFO ] Deduced a trap composed of 12 places in 339 ms of which 2 ms to minimize.
[2025-06-05 07:16:58] [INFO ] Deduced a trap composed of 13 places in 276 ms of which 1 ms to minimize.
[2025-06-05 07:16:59] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 1 ms to minimize.
[2025-06-05 07:16:59] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 2 ms to minimize.
[2025-06-05 07:16:59] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 1 ms to minimize.
[2025-06-05 07:17:00] [INFO ] Deduced a trap composed of 13 places in 251 ms of which 2 ms to minimize.
[2025-06-05 07:17:00] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 2 ms to minimize.
[2025-06-05 07:17:00] [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: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-05 07:17:00] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-05 07:17:00] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2025-06-05 07:17:01] [INFO ] [Real]Added 1066 Read/Feed constraints in 328 ms returned sat
[2025-06-05 07:17:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:17:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-06-05 07:17:01] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2025-06-05 07:17:01] [INFO ] [Nat]Added 1066 Read/Feed constraints in 233 ms returned sat
[2025-06-05 07:17:02] [INFO ] Deduced a trap composed of 14 places in 712 ms of which 4 ms to minimize.
[2025-06-05 07:17:03] [INFO ] Deduced a trap composed of 13 places in 465 ms of which 2 ms to minimize.
[2025-06-05 07:17:03] [INFO ] Deduced a trap composed of 15 places in 345 ms of which 1 ms to minimize.
[2025-06-05 07:17:03] [INFO ] Deduced a trap composed of 14 places in 315 ms of which 2 ms to minimize.
[2025-06-05 07:17:04] [INFO ] Deduced a trap composed of 13 places in 270 ms of which 2 ms to minimize.
[2025-06-05 07:17:04] [INFO ] Deduced a trap composed of 12 places in 358 ms of which 2 ms to minimize.
[2025-06-05 07:17:05] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 2 ms to minimize.
[2025-06-05 07:17:05] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 1 ms to minimize.
[2025-06-05 07:17:05] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 2 ms to minimize.
[2025-06-05 07:17:05] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
[2025-06-05 07:17:06] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 1 ms to minimize.
[2025-06-05 07:17:06] [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: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1195/1195 transitions.
Graph (complete) has 424 edges and 128 vertex of which 119 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.22 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 119 transition count 1140
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 101 transition count 1113
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 101 place count 92 transition count 1113
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 101 place count 92 transition count 1097
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 133 place count 76 transition count 1097
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 150 place count 59 transition count 1080
Iterating global reduction 3 with 17 rules applied. Total rules applied 167 place count 59 transition count 1080
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 182 place count 44 transition count 1065
Iterating global reduction 3 with 15 rules applied. Total rules applied 197 place count 44 transition count 1065
Ensure Unique test removed 517 transitions
Reduce isomorphic transitions removed 517 transitions.
Iterating post reduction 3 with 517 rules applied. Total rules applied 714 place count 44 transition count 548
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 732 place count 35 transition count 539
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 741 place count 26 transition count 530
Iterating global reduction 4 with 9 rules applied. Total rules applied 750 place count 26 transition count 530
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 751 place count 25 transition count 529
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 752 place count 24 transition count 529
Performed 9 Post agglomeration using F-continuation condition with reduction of 502 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 776 place count 9 transition count 18
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 785 place count 9 transition count 9
Applied a total of 785 rules in 442 ms. Remains 9 /128 variables (removed 119) and now considering 9/1195 (removed 1186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 463 ms. Remains : 9/128 places, 9/1195 transitions.
// Phase 1: matrix 9 rows 9 cols
[2025-06-05 07:17:06] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 616 ms. (1620 steps per ms)
FORMULA StigmergyElection-PT-09a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-09a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 318 ms. (3134 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 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 )
[2025-06-05 07:17:07] [INFO ] Flatten gal took : 23 ms
[2025-06-05 07:17:07] [INFO ] Flatten gal took : 4 ms
[2025-06-05 07:17:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9395362602037463073.gal : 4 ms
[2025-06-05 07:17:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality753830008456556821.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9395362602037463073.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality753830008456556821.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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 24066 ms.

BK_STOP 1749107828027

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="StigmergyElection-PT-09a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is StigmergyElection-PT-09a, 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 r237-smll-174903502600035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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