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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 792K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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 28K 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 115K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K 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 364K 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-030B-UpperBounds-00
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-01
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-02
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-03
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-04
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-05
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-06
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-07
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-08
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-09
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-10
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-11
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-12
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-13
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-14
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749106327079

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-030B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-05 06:52:08] [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:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:52:08] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2025-06-05 06:52:08] [INFO ] Transformed 1503 places.
[2025-06-05 06:52:08] [INFO ] Transformed 1503 transitions.
[2025-06-05 06:52:08] [INFO ] Found NUPN structural information;
[2025-06-05 06:52:08] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 253 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 1503 rows 1503 cols
[2025-06-05 06:52:08] [INFO ] Computed 121 invariants in 43 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 65 ms. (151 steps per ms)
FORMULA ShieldRVt-PT-030B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80006 steps (16 resets) in 96 ms. (824 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-05 06:52:09] [INFO ] Invariant cache hit.
[2025-06-05 06:52:09] [INFO ] [Real]Absence check using 121 positive place invariants in 76 ms returned sat
[2025-06-05 06:52:09] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2025-06-05 06:52:10] [INFO ] Deduced a trap composed of 27 places in 627 ms of which 59 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 121 positive place invariants in 53 ms returned sat
[2025-06-05 06:52:11] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2025-06-05 06:52:11] [INFO ] Deduced a trap composed of 27 places in 331 ms of which 9 ms to minimize.
[2025-06-05 06:52:12] [INFO ] Deduced a trap composed of 29 places in 333 ms of which 6 ms to minimize.
[2025-06-05 06:52:12] [INFO ] Deduced a trap composed of 35 places in 312 ms of which 6 ms to minimize.
[2025-06-05 06:52:13] [INFO ] Deduced a trap composed of 61 places in 281 ms of which 6 ms to minimize.
[2025-06-05 06:52:13] [INFO ] Deduced a trap composed of 44 places in 307 ms of which 6 ms to minimize.
[2025-06-05 06:52:13] [INFO ] Deduced a trap composed of 36 places in 277 ms of which 6 ms to minimize.
[2025-06-05 06:52:14] [INFO ] Deduced a trap composed of 32 places in 302 ms of which 6 ms to minimize.
[2025-06-05 06:52:14] [INFO ] Deduced a trap composed of 29 places in 301 ms of which 6 ms to minimize.
[2025-06-05 06:52:14] [INFO ] Deduced a trap composed of 44 places in 274 ms of which 6 ms to minimize.
[2025-06-05 06:52:15] [INFO ] Deduced a trap composed of 39 places in 278 ms of which 5 ms to minimize.
[2025-06-05 06:52:15] [INFO ] Deduced a trap composed of 23 places in 302 ms of which 7 ms to minimize.
[2025-06-05 06:52:15] [INFO ] Deduced a trap composed of 44 places in 275 ms of which 6 ms to minimize.
[2025-06-05 06:52:16] [INFO ] Deduced a trap composed of 35 places in 260 ms of which 5 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 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:16] [INFO ] [Real]Absence check using 121 positive place invariants in 55 ms returned sat
[2025-06-05 06:52:16] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2025-06-05 06:52:17] [INFO ] Deduced a trap composed of 26 places in 336 ms of which 6 ms to minimize.
[2025-06-05 06:52:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:52:17] [INFO ] [Nat]Absence check using 121 positive place invariants in 55 ms returned sat
[2025-06-05 06:52:18] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2025-06-05 06:52:18] [INFO ] Deduced a trap composed of 26 places in 344 ms of which 7 ms to minimize.
[2025-06-05 06:52:18] [INFO ] Deduced a trap composed of 33 places in 321 ms of which 6 ms to minimize.
[2025-06-05 06:52:19] [INFO ] Deduced a trap composed of 32 places in 318 ms of which 7 ms to minimize.
[2025-06-05 06:52:19] [INFO ] Deduced a trap composed of 51 places in 309 ms of which 6 ms to minimize.
[2025-06-05 06:52:20] [INFO ] Deduced a trap composed of 26 places in 306 ms of which 6 ms to minimize.
[2025-06-05 06:52:20] [INFO ] Deduced a trap composed of 31 places in 293 ms of which 6 ms to minimize.
[2025-06-05 06:52:20] [INFO ] Deduced a trap composed of 27 places in 290 ms of which 6 ms to minimize.
[2025-06-05 06:52:21] [INFO ] Deduced a trap composed of 27 places in 287 ms of which 8 ms to minimize.
[2025-06-05 06:52:21] [INFO ] Deduced a trap composed of 42 places in 279 ms of which 5 ms to minimize.
[2025-06-05 06:52:21] [INFO ] Deduced a trap composed of 42 places in 271 ms of which 5 ms to minimize.
[2025-06-05 06:52:22] [INFO ] Deduced a trap composed of 31 places in 259 ms of which 6 ms to minimize.
[2025-06-05 06:52:22] [INFO ] Deduced a trap composed of 45 places in 259 ms of which 6 ms to minimize.
[2025-06-05 06:52:22] [INFO ] Deduced a trap composed of 27 places in 245 ms of which 6 ms to minimize.
[2025-06-05 06:52:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:22] [INFO ] [Real]Absence check using 121 positive place invariants in 52 ms returned sat
[2025-06-05 06:52:23] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2025-06-05 06:52:23] [INFO ] Deduced a trap composed of 35 places in 273 ms of which 6 ms to minimize.
[2025-06-05 06:52:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:52:24] [INFO ] [Nat]Absence check using 121 positive place invariants in 54 ms returned sat
[2025-06-05 06:52:24] [INFO ] [Nat]Absence check using state equation in 462 ms returned sat
[2025-06-05 06:52:24] [INFO ] Deduced a trap composed of 35 places in 282 ms of which 6 ms to minimize.
[2025-06-05 06:52:25] [INFO ] Deduced a trap composed of 35 places in 280 ms of which 6 ms to minimize.
[2025-06-05 06:52:25] [INFO ] Deduced a trap composed of 19 places in 278 ms of which 6 ms to minimize.
[2025-06-05 06:52:25] [INFO ] Deduced a trap composed of 26 places in 273 ms of which 5 ms to minimize.
[2025-06-05 06:52:26] [INFO ] Deduced a trap composed of 24 places in 258 ms of which 8 ms to minimize.
[2025-06-05 06:52:26] [INFO ] Deduced a trap composed of 26 places in 270 ms of which 5 ms to minimize.
[2025-06-05 06:52:26] [INFO ] Deduced a trap composed of 41 places in 251 ms of which 5 ms to minimize.
[2025-06-05 06:52:27] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 5 ms to minimize.
[2025-06-05 06:52:27] [INFO ] Deduced a trap composed of 36 places in 235 ms of which 4 ms to minimize.
[2025-06-05 06:52:27] [INFO ] Deduced a trap composed of 27 places in 227 ms of which 5 ms to minimize.
[2025-06-05 06:52:27] [INFO ] Deduced a trap composed of 45 places in 214 ms of which 4 ms to minimize.
[2025-06-05 06:52:28] [INFO ] Deduced a trap composed of 51 places in 197 ms of which 4 ms to minimize.
[2025-06-05 06:52:28] [INFO ] Deduced a trap composed of 58 places in 186 ms of which 3 ms to minimize.
[2025-06-05 06:52:28] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 4 ms to minimize.
[2025-06-05 06:52:28] [INFO ] Deduced a trap composed of 43 places in 176 ms of which 3 ms to minimize.
[2025-06-05 06:52:28] [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:29] [INFO ] [Real]Absence check using 121 positive place invariants in 53 ms returned sat
[2025-06-05 06:52:29] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2025-06-05 06:52:30] [INFO ] Deduced a trap composed of 23 places in 339 ms of which 6 ms to minimize.
[2025-06-05 06:52:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:52:30] [INFO ] [Nat]Absence check using 121 positive place invariants in 55 ms returned sat
[2025-06-05 06:52:30] [INFO ] [Nat]Absence check using state equation in 471 ms returned sat
[2025-06-05 06:52:31] [INFO ] Deduced a trap composed of 23 places in 335 ms of which 6 ms to minimize.
[2025-06-05 06:52:31] [INFO ] Deduced a trap composed of 64 places in 336 ms of which 6 ms to minimize.
[2025-06-05 06:52:32] [INFO ] Deduced a trap composed of 46 places in 315 ms of which 7 ms to minimize.
[2025-06-05 06:52:32] [INFO ] Deduced a trap composed of 24 places in 341 ms of which 7 ms to minimize.
[2025-06-05 06:52:32] [INFO ] Deduced a trap composed of 40 places in 339 ms of which 7 ms to minimize.
[2025-06-05 06:52:33] [INFO ] Deduced a trap composed of 25 places in 339 ms of which 7 ms to minimize.
[2025-06-05 06:52:33] [INFO ] Deduced a trap composed of 22 places in 329 ms of which 7 ms to minimize.
[2025-06-05 06:52:34] [INFO ] Deduced a trap composed of 34 places in 332 ms of which 7 ms to minimize.
[2025-06-05 06:52:34] [INFO ] Deduced a trap composed of 26 places in 366 ms of which 6 ms to minimize.
[2025-06-05 06:52:34] [INFO ] Deduced a trap composed of 36 places in 302 ms of which 6 ms to minimize.
[2025-06-05 06:52:35] [INFO ] Deduced a trap composed of 32 places in 302 ms of which 6 ms to minimize.
[2025-06-05 06:52:35] [INFO ] Deduced a trap composed of 32 places in 519 ms of which 6 ms to minimize.
[2025-06-05 06:52:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-05 06:52:36] [INFO ] [Real]Absence check using 121 positive place invariants in 52 ms returned sat
[2025-06-05 06:52:36] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2025-06-05 06:52:36] [INFO ] Deduced a trap composed of 46 places in 325 ms of which 6 ms to minimize.
[2025-06-05 06:52:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:52:37] [INFO ] [Nat]Absence check using 121 positive place invariants in 53 ms returned sat
[2025-06-05 06:52:37] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2025-06-05 06:52:38] [INFO ] Deduced a trap composed of 46 places in 306 ms of which 7 ms to minimize.
[2025-06-05 06:52:38] [INFO ] Deduced a trap composed of 41 places in 316 ms of which 6 ms to minimize.
[2025-06-05 06:52:38] [INFO ] Deduced a trap composed of 30 places in 317 ms of which 6 ms to minimize.
[2025-06-05 06:52:39] [INFO ] Deduced a trap composed of 32 places in 312 ms of which 6 ms to minimize.
[2025-06-05 06:52:39] [INFO ] Deduced a trap composed of 28 places in 274 ms of which 5 ms to minimize.
[2025-06-05 06:52:39] [INFO ] Deduced a trap composed of 44 places in 274 ms of which 6 ms to minimize.
[2025-06-05 06:52:40] [INFO ] Deduced a trap composed of 40 places in 280 ms of which 6 ms to minimize.
[2025-06-05 06:52:40] [INFO ] Deduced a trap composed of 39 places in 272 ms of which 6 ms to minimize.
[2025-06-05 06:52:40] [INFO ] Deduced a trap composed of 60 places in 262 ms of which 5 ms to minimize.
[2025-06-05 06:52:41] [INFO ] Deduced a trap composed of 27 places in 237 ms of which 5 ms to minimize.
[2025-06-05 06:52:41] [INFO ] Deduced a trap composed of 44 places in 225 ms of which 5 ms to minimize.
[2025-06-05 06:52:41] [INFO ] Deduced a trap composed of 54 places in 222 ms of which 5 ms to minimize.
[2025-06-05 06:52:41] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 5 ms to minimize.
[2025-06-05 06:52:42] [INFO ] Deduced a trap composed of 36 places in 213 ms of which 4 ms to minimize.
[2025-06-05 06:52: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: Stream close... while checking expression at index 4
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:42] [INFO ] [Real]Absence check using 121 positive place invariants in 53 ms returned sat
[2025-06-05 06:52:42] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2025-06-05 06:52:43] [INFO ] Deduced a trap composed of 51 places in 328 ms of which 7 ms to minimize.
[2025-06-05 06:52:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:52:43] [INFO ] [Nat]Absence check using 121 positive place invariants in 51 ms returned sat
[2025-06-05 06:52:44] [INFO ] [Nat]Absence check using state equation in 460 ms returned sat
[2025-06-05 06:52:44] [INFO ] Deduced a trap composed of 51 places in 322 ms of which 7 ms to minimize.
[2025-06-05 06:52:44] [INFO ] Deduced a trap composed of 35 places in 312 ms of which 7 ms to minimize.
[2025-06-05 06:52:45] [INFO ] Deduced a trap composed of 30 places in 314 ms of which 7 ms to minimize.
[2025-06-05 06:52:45] [INFO ] Deduced a trap composed of 35 places in 304 ms of which 6 ms to minimize.
[2025-06-05 06:52:46] [INFO ] Deduced a trap composed of 34 places in 311 ms of which 7 ms to minimize.
[2025-06-05 06:52:46] [INFO ] Deduced a trap composed of 30 places in 340 ms of which 6 ms to minimize.
[2025-06-05 06:52:46] [INFO ] Deduced a trap composed of 26 places in 301 ms of which 7 ms to minimize.
[2025-06-05 06:52:47] [INFO ] Deduced a trap composed of 42 places in 377 ms of which 6 ms to minimize.
[2025-06-05 06:52:47] [INFO ] Deduced a trap composed of 26 places in 322 ms of which 6 ms to minimize.
[2025-06-05 06:52:47] [INFO ] Deduced a trap composed of 43 places in 302 ms of which 6 ms to minimize.
[2025-06-05 06:52:48] [INFO ] Deduced a trap composed of 50 places in 291 ms of which 5 ms to minimize.
[2025-06-05 06:52:48] [INFO ] Deduced a trap composed of 28 places in 300 ms of which 7 ms to minimize.
[2025-06-05 06:52:48] [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 5
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:48] [INFO ] [Real]Absence check using 121 positive place invariants in 50 ms returned sat
[2025-06-05 06:52:49] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2025-06-05 06:52:49] [INFO ] Deduced a trap composed of 27 places in 349 ms of which 6 ms to minimize.
[2025-06-05 06:52:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:52:50] [INFO ] [Nat]Absence check using 121 positive place invariants in 53 ms returned sat
[2025-06-05 06:52:50] [INFO ] [Nat]Absence check using state equation in 483 ms returned sat
[2025-06-05 06:52:51] [INFO ] Deduced a trap composed of 27 places in 351 ms of which 19 ms to minimize.
[2025-06-05 06:52:51] [INFO ] Deduced a trap composed of 46 places in 352 ms of which 6 ms to minimize.
[2025-06-05 06:52:51] [INFO ] Deduced a trap composed of 39 places in 326 ms of which 6 ms to minimize.
[2025-06-05 06:52:52] [INFO ] Deduced a trap composed of 25 places in 325 ms of which 7 ms to minimize.
[2025-06-05 06:52:52] [INFO ] Deduced a trap composed of 26 places in 291 ms of which 5 ms to minimize.
[2025-06-05 06:52:52] [INFO ] Deduced a trap composed of 46 places in 291 ms of which 6 ms to minimize.
[2025-06-05 06:52:53] [INFO ] Deduced a trap composed of 42 places in 305 ms of which 6 ms to minimize.
[2025-06-05 06:52:53] [INFO ] Deduced a trap composed of 43 places in 290 ms of which 6 ms to minimize.
[2025-06-05 06:52:53] [INFO ] Deduced a trap composed of 25 places in 285 ms of which 6 ms to minimize.
[2025-06-05 06:52:54] [INFO ] Deduced a trap composed of 29 places in 289 ms of which 6 ms to minimize.
[2025-06-05 06:52:54] [INFO ] Deduced a trap composed of 38 places in 256 ms of which 6 ms to minimize.
[2025-06-05 06:52:54] [INFO ] Deduced a trap composed of 51 places in 251 ms of which 5 ms to minimize.
[2025-06-05 06:52:55] [INFO ] Deduced a trap composed of 40 places in 253 ms of which 5 ms to minimize.
[2025-06-05 06:52:55] [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 6
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:55] [INFO ] [Real]Absence check using 121 positive place invariants in 51 ms returned sat
[2025-06-05 06:52:55] [INFO ] [Real]Absence check using state equation in 477 ms returned sat
[2025-06-05 06:52:56] [INFO ] Deduced a trap composed of 27 places in 349 ms of which 6 ms to minimize.
[2025-06-05 06:52:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:52:56] [INFO ] [Nat]Absence check using 121 positive place invariants in 54 ms returned sat
[2025-06-05 06:52:57] [INFO ] [Nat]Absence check using state equation in 462 ms returned sat
[2025-06-05 06:52:57] [INFO ] Deduced a trap composed of 27 places in 361 ms of which 7 ms to minimize.
[2025-06-05 06:52:57] [INFO ] Deduced a trap composed of 29 places in 337 ms of which 6 ms to minimize.
[2025-06-05 06:52:58] [INFO ] Deduced a trap composed of 28 places in 317 ms of which 6 ms to minimize.
[2025-06-05 06:52:58] [INFO ] Deduced a trap composed of 37 places in 310 ms of which 6 ms to minimize.
[2025-06-05 06:52:59] [INFO ] Deduced a trap composed of 23 places in 312 ms of which 6 ms to minimize.
[2025-06-05 06:52:59] [INFO ] Deduced a trap composed of 22 places in 296 ms of which 6 ms to minimize.
[2025-06-05 06:52:59] [INFO ] Deduced a trap composed of 37 places in 298 ms of which 5 ms to minimize.
[2025-06-05 06:53:00] [INFO ] Deduced a trap composed of 29 places in 289 ms of which 5 ms to minimize.
[2025-06-05 06:53:00] [INFO ] Deduced a trap composed of 45 places in 286 ms of which 6 ms to minimize.
[2025-06-05 06:53:00] [INFO ] Deduced a trap composed of 19 places in 282 ms of which 5 ms to minimize.
[2025-06-05 06:53:01] [INFO ] Deduced a trap composed of 33 places in 246 ms of which 6 ms to minimize.
[2025-06-05 06:53:01] [INFO ] Deduced a trap composed of 41 places in 256 ms of which 6 ms to minimize.
[2025-06-05 06:53:01] [INFO ] Deduced a trap composed of 40 places in 258 ms of which 5 ms to minimize.
[2025-06-05 06:53:01] [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 7
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, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 1503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 473 transitions
Trivial Post-agglo rules discarded 473 transitions
Performed 473 trivial Post agglomeration. Transition count delta: 473
Iterating post reduction 0 with 473 rules applied. Total rules applied 473 place count 1503 transition count 1030
Reduce places removed 473 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 475 rules applied. Total rules applied 948 place count 1030 transition count 1028
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 7 rules applied. Total rules applied 955 place count 1029 transition count 1022
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 961 place count 1023 transition count 1022
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 120 Pre rules applied. Total rules applied 961 place count 1023 transition count 902
Deduced a syphon composed of 120 places in 2 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 4 with 240 rules applied. Total rules applied 1201 place count 903 transition count 902
Discarding 208 places :
Symmetric choice reduction at 4 with 208 rule applications. Total rules 1409 place count 695 transition count 694
Iterating global reduction 4 with 208 rules applied. Total rules applied 1617 place count 695 transition count 694
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 86 Pre rules applied. Total rules applied 1617 place count 695 transition count 608
Deduced a syphon composed of 86 places in 2 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 1789 place count 609 transition count 608
Performed 270 Post agglomeration using F-continuation condition.Transition count delta: 270
Deduced a syphon composed of 270 places in 1 ms
Reduce places removed 270 places and 0 transitions.
Iterating global reduction 4 with 540 rules applied. Total rules applied 2329 place count 339 transition count 338
Renaming transitions due to excessive name length > 1024 char.
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: -79
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 2497 place count 255 transition count 417
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2498 place count 255 transition count 416
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2499 place count 255 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2500 place count 254 transition count 415
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2501 place count 254 transition count 414
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2502 place count 253 transition count 413
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2503 place count 252 transition count 413
Applied a total of 2503 rules in 327 ms. Remains 252 /1503 variables (removed 1251) and now considering 413/1503 (removed 1090) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 338 ms. Remains : 252/1503 places, 413/1503 transitions.
// Phase 1: matrix 413 rows 252 cols
[2025-06-05 06:53:01] [INFO ] Computed 120 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (275 resets) in 3818 ms. (261 steps per ms)
FORMULA ShieldRVt-PT-030B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (28 resets) in 1955 ms. (511 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-05 06:53:08] [INFO ] Flatten gal took : 116 ms
[2025-06-05 06:53:08] [INFO ] Flatten gal took : 34 ms
[2025-06-05 06:53:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10495633925925172957.gal : 41 ms
[2025-06-05 06:53:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality704546118671555871.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/ReachabilityCardinality10495633925925172957.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality704546118671555871.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
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 59834 ms.

BK_STOP 1749106388289

--------------------
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-030B"
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-030B, 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-174902009200038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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