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-174903502600026.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-04b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r237-smll-174903502600026
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 5.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K 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 203K 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-04b-UpperBounds-00
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-01
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-02
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-03
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-04
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-05
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-06
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-07
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-08
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-09
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-10
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-11
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-12
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-13
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-14
FORMULA_NAME StigmergyElection-PT-04b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749107556854

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-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-05 07:12:38] [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:12:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 07:12:39] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2025-06-05 07:12:39] [INFO ] Transformed 563 places.
[2025-06-05 07:12:39] [INFO ] Transformed 780 transitions.
[2025-06-05 07:12:39] [INFO ] Found NUPN structural information;
[2025-06-05 07:12:39] [INFO ] Parsed PT model containing 563 places and 780 transitions and 2680 arcs in 414 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
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]
// Phase 1: matrix 780 rows 563 cols
[2025-06-05 07:12:39] [INFO ] Computed 5 invariants in 40 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 (135 resets) in 51 ms. (192 steps per ms)
FORMULA StigmergyElection-PT-04b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (134 resets) in 61 ms. (806 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-06-05 07:12:39] [INFO ] Invariant cache hit.
[2025-06-05 07:12:39] [INFO ] [Real]Absence check using 5 positive place invariants in 17 ms returned sat
[2025-06-05 07:12:40] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2025-06-05 07:12:40] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 110 ms.
[2025-06-05 07:12:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:12:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2025-06-05 07:12:41] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2025-06-05 07:12:41] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 101 ms.
[2025-06-05 07:12:45] [INFO ] Deduced a trap composed of 191 places in 290 ms of which 42 ms to minimize.
[2025-06-05 07:12:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 404 ms
[2025-06-05 07:12:45] [INFO ] Added : 345 causal constraints over 69 iterations in 4147 ms. Result :sat
Minimization took 246 ms.
[2025-06-05 07:12:46] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2025-06-05 07:12:46] [INFO ] [Real]Absence check using state equation in 346 ms returned sat
[2025-06-05 07:12:46] [INFO ] Deduced a trap composed of 191 places in 364 ms of which 6 ms to minimize.
[2025-06-05 07:12:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:12:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2025-06-05 07:12:47] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2025-06-05 07:12:48] [INFO ] Deduced a trap composed of 191 places in 440 ms of which 6 ms to minimize.
[2025-06-05 07:12:48] [INFO ] Deduced a trap composed of 190 places in 364 ms of which 17 ms to minimize.
[2025-06-05 07:12:48] [INFO ] Deduced a trap composed of 191 places in 279 ms of which 4 ms to minimize.
[2025-06-05 07:12:49] [INFO ] Deduced a trap composed of 191 places in 277 ms of which 5 ms to minimize.
[2025-06-05 07:12:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1537 ms
[2025-06-05 07:12:49] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 58 ms.
[2025-06-05 07:12:51] [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 1
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
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:12:52] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2025-06-05 07:12:52] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2025-06-05 07:12:52] [INFO ] Deduced a trap composed of 189 places in 522 ms of which 8 ms to minimize.
[2025-06-05 07:12:53] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:12:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2025-06-05 07:12:53] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2025-06-05 07:12:53] [INFO ] Deduced a trap composed of 189 places in 344 ms of which 6 ms to minimize.
[2025-06-05 07:12:54] [INFO ] Deduced a trap composed of 195 places in 240 ms of which 4 ms to minimize.
[2025-06-05 07:12:54] [INFO ] Deduced a trap composed of 189 places in 279 ms of which 5 ms to minimize.
[2025-06-05 07:12:54] [INFO ] Deduced a trap composed of 191 places in 220 ms of which 4 ms to minimize.
[2025-06-05 07:12:54] [INFO ] Deduced a trap composed of 194 places in 216 ms of which 5 ms to minimize.
[2025-06-05 07:12:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1477 ms
[2025-06-05 07:12:55] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 55 ms.
[2025-06-05 07:12:57] [INFO ] Added : 305 causal constraints over 61 iterations in 2984 ms. Result :sat
Minimization took 72 ms.
[2025-06-05 07:12:58] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2025-06-05 07:12:58] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2025-06-05 07:12:58] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 51 ms.
[2025-06-05 07:12:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:12:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2025-06-05 07:12:59] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2025-06-05 07:12:59] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 69 ms.
[2025-06-05 07:13:02] [INFO ] Deduced a trap composed of 191 places in 329 ms of which 4 ms to minimize.
[2025-06-05 07:13:03] [INFO ] Deduced a trap composed of 190 places in 403 ms of which 7 ms to minimize.
[2025-06-05 07:13:03] [INFO ] Deduced a trap composed of 191 places in 386 ms of which 8 ms to minimize.
[2025-06-05 07:13:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1323 ms
Maximisation of solution failed !
Minimization took 1 ms.
[2025-06-05 07:13:04] [INFO ] [Real]Absence check using 5 positive place invariants in 20 ms returned sat
[2025-06-05 07:13:04] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2025-06-05 07:13:04] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 59 ms.
[2025-06-05 07:13:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:13:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2025-06-05 07:13:05] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2025-06-05 07:13:05] [INFO ] Computed and/alt/rep : 704/1384/704 causal constraints (skipped 75 transitions) in 86 ms.
[2025-06-05 07:13:09] [INFO ] Deduced a trap composed of 231 places in 417 ms of which 5 ms to minimize.
[2025-06-05 07:13:09] [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 4
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.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
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, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 780/780 transitions.
Graph (trivial) has 563 edges and 563 vertex of which 75 / 563 are part of one of the 11 SCC in 10 ms
Free SCC test removed 64 places
Drop transitions (Empty/Sink Transition effects.) removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Graph (complete) has 863 edges and 499 vertex of which 491 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.8 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 353 transitions
Trivial Post-agglo rules discarded 353 transitions
Performed 353 trivial Post agglomeration. Transition count delta: 353
Iterating post reduction 0 with 357 rules applied. Total rules applied 359 place count 491 transition count 337
Reduce places removed 353 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 371 rules applied. Total rules applied 730 place count 138 transition count 319
Reduce places removed 9 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 13 rules applied. Total rules applied 743 place count 129 transition count 315
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 749 place count 125 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 750 place count 124 transition count 313
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 750 place count 124 transition count 301
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 774 place count 112 transition count 301
Discarding 31 places :
Symmetric choice reduction at 5 with 31 rule applications. Total rules 805 place count 81 transition count 270
Iterating global reduction 5 with 31 rules applied. Total rules applied 836 place count 81 transition count 270
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 836 place count 81 transition count 268
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 840 place count 79 transition count 268
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 851 place count 68 transition count 128
Iterating global reduction 5 with 11 rules applied. Total rules applied 862 place count 68 transition count 128
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 871 place count 68 transition count 119
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 899 place count 54 transition count 105
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 900 place count 54 transition count 104
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 903 place count 51 transition count 101
Iterating global reduction 7 with 3 rules applied. Total rules applied 906 place count 51 transition count 101
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 912 place count 48 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 921 place count 48 transition count 100
Free-agglomeration rule applied 21 times.
Iterating global reduction 7 with 21 rules applied. Total rules applied 942 place count 48 transition count 79
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 26 rules applied. Total rules applied 968 place count 27 transition count 74
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 971 place count 24 transition count 71
Iterating global reduction 8 with 3 rules applied. Total rules applied 974 place count 24 transition count 71
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 977 place count 24 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 982 place count 24 transition count 63
Applied a total of 982 rules in 261 ms. Remains 24 /563 variables (removed 539) and now considering 63/780 (removed 717) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 285 ms. Remains : 24/563 places, 63/780 transitions.
// Phase 1: matrix 63 rows 24 cols
[2025-06-05 07:13:10] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 3214 ms. (311 steps per ms)
FORMULA StigmergyElection-PT-04b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyElection-PT-04b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 422 ms. (2364 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:13:14] [INFO ] Flatten gal took : 51 ms
[2025-06-05 07:13:14] [INFO ] Flatten gal took : 17 ms
[2025-06-05 07:13:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1971214709262762136.gal : 11 ms
[2025-06-05 07:13:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6594554131260424381.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1971214709262762136.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6594554131260424381.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 35530 ms.

BK_STOP 1749107594306

--------------------
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-04b"
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-04b, 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-174903502600026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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