About the Execution of 2024-gold for Diffusion2D-PT-D10N200
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.r069-smll-174854075900060.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 Diffusion2D-PT-D10N200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-174854075900060
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 756K
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 128K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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:32 equiv_col
-rw-r--r-- 1 mcc users 8 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 255K May 29 14:32 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 Diffusion2D-PT-D10N200-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D10N200-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748605233272
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D10N200
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 11:40:35] [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-05-30 11:40:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:40:35] [INFO ] Load time of PNML (sax parser for PT used): 225 ms
[2025-05-30 11:40:35] [INFO ] Transformed 100 places.
[2025-05-30 11:40:35] [INFO ] Transformed 684 transitions.
[2025-05-30 11:40:35] [INFO ] Parsed PT model containing 100 places and 684 transitions and 1368 arcs in 429 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 684 rows 100 cols
[2025-05-30 11:40:35] [INFO ] Computed 1 invariants in 53 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:[200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200, 200]
RANDOM walk for 10052 steps (2 resets) in 11 ms. (837 steps per ms)
FORMULA Diffusion2D-PT-D10N200-UpperBounds-14 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-12 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-11 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-09 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-03 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-01 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100010 steps (20 resets) in 151 ms. (657 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 2, 2, 1, 1, 2, 1, 2, 4, 5] Max Struct:[200, 200, 200, 200, 200, 200, 200, 200, 200, 200]
[2025-05-30 11:40:36] [INFO ] Invariant cache hit.
[2025-05-30 11:40:36] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2025-05-30 11:40:36] [INFO ] [Real]Absence check using state equation in 430 ms returned sat
[2025-05-30 11:40:37] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 164 ms.
[2025-05-30 11:40:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:40:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2025-05-30 11:40:37] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2025-05-30 11:40:37] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 124 ms.
[2025-05-30 11:40:42] [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 0
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-05-30 11:40:42] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-05-30 11:40:42] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2025-05-30 11:40:42] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 110 ms.
[2025-05-30 11:40:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:40:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 21 ms returned sat
[2025-05-30 11:40:43] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2025-05-30 11:40:43] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 95 ms.
[2025-05-30 11:40:48] [INFO ] Added : 270 causal constraints over 54 iterations in 4550 ms. Result :unknown
[2025-05-30 11:40:48] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-05-30 11:40:48] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2025-05-30 11:40:48] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 110 ms.
[2025-05-30 11:40:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:40:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2025-05-30 11:40:48] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2025-05-30 11:40:49] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 91 ms.
[2025-05-30 11:40:53] [INFO ] Added : 260 causal constraints over 52 iterations in 4692 ms. Result :unknown
[2025-05-30 11:40:53] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-05-30 11:40:53] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2025-05-30 11:40:54] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 85 ms.
[2025-05-30 11:40:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:40:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-05-30 11:40:54] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2025-05-30 11:40:54] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 86 ms.
[2025-05-30 11:40:59] [INFO ] Added : 275 causal constraints over 55 iterations in 4708 ms. Result :unknown
[2025-05-30 11:40:59] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2025-05-30 11:40:59] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2025-05-30 11:40:59] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 82 ms.
[2025-05-30 11:40:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:40:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2025-05-30 11:41:00] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2025-05-30 11:41:00] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 80 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2025-05-30 11:41:04] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-05-30 11:41:05] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2025-05-30 11:41:05] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 80 ms.
[2025-05-30 11:41:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:41:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2025-05-30 11:41:05] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2025-05-30 11:41:05] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 74 ms.
[2025-05-30 11:41:10] [INFO ] Added : 265 causal constraints over 53 iterations in 4708 ms. Result :unknown
[2025-05-30 11:41:10] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-05-30 11:41:10] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2025-05-30 11:41:10] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 82 ms.
[2025-05-30 11:41:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:41:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-05-30 11:41:11] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2025-05-30 11:41:11] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 78 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-30 11:41:15] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2025-05-30 11:41:16] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2025-05-30 11:41:16] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 97 ms.
[2025-05-30 11:41:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:41:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-05-30 11:41:16] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2025-05-30 11:41:16] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 87 ms.
[2025-05-30 11:41:21] [INFO ] Added : 270 causal constraints over 54 iterations in 4700 ms. Result :unknown
[2025-05-30 11:41:21] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-05-30 11:41:21] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2025-05-30 11:41:21] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 52 ms.
[2025-05-30 11:41:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:41:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-05-30 11:41:22] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2025-05-30 11:41:22] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 63 ms.
[2025-05-30 11:41:26] [INFO ] Added : 295 causal constraints over 59 iterations in 4757 ms. Result :unknown
[2025-05-30 11:41:26] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2025-05-30 11:41:27] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2025-05-30 11:41:27] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 82 ms.
[2025-05-30 11:41:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:41:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2025-05-30 11:41:27] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2025-05-30 11:41:27] [INFO ] Computed and/alt/rep : 676/4868/676 causal constraints (skipped 0 transitions) in 79 ms.
[2025-05-30 11:41:32] [INFO ] Added : 290 causal constraints over 58 iterations in 4720 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1, 2, 2, 1, 1, 2, 1, 2, 4, 5] Max Struct:[200, 200, 200, 200, 200, 200, 200, 200, 200, 200]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 15, 7, 3, 194, 5, 4, 193, 194, 195] Max Struct:[200, 200, 200, 200, 200, 200, 200, 200, 200, 200]
Support contains 10 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 684/684 transitions.
Graph (trivial) has 574 edges and 100 vertex of which 90 / 100 are part of one of the 1 SCC in 4 ms
Free SCC test removed 89 places
Drop transitions (Empty/Sink Transition effects.) removed 574 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 660 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 11 transition count 18
Applied a total of 7 rules in 48 ms. Remains 11 /100 variables (removed 89) and now considering 18/684 (removed 666) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 11/100 places, 18/684 transitions.
// Phase 1: matrix 18 rows 11 cols
[2025-05-30 11:41:40] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6, 15, 7, 3, 194, 5, 4, 193, 194, 195] Max Struct:[200, 200, 200, 200, 200, 200, 200, 200, 200, 200]
RANDOM walk for 1000189 steps (2 resets) in 119 ms. (8334 steps per ms)
FORMULA Diffusion2D-PT-D10N200-UpperBounds-15 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-13 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-10 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-08 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-07 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-06 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-05 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-04 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-02 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D10N200-UpperBounds-00 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 650 ms. (1536 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-05-30 11:41:41] [INFO ] Flatten gal took : 181 ms
[2025-05-30 11:41:41] [INFO ] Flatten gal took : 5 ms
[2025-05-30 11:41:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7951523992573180092.gal : 6 ms
[2025-05-30 11:41:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14468815742820163431.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/ReachabilityCardinality7951523992573180092.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14468815742820163431.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 66566 ms.
BK_STOP 1748605301812
--------------------
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="Diffusion2D-PT-D10N200"
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 Diffusion2D-PT-D10N200, 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 r069-smll-174854075900060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D10N200.tgz
mv Diffusion2D-PT-D10N200 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 '
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 ;