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.r223-tall-174902009200036.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 ShieldRVt-PT-020B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-174902009200036
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 239K May 29 14:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-00
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-01
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-02
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-03
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-04
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-05
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-06
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-07
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-08
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-09
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-10
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-11
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-12
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-13
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-14
FORMULA_NAME ShieldRVt-PT-020B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749106322191

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-05 06:52:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 06:52:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:52:03] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2025-06-05 06:52:03] [INFO ] Transformed 1003 places.
[2025-06-05 06:52:03] [INFO ] Transformed 1003 transitions.
[2025-06-05 06:52:03] [INFO ] Found NUPN structural information;
[2025-06-05 06:52:03] [INFO ] Parsed PT model containing 1003 places and 1003 transitions and 2366 arcs in 219 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1003 rows 1003 cols
[2025-06-05 06:52:03] [INFO ] Computed 81 invariants in 18 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 (2 resets) in 52 ms. (188 steps per ms)
FORMULA ShieldRVt-PT-020B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-06-05 06:52:03] [INFO ] Invariant cache hit.
[2025-06-05 06:52:04] [INFO ] [Real]Absence check using 81 positive place invariants in 38 ms returned sat
[2025-06-05 06:52:04] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2025-06-05 06:52:05] [INFO ] Deduced a trap composed of 31 places in 332 ms of which 49 ms to minimize.
[2025-06-05 06:52:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:52:05] [INFO ] [Nat]Absence check using 81 positive place invariants in 39 ms returned sat
[2025-06-05 06:52:05] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2025-06-05 06:52:06] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 5 ms to minimize.
[2025-06-05 06:52:06] [INFO ] Deduced a trap composed of 42 places in 246 ms of which 4 ms to minimize.
[2025-06-05 06:52:06] [INFO ] Deduced a trap composed of 39 places in 237 ms of which 5 ms to minimize.
[2025-06-05 06:52:06] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 4 ms to minimize.
[2025-06-05 06:52:07] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 4 ms to minimize.
[2025-06-05 06:52:07] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 4 ms to minimize.
[2025-06-05 06:52:07] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 4 ms to minimize.
[2025-06-05 06:52:07] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 4 ms to minimize.
[2025-06-05 06:52:07] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 3 ms to minimize.
[2025-06-05 06:52:08] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 4 ms to minimize.
[2025-06-05 06:52:08] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 4 ms to minimize.
[2025-06-05 06:52:08] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 4 ms to minimize.
[2025-06-05 06:52:08] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 3 ms to minimize.
[2025-06-05 06:52:08] [INFO ] Deduced a trap composed of 54 places in 153 ms of which 4 ms to minimize.
[2025-06-05 06:52:09] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 3 ms to minimize.
[2025-06-05 06:52:09] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 3 ms to minimize.
[2025-06-05 06:52:09] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 3 ms to minimize.
[2025-06-05 06:52:09] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 2 ms to minimize.
[2025-06-05 06:52:09] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 3 ms to minimize.
[2025-06-05 06:52:09] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 2 ms to minimize.
[2025-06-05 06:52:10] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 2 ms to minimize.
[2025-06-05 06:52:10] [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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-05 06:52:10] [INFO ] [Real]Absence check using 81 positive place invariants in 33 ms returned sat
[2025-06-05 06:52:10] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2025-06-05 06:52:10] [INFO ] Deduced a trap composed of 37 places in 232 ms of which 4 ms to minimize.
[2025-06-05 06:52:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:52:11] [INFO ] [Nat]Absence check using 81 positive place invariants in 34 ms returned sat
[2025-06-05 06:52:11] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2025-06-05 06:52:11] [INFO ] Deduced a trap composed of 37 places in 218 ms of which 4 ms to minimize.
[2025-06-05 06:52:11] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 4 ms to minimize.
[2025-06-05 06:52:12] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 5 ms to minimize.
[2025-06-05 06:52:12] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 4 ms to minimize.
[2025-06-05 06:52:12] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 4 ms to minimize.
[2025-06-05 06:52:12] [INFO ] Deduced a trap composed of 39 places in 186 ms of which 4 ms to minimize.
[2025-06-05 06:52:13] [INFO ] Deduced a trap composed of 53 places in 178 ms of which 3 ms to minimize.
[2025-06-05 06:52:13] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 3 ms to minimize.
[2025-06-05 06:52:13] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 4 ms to minimize.
[2025-06-05 06:52:13] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 4 ms to minimize.
[2025-06-05 06:52:13] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 3 ms to minimize.
[2025-06-05 06:52:14] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 4 ms to minimize.
[2025-06-05 06:52:14] [INFO ] Deduced a trap composed of 65 places in 140 ms of which 3 ms to minimize.
[2025-06-05 06:52:14] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 3 ms to minimize.
[2025-06-05 06:52:14] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 3 ms to minimize.
[2025-06-05 06:52:14] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 3 ms to minimize.
[2025-06-05 06:52:14] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 3 ms to minimize.
[2025-06-05 06:52:15] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 3 ms to minimize.
[2025-06-05 06:52:15] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 3 ms to minimize.
[2025-06-05 06:52:15] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 3 ms to minimize.
[2025-06-05 06:52:15] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 3 ms to minimize.
[2025-06-05 06:52:15] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 3 ms to minimize.
[2025-06-05 06:52:15] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 3 ms to minimize.
[2025-06-05 06:52:16] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 3 ms to minimize.
[2025-06-05 06:52:16] [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 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-05 06:52:16] [INFO ] [Real]Absence check using 81 positive place invariants in 34 ms returned sat
[2025-06-05 06:52:16] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2025-06-05 06:52:16] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 4 ms to minimize.
[2025-06-05 06:52:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:52:17] [INFO ] [Nat]Absence check using 81 positive place invariants in 38 ms returned sat
[2025-06-05 06:52:17] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2025-06-05 06:52:17] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 4 ms to minimize.
[2025-06-05 06:52:17] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 4 ms to minimize.
[2025-06-05 06:52:18] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 4 ms to minimize.
[2025-06-05 06:52:18] [INFO ] Deduced a trap composed of 30 places in 190 ms of which 4 ms to minimize.
[2025-06-05 06:52:18] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 4 ms to minimize.
[2025-06-05 06:52:18] [INFO ] Deduced a trap composed of 31 places in 208 ms of which 4 ms to minimize.
[2025-06-05 06:52:19] [INFO ] Deduced a trap composed of 28 places in 198 ms of which 4 ms to minimize.
[2025-06-05 06:52:19] [INFO ] Deduced a trap composed of 48 places in 190 ms of which 10 ms to minimize.
[2025-06-05 06:52:19] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 4 ms to minimize.
[2025-06-05 06:52:19] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 4 ms to minimize.
[2025-06-05 06:52:19] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 4 ms to minimize.
[2025-06-05 06:52:20] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 4 ms to minimize.
[2025-06-05 06:52:20] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 4 ms to minimize.
[2025-06-05 06:52:20] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 3 ms to minimize.
[2025-06-05 06:52:20] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 3 ms to minimize.
[2025-06-05 06:52:20] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 4 ms to minimize.
[2025-06-05 06:52:21] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 3 ms to minimize.
[2025-06-05 06:52:21] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 2 ms to minimize.
[2025-06-05 06:52:21] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 3 ms to minimize.
[2025-06-05 06:52:21] [INFO ] Deduced a trap composed of 50 places in 133 ms of which 3 ms to minimize.
[2025-06-05 06:52:21] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 3 ms to minimize.
[2025-06-05 06:52:21] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 3 ms to minimize.
[2025-06-05 06:52:21] [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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-05 06:52:22] [INFO ] [Real]Absence check using 81 positive place invariants in 32 ms returned sat
[2025-06-05 06:52:22] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2025-06-05 06:52:22] [INFO ] Deduced a trap composed of 46 places in 232 ms of which 5 ms to minimize.
[2025-06-05 06:52:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:52:22] [INFO ] [Nat]Absence check using 81 positive place invariants in 33 ms returned sat
[2025-06-05 06:52:23] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2025-06-05 06:52:23] [INFO ] Deduced a trap composed of 46 places in 236 ms of which 5 ms to minimize.
[2025-06-05 06:52:23] [INFO ] Deduced a trap composed of 29 places in 237 ms of which 4 ms to minimize.
[2025-06-05 06:52:24] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 5 ms to minimize.
[2025-06-05 06:52:24] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 5 ms to minimize.
[2025-06-05 06:52:24] [INFO ] Deduced a trap composed of 42 places in 207 ms of which 4 ms to minimize.
[2025-06-05 06:52:24] [INFO ] Deduced a trap composed of 39 places in 211 ms of which 4 ms to minimize.
[2025-06-05 06:52:25] [INFO ] Deduced a trap composed of 36 places in 213 ms of which 4 ms to minimize.
[2025-06-05 06:52:25] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 4 ms to minimize.
[2025-06-05 06:52:25] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 4 ms to minimize.
[2025-06-05 06:52:25] [INFO ] Deduced a trap composed of 36 places in 184 ms of which 5 ms to minimize.
[2025-06-05 06:52:25] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 3 ms to minimize.
[2025-06-05 06:52:26] [INFO ] Deduced a trap composed of 28 places in 198 ms of which 4 ms to minimize.
[2025-06-05 06:52:26] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 4 ms to minimize.
[2025-06-05 06:52:26] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 4 ms to minimize.
[2025-06-05 06:52:26] [INFO ] Deduced a trap composed of 44 places in 188 ms of which 4 ms to minimize.
[2025-06-05 06:52:27] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 4 ms to minimize.
[2025-06-05 06:52:27] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 4 ms to minimize.
[2025-06-05 06:52:27] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 4 ms to minimize.
[2025-06-05 06:52:27] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 4 ms to minimize.
[2025-06-05 06:52:27] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 4 ms to minimize.
[2025-06-05 06:52:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
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 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 322 rules applied. Total rules applied 322 place count 1003 transition count 681
Reduce places removed 322 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 324 rules applied. Total rules applied 646 place count 681 transition count 679
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 647 place count 680 transition count 679
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 647 place count 680 transition count 599
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 807 place count 600 transition count 599
Discarding 136 places :
Symmetric choice reduction at 3 with 136 rule applications. Total rules 943 place count 464 transition count 463
Iterating global reduction 3 with 136 rules applied. Total rules applied 1079 place count 464 transition count 463
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 1079 place count 464 transition count 405
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1195 place count 406 transition count 405
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 1 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 3 with 362 rules applied. Total rules applied 1557 place count 225 transition count 224
Renaming transitions due to excessive name length > 1024 char.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1675 place count 166 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1676 place count 166 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1677 place count 165 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1678 place count 164 transition count 278
Applied a total of 1678 rules in 185 ms. Remains 164 /1003 variables (removed 839) and now considering 278/1003 (removed 725) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 164/1003 places, 278/1003 transitions.
// Phase 1: matrix 278 rows 164 cols
[2025-06-05 06:52:28] [INFO ] Computed 80 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 (249 resets) in 3231 ms. (309 steps per ms)
FORMULA ShieldRVt-PT-020B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-020B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (19 resets) in 1372 ms. (728 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-05 06:52:32] [INFO ] Flatten gal took : 66 ms
[2025-06-05 06:52:32] [INFO ] Flatten gal took : 26 ms
[2025-06-05 06:52:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2271935088899960264.gal : 28 ms
[2025-06-05 06:52:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13289155712109173572.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/ReachabilityCardinality2271935088899960264.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13289155712109173572.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 29632 ms.

BK_STOP 1749106353102

--------------------
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="ShieldRVt-PT-020B"
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 ShieldRVt-PT-020B, 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 r223-tall-174902009200036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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