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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 7.9K Jun 6 09:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 6 09:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 6 09:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 6 09:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 12:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 12:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 12:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 09:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Jun 6 09:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Jun 6 09:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 6 09:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:09 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 253K 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-B02-UpperBounds-00
FORMULA_NAME MedleyB-PT-B02-UpperBounds-01
FORMULA_NAME MedleyB-PT-B02-UpperBounds-02
FORMULA_NAME MedleyB-PT-B02-UpperBounds-03
FORMULA_NAME MedleyB-PT-B02-UpperBounds-04
FORMULA_NAME MedleyB-PT-B02-UpperBounds-05
FORMULA_NAME MedleyB-PT-B02-UpperBounds-06
FORMULA_NAME MedleyB-PT-B02-UpperBounds-07
FORMULA_NAME MedleyB-PT-B02-UpperBounds-08
FORMULA_NAME MedleyB-PT-B02-UpperBounds-09
FORMULA_NAME MedleyB-PT-B02-UpperBounds-10
FORMULA_NAME MedleyB-PT-B02-UpperBounds-11
FORMULA_NAME MedleyB-PT-B02-UpperBounds-12
FORMULA_NAME MedleyB-PT-B02-UpperBounds-13
FORMULA_NAME MedleyB-PT-B02-UpperBounds-14
FORMULA_NAME MedleyB-PT-B02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749318999179

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-B02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-07 17:56:40] [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:56:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:56:40] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2025-06-07 17:56:40] [INFO ] Transformed 1227 places.
[2025-06-07 17:56:40] [INFO ] Transformed 1472 transitions.
[2025-06-07 17:56:40] [INFO ] Found NUPN structural information;
[2025-06-07 17:56:40] [INFO ] Parsed PT model containing 1227 places and 1472 transitions and 4160 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 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 1472 rows 1227 cols
[2025-06-07 17:56:40] [INFO ] Computed 5 invariants in 34 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 (129 resets) in 38 ms. (256 steps per ms)
FORMULA MedleyB-PT-B02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (107 resets) in 39 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-06-07 17:56:40] [INFO ] Invariant cache hit.
[2025-06-07 17:56:41] [INFO ] [Real]Absence check using 5 positive place invariants in 23 ms returned sat
[2025-06-07 17:56:41] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2025-06-07 17:56:42] [INFO ] Deduced a trap composed of 397 places in 451 ms of which 55 ms to minimize.
[2025-06-07 17:56:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:56:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 22 ms returned sat
[2025-06-07 17:56:43] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2025-06-07 17:56:43] [INFO ] Deduced a trap composed of 397 places in 336 ms of which 7 ms to minimize.
[2025-06-07 17:56:43] [INFO ] Deduced a trap composed of 396 places in 256 ms of which 5 ms to minimize.
[2025-06-07 17:56:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 756 ms
[2025-06-07 17:56:43] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 79 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-06-07 17:56:47] [INFO ] [Real]Absence check using 5 positive place invariants in 20 ms returned sat
[2025-06-07 17:56:48] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2025-06-07 17:56:48] [INFO ] Deduced a trap composed of 489 places in 328 ms of which 6 ms to minimize.
[2025-06-07 17:56:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:56:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 22 ms returned sat
[2025-06-07 17:56:49] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2025-06-07 17:56:49] [INFO ] Deduced a trap composed of 489 places in 307 ms of which 6 ms to minimize.
[2025-06-07 17:56:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 403 ms
[2025-06-07 17:56:49] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 70 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-06-07 17:56:53] [INFO ] [Real]Absence check using 5 positive place invariants in 27 ms returned sat
[2025-06-07 17:56:54] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2025-06-07 17:56:54] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 80 ms.
[2025-06-07 17:56:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:56:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 21 ms returned sat
[2025-06-07 17:56:55] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2025-06-07 17:56:55] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 80 ms.
[2025-06-07 17:57: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 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.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-07 17:57:00] [INFO ] [Real]Absence check using 5 positive place invariants in 20 ms returned sat
[2025-06-07 17:57:00] [INFO ] [Real]Absence check using state equation in 409 ms returned sat
[2025-06-07 17:57:00] [INFO ] Deduced a trap composed of 396 places in 229 ms of which 5 ms to minimize.
[2025-06-07 17:57:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 20 ms returned sat
[2025-06-07 17:57:01] [INFO ] [Nat]Absence check using state equation in 403 ms returned sat
[2025-06-07 17:57:01] [INFO ] Deduced a trap composed of 396 places in 237 ms of which 5 ms to minimize.
[2025-06-07 17:57:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 342 ms
[2025-06-07 17:57:02] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 71 ms.
[2025-06-07 17:57:06] [INFO ] Added : 310 causal constraints over 62 iterations in 4081 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 1227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1227/1227 places, 1472/1472 transitions.
Graph (trivial) has 1211 edges and 1227 vertex of which 80 / 1227 are part of one of the 12 SCC in 7 ms
Free SCC test removed 68 places
Drop transitions (Empty/Sink Transition effects.) removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Graph (complete) has 1645 edges and 1159 vertex of which 1151 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 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 918 transitions
Trivial Post-agglo rules discarded 918 transitions
Performed 918 trivial Post agglomeration. Transition count delta: 918
Iterating post reduction 0 with 922 rules applied. Total rules applied 924 place count 1151 transition count 458
Reduce places removed 918 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 948 rules applied. Total rules applied 1872 place count 233 transition count 428
Reduce places removed 11 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 14 rules applied. Total rules applied 1886 place count 222 transition count 425
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1889 place count 219 transition count 425
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 1889 place count 219 transition count 382
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 1975 place count 176 transition count 382
Discarding 48 places :
Symmetric choice reduction at 4 with 48 rule applications. Total rules 2023 place count 128 transition count 334
Iterating global reduction 4 with 48 rules applied. Total rules applied 2071 place count 128 transition count 334
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2071 place count 128 transition count 333
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2073 place count 127 transition count 333
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 2098 place count 102 transition count 179
Iterating global reduction 4 with 25 rules applied. Total rules applied 2123 place count 102 transition count 179
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 2135 place count 102 transition count 167
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 2141 place count 96 transition count 161
Iterating global reduction 5 with 6 rules applied. Total rules applied 2147 place count 96 transition count 161
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 2153 place count 90 transition count 155
Iterating global reduction 5 with 6 rules applied. Total rules applied 2159 place count 90 transition count 155
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 2165 place count 90 transition count 149
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 2191 place count 77 transition count 136
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 2192 place count 77 transition count 135
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2196 place count 73 transition count 131
Iterating global reduction 7 with 4 rules applied. Total rules applied 2200 place count 73 transition count 131
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2204 place count 69 transition count 127
Iterating global reduction 7 with 4 rules applied. Total rules applied 2208 place count 69 transition count 127
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2212 place count 65 transition count 123
Iterating global reduction 7 with 4 rules applied. Total rules applied 2216 place count 65 transition count 123
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 2224 place count 61 transition count 144
Free-agglomeration rule applied 24 times.
Iterating global reduction 7 with 24 rules applied. Total rules applied 2248 place count 61 transition count 120
Reduce places removed 24 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 41 rules applied. Total rules applied 2289 place count 37 transition count 103
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2293 place count 33 transition count 99
Iterating global reduction 8 with 4 rules applied. Total rules applied 2297 place count 33 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2298 place count 33 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 9 with 26 rules applied. Total rules applied 2324 place count 33 transition count 72
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 2330 place count 33 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 2333 place count 33 transition count 69
Applied a total of 2333 rules in 241 ms. Remains 33 /1227 variables (removed 1194) and now considering 69/1472 (removed 1403) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 252 ms. Remains : 33/1227 places, 69/1472 transitions.
// Phase 1: matrix 69 rows 33 cols
[2025-06-07 17:57:06] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1064 ms. (938 steps per ms)
FORMULA MedleyB-PT-B02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 283 ms. (3521 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-07 17:57:08] [INFO ] Flatten gal took : 41 ms
[2025-06-07 17:57:08] [INFO ] Flatten gal took : 10 ms
[2025-06-07 17:57:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality839108659279116682.gal : 6 ms
[2025-06-07 17:57:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18147894844791309273.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/ReachabilityCardinality839108659279116682.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18147894844791309273.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 27974 ms.

BK_STOP 1749319028425

--------------------
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="MedleyB-PT-B02"
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-B02, 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-174931349700055"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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