fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r265-tall-174931349600018
Last Updated
June 24, 2025

About the Execution of 2024-gold for Champagne-PT-H09T2O

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15690.590 23793.00 36442.00 221.70 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r265-tall-174931349600018.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 Champagne-PT-H09T2O, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-174931349600018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 5.9K Jun 6 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 6 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 6 11:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 6 11:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 12K Jun 6 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Jun 6 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 6 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 6 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 405K 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 Champagne-PT-H09T2O-UpperBounds-00
FORMULA_NAME Champagne-PT-H09T2O-UpperBounds-01
FORMULA_NAME Champagne-PT-H09T2O-UpperBounds-02
FORMULA_NAME Champagne-PT-H09T2O-UpperBounds-03
FORMULA_NAME Champagne-PT-H09T2O-UpperBounds-04
FORMULA_NAME Champagne-PT-H09T2O-UpperBounds-05
FORMULA_NAME Champagne-PT-H09T2O-UpperBounds-06
FORMULA_NAME Champagne-PT-H09T2O-UpperBounds-07
FORMULA_NAME Champagne-PT-H09T2O-UpperBounds-08
FORMULA_NAME Champagne-PT-H09T2O-UpperBounds-09
FORMULA_NAME Champagne-PT-H09T2O-UpperBounds-10
FORMULA_NAME Champagne-PT-H09T2O-UpperBounds-11
FORMULA_NAME Champagne-PT-H09T2O-UpperBounds-12
FORMULA_NAME Champagne-PT-H09T2O-UpperBounds-13
FORMULA_NAME Champagne-PT-H09T2O-UpperBounds-14
FORMULA_NAME Champagne-PT-H09T2O-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749318795187

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H09T2O
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-07 17:53:16] [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:53:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:53:16] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2025-06-07 17:53:16] [INFO ] Transformed 1861 places.
[2025-06-07 17:53:16] [INFO ] Transformed 2552 transitions.
[2025-06-07 17:53:16] [INFO ] Found NUPN structural information;
[2025-06-07 17:53:16] [INFO ] Parsed PT model containing 1861 places and 2552 transitions and 6380 arcs in 248 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 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 2552 rows 1861 cols
[2025-06-07 17:53:16] [INFO ] Computed 49 invariants in 50 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 (6 resets) in 67 ms. (147 steps per ms)
FORMULA Champagne-PT-H09T2O-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H09T2O-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H09T2O-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H09T2O-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H09T2O-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H09T2O-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H09T2O-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H09T2O-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H09T2O-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H09T2O-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H09T2O-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H09T2O-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H09T2O-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (6 resets) in 31 ms. (937 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2025-06-07 17:53:16] [INFO ] Invariant cache hit.
[2025-06-07 17:53:17] [INFO ] [Real]Absence check using 49 positive place invariants in 46 ms returned sat
[2025-06-07 17:53:18] [INFO ] [Real]Absence check using state equation in 735 ms returned sat
[2025-06-07 17:53:18] [INFO ] Computed and/alt/rep : 2458/6373/2458 causal constraints (skipped 93 transitions) in 172 ms.
[2025-06-07 17:53:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:53:19] [INFO ] [Nat]Absence check using 49 positive place invariants in 48 ms returned sat
[2025-06-07 17:53:20] [INFO ] [Nat]Absence check using state equation in 698 ms returned sat
[2025-06-07 17:53:20] [INFO ] Computed and/alt/rep : 2458/6373/2458 causal constraints (skipped 93 transitions) in 147 ms.
[2025-06-07 17:53:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.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:53:24] [INFO ] [Real]Absence check using 49 positive place invariants in 45 ms returned sat
[2025-06-07 17:53:25] [INFO ] [Real]Absence check using state equation in 701 ms returned sat
[2025-06-07 17:53:25] [INFO ] Computed and/alt/rep : 2458/6373/2458 causal constraints (skipped 93 transitions) in 134 ms.
[2025-06-07 17:53:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:53:26] [INFO ] [Nat]Absence check using 49 positive place invariants in 44 ms returned sat
[2025-06-07 17:53:27] [INFO ] [Nat]Absence check using state equation in 697 ms returned sat
[2025-06-07 17:53:27] [INFO ] Computed and/alt/rep : 2458/6373/2458 causal constraints (skipped 93 transitions) in 127 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-06-07 17:53:31] [INFO ] [Real]Absence check using 49 positive place invariants in 41 ms returned sat
[2025-06-07 17:53:32] [INFO ] [Real]Absence check using state equation in 719 ms returned sat
[2025-06-07 17:53:32] [INFO ] Deduced a trap composed of 264 places in 434 ms of which 53 ms to minimize.
[2025-06-07 17:53:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:53:33] [INFO ] [Nat]Absence check using 49 positive place invariants in 47 ms returned sat
[2025-06-07 17:53:33] [INFO ] [Nat]Absence check using state equation in 660 ms returned sat
[2025-06-07 17:53:34] [INFO ] Deduced a trap composed of 264 places in 375 ms of which 7 ms to minimize.
[2025-06-07 17:53:34] [INFO ] Deduced a trap composed of 438 places in 307 ms of which 6 ms to minimize.
[2025-06-07 17:53:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 905 ms
[2025-06-07 17:53:34] [INFO ] Computed and/alt/rep : 2458/6373/2458 causal constraints (skipped 93 transitions) in 125 ms.
[2025-06-07 17:53:37] [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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 1861 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1861/1861 places, 2552/2552 transitions.
Graph (trivial) has 1931 edges and 1861 vertex of which 935 / 1861 are part of one of the 49 SCC in 9 ms
Free SCC test removed 886 places
Drop transitions (Empty/Sink Transition effects.) removed 1011 transitions
Reduce isomorphic transitions removed 1011 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 482 transitions
Trivial Post-agglo rules discarded 482 transitions
Performed 482 trivial Post agglomeration. Transition count delta: 482
Iterating post reduction 0 with 482 rules applied. Total rules applied 483 place count 975 transition count 1059
Reduce places removed 482 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 1 with 575 rules applied. Total rules applied 1058 place count 493 transition count 966
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 47 rules applied. Total rules applied 1105 place count 447 transition count 965
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1106 place count 446 transition count 965
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1106 place count 446 transition count 963
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1110 place count 444 transition count 963
Discarding 168 places :
Symmetric choice reduction at 4 with 168 rule applications. Total rules 1278 place count 276 transition count 795
Iterating global reduction 4 with 168 rules applied. Total rules applied 1446 place count 276 transition count 795
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1446 place count 276 transition count 748
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1540 place count 229 transition count 748
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 1576 place count 193 transition count 469
Iterating global reduction 4 with 36 rules applied. Total rules applied 1612 place count 193 transition count 469
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 4 with 35 rules applied. Total rules applied 1647 place count 193 transition count 434
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 100 rules applied. Total rules applied 1747 place count 143 transition count 384
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1753 place count 140 transition count 393
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1761 place count 140 transition count 385
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 1768 place count 140 transition count 378
Free-agglomeration rule applied 82 times.
Iterating global reduction 6 with 82 rules applied. Total rules applied 1850 place count 140 transition count 296
Reduce places removed 82 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 271 transitions
Reduce isomorphic transitions removed 271 transitions.
Graph (complete) has 174 edges and 58 vertex of which 14 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.1 ms
Discarding 44 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Iterating post reduction 6 with 354 rules applied. Total rules applied 2204 place count 14 transition count 21
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 2205 place count 14 transition count 20
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 2208 place count 11 transition count 11
Iterating global reduction 8 with 3 rules applied. Total rules applied 2211 place count 11 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 2212 place count 11 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2212 place count 11 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2214 place count 10 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 2215 place count 9 transition count 8
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2217 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2218 place count 7 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 2218 place count 7 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2220 place count 6 transition count 6
Applied a total of 2220 rules in 209 ms. Remains 6 /1861 variables (removed 1855) and now considering 6/2552 (removed 2546) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 6/1861 places, 6/2552 transitions.
// Phase 1: matrix 6 rows 6 cols
[2025-06-07 17:53:38] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 417 ms. (2392 steps per ms)
FORMULA Champagne-PT-H09T2O-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H09T2O-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Champagne-PT-H09T2O-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 179 ms. (5555 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:53:38] [INFO ] Flatten gal took : 238 ms
[2025-06-07 17:53:38] [INFO ] Flatten gal took : 2 ms
[2025-06-07 17:53:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13597355963118366998.gal : 3 ms
[2025-06-07 17:53:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality168081183133410718.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/ReachabilityCardinality13597355963118366998.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality168081183133410718.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 22503 ms.

BK_STOP 1749318818980

--------------------
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="Champagne-PT-H09T2O"
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 Champagne-PT-H09T2O, 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-174931349600018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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