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.r265-tall-174931349700062.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 MedleyB-PT-B09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-174931349700062
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 7.1K Jun 6 09:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Jun 6 09:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 6 09:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 6 09:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 12:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 6 12:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 12:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 12:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 6.5K Jun 6 09:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Jun 6 09:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 6 09:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Jun 6 09:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 11M Jun 5 20:08 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 MedleyB-PT-B09-UpperBounds-00
FORMULA_NAME MedleyB-PT-B09-UpperBounds-01
FORMULA_NAME MedleyB-PT-B09-UpperBounds-02
FORMULA_NAME MedleyB-PT-B09-UpperBounds-03
FORMULA_NAME MedleyB-PT-B09-UpperBounds-04
FORMULA_NAME MedleyB-PT-B09-UpperBounds-05
FORMULA_NAME MedleyB-PT-B09-UpperBounds-06
FORMULA_NAME MedleyB-PT-B09-UpperBounds-07
FORMULA_NAME MedleyB-PT-B09-UpperBounds-08
FORMULA_NAME MedleyB-PT-B09-UpperBounds-09
FORMULA_NAME MedleyB-PT-B09-UpperBounds-10
FORMULA_NAME MedleyB-PT-B09-UpperBounds-11
FORMULA_NAME MedleyB-PT-B09-UpperBounds-12
FORMULA_NAME MedleyB-PT-B09-UpperBounds-13
FORMULA_NAME MedleyB-PT-B09-UpperBounds-14
FORMULA_NAME MedleyB-PT-B09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749319061138

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-07 17:57:42] [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-07 17:57:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:57:43] [INFO ] Load time of PNML (sax parser for PT used): 649 ms
[2025-06-07 17:57:43] [INFO ] Transformed 2435 places.
[2025-06-07 17:57:43] [INFO ] Transformed 15948 transitions.
[2025-06-07 17:57:43] [INFO ] Found NUPN structural information;
[2025-06-07 17:57:43] [INFO ] Parsed PT model containing 2435 places and 15948 transitions and 219484 arcs in 950 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 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 15948 rows 2435 cols
[2025-06-07 17:57:44] [INFO ] Computed 9 invariants in 425 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 (67 resets) in 143 ms. (69 steps per ms)
FORMULA MedleyB-PT-B09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130011 steps (121 resets) in 313 ms. (414 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[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]
[2025-06-07 17:57:44] [INFO ] Invariant cache hit.
[2025-06-07 17:57:45] [INFO ] [Real]Absence check using 9 positive place invariants in 63 ms returned sat
[2025-06-07 17:57:49] [INFO ] [Real]Absence check using state equation in 4415 ms returned unknown
[2025-06-07 17:57:50] [INFO ] [Real]Absence check using 9 positive place invariants in 48 ms returned sat
[2025-06-07 17:57:54] [INFO ] [Real]Absence check using state equation in 4575 ms returned unknown
[2025-06-07 17:57:55] [INFO ] [Real]Absence check using 9 positive place invariants in 46 ms returned sat
[2025-06-07 17:57:59] [INFO ] [Real]Absence check using state equation in 4340 ms returned sat
[2025-06-07 17:57:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:58:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 56 ms returned sat
[2025-06-07 17:58:04] [INFO ] [Nat]Absence check using state equation in 4382 ms returned sat
[2025-06-07 17:58:05] [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: Stream closed... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:954)
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-07 17:58:05] [INFO ] [Real]Absence check using 9 positive place invariants in 49 ms returned sat
[2025-06-07 17:58:10] [INFO ] [Real]Absence check using state equation in 4561 ms returned sat
[2025-06-07 17:58:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:58:10] [INFO ] [Nat]Absence check using 9 positive place invariants in 48 ms returned sat
[2025-06-07 17:58:14] [INFO ] [Nat]Absence check using state equation in 4356 ms returned sat
[2025-06-07 17:58:22] [INFO ] Deduced a trap composed of 401 places in 7160 ms of which 113 ms to minimize.
[2025-06-07 17:58:22] [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 3
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-07 17:58:22] [INFO ] [Real]Absence check using 9 positive place invariants in 46 ms returned sat
[2025-06-07 17:58:27] [INFO ] [Real]Absence check using state equation in 4639 ms returned unknown
[2025-06-07 17:58:27] [INFO ] [Real]Absence check using 9 positive place invariants in 50 ms returned sat
[2025-06-07 17:58:32] [INFO ] [Real]Absence check using state equation in 4589 ms returned unknown
[2025-06-07 17:58:32] [INFO ] [Real]Absence check using 9 positive place invariants in 49 ms returned sat
[2025-06-07 17:58:37] [INFO ] [Real]Absence check using state equation in 4592 ms returned unknown
[2025-06-07 17:58:37] [INFO ] [Real]Absence check using 9 positive place invariants in 48 ms returned sat
[2025-06-07 17:58:42] [INFO ] [Real]Absence check using state equation in 4642 ms returned unknown
[2025-06-07 17:58:42] [INFO ] [Real]Absence check using 9 positive place invariants in 49 ms returned sat
[2025-06-07 17:58:47] [INFO ] [Real]Absence check using state equation in 4449 ms returned sat
[2025-06-07 17:58:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:58:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 49 ms returned sat
[2025-06-07 17:58:52] [INFO ] [Nat]Absence check using state equation in 4617 ms returned unknown
[2025-06-07 17:58:52] [INFO ] [Real]Absence check using 9 positive place invariants in 48 ms returned sat
[2025-06-07 17:58:57] [INFO ] [Real]Absence check using state equation in 4595 ms returned unknown
[2025-06-07 17:58:57] [INFO ] [Real]Absence check using 9 positive place invariants in 47 ms returned sat
[2025-06-07 17:59:02] [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 10
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.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
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-07 17:59:02] [INFO ] [Real]Absence check using 9 positive place invariants in 49 ms returned sat
[2025-06-07 17:59:07] [INFO ] [Real]Absence check using state equation in 4661 ms returned unknown
[2025-06-07 17:59:07] [INFO ] [Real]Absence check using 9 positive place invariants in 46 ms returned sat
[2025-06-07 17:59:12] [INFO ] [Real]Absence check using state equation in 4459 ms returned sat
[2025-06-07 17:59:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:59:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 49 ms returned sat
[2025-06-07 17:59:17] [INFO ] [Nat]Absence check using state equation in 4619 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[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]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[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]
Support contains 13 out of 2435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2435/2435 places, 15948/15948 transitions.
Graph (trivial) has 2393 edges and 2435 vertex of which 151 / 2435 are part of one of the 23 SCC in 12 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 166 transitions
Reduce isomorphic transitions removed 166 transitions.
Graph (complete) has 3983 edges and 2307 vertex of which 2291 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.59 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1818 transitions
Trivial Post-agglo rules discarded 1818 transitions
Performed 1818 trivial Post agglomeration. Transition count delta: 1818
Iterating post reduction 0 with 1826 rules applied. Total rules applied 1828 place count 2291 transition count 13948
Reduce places removed 1818 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 1876 rules applied. Total rules applied 3704 place count 473 transition count 13890
Reduce places removed 23 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 34 rules applied. Total rules applied 3738 place count 450 transition count 13879
Reduce places removed 11 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 13 rules applied. Total rules applied 3751 place count 439 transition count 13877
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3752 place count 438 transition count 13877
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 83 Pre rules applied. Total rules applied 3752 place count 438 transition count 13794
Deduced a syphon composed of 83 places in 7 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 5 with 166 rules applied. Total rules applied 3918 place count 355 transition count 13794
Discarding 95 places :
Symmetric choice reduction at 5 with 95 rule applications. Total rules 4013 place count 260 transition count 13699
Iterating global reduction 5 with 95 rules applied. Total rules applied 4108 place count 260 transition count 13699
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4108 place count 260 transition count 13698
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4110 place count 259 transition count 13698
Discarding 53 places :
Symmetric choice reduction at 5 with 53 rule applications. Total rules 4163 place count 206 transition count 1163
Iterating global reduction 5 with 53 rules applied. Total rules applied 4216 place count 206 transition count 1163
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 4239 place count 206 transition count 1140
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 4251 place count 194 transition count 1128
Iterating global reduction 6 with 12 rules applied. Total rules applied 4263 place count 194 transition count 1128
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 4275 place count 182 transition count 1116
Iterating global reduction 6 with 12 rules applied. Total rules applied 4287 place count 182 transition count 1116
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 4297 place count 182 transition count 1106
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 7 with 50 rules applied. Total rules applied 4347 place count 157 transition count 1081
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4348 place count 157 transition count 1080
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 4356 place count 149 transition count 1072
Iterating global reduction 8 with 8 rules applied. Total rules applied 4364 place count 149 transition count 1072
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 4372 place count 141 transition count 1064
Iterating global reduction 8 with 8 rules applied. Total rules applied 4380 place count 141 transition count 1064
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 4388 place count 133 transition count 1056
Iterating global reduction 8 with 8 rules applied. Total rules applied 4396 place count 133 transition count 1056
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 4400 place count 131 transition count 1066
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 4402 place count 131 transition count 1064
Free-agglomeration rule applied 50 times.
Iterating global reduction 8 with 50 rules applied. Total rules applied 4452 place count 131 transition count 1014
Reduce places removed 50 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 8 with 179 rules applied. Total rules applied 4631 place count 81 transition count 885
Renaming transitions due to excessive name length > 1024 char.
Discarding 8 places :
Symmetric choice reduction at 9 with 8 rule applications. Total rules 4639 place count 73 transition count 877
Iterating global reduction 9 with 8 rules applied. Total rules applied 4647 place count 73 transition count 877
Drop transitions (Redundant composition of simpler transitions.) removed 386 transitions
Redundant transition composition rules discarded 386 transitions
Iterating global reduction 9 with 386 rules applied. Total rules applied 5033 place count 73 transition count 491
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 5037 place count 71 transition count 501
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 5038 place count 71 transition count 500
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 5039 place count 70 transition count 500
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 10 with 13 rules applied. Total rules applied 5052 place count 70 transition count 500
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 5058 place count 70 transition count 494
Applied a total of 5058 rules in 2389 ms. Remains 70 /2435 variables (removed 2365) and now considering 494/15948 (removed 15454) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2403 ms. Remains : 70/2435 places, 494/15948 transitions.
// Phase 1: matrix 494 rows 70 cols
[2025-06-07 17:59:20] [INFO ] Computed 9 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[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]
RANDOM walk for 1000000 steps (2 resets) in 18086 ms. (55 steps per ms)
FORMULA MedleyB-PT-B09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 486 ms. (2053 steps per ms)
FORMULA MedleyB-PT-B09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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-07 17:59:38] [INFO ] Flatten gal took : 129 ms
[2025-06-07 17:59:38] [INFO ] Flatten gal took : 60 ms
[2025-06-07 17:59:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2837525546968643082.gal : 36 ms
[2025-06-07 17:59:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4437789575512213520.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/ReachabilityCardinality2837525546968643082.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4437789575512213520.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 116560 ms.

BK_STOP 1749319179166

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="MedleyB-PT-B09"
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 MedleyB-PT-B09, 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 r265-tall-174931349700062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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