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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.8K 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.2K 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 105K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K 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 1.3M 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-100B-UpperBounds-00
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-01
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-02
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-03
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-04
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-05
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-06
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-07
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-08
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-09
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-10
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-11
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-12
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-13
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-14
FORMULA_NAME ShieldRVt-PT-100B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749106362098

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-100B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-05 06:52:43] [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:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:52:43] [INFO ] Load time of PNML (sax parser for PT used): 226 ms
[2025-06-05 06:52:43] [INFO ] Transformed 5003 places.
[2025-06-05 06:52:43] [INFO ] Transformed 5003 transitions.
[2025-06-05 06:52:43] [INFO ] Found NUPN structural information;
[2025-06-05 06:52:43] [INFO ] Parsed PT model containing 5003 places and 5003 transitions and 11806 arcs in 472 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 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 5003 rows 5003 cols
[2025-06-05 06:52:44] [INFO ] Computed 401 invariants in 85 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 103 ms. (96 steps per ms)
FORMULA ShieldRVt-PT-100B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-100B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-100B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-100B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-100B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-100B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-100B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-100B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80006 steps (16 resets) in 111 ms. (714 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:44] [INFO ] Invariant cache hit.
[2025-06-05 06:52:45] [INFO ] [Real]Absence check using 401 positive place invariants in 302 ms returned sat
[2025-06-05 06:52:48] [INFO ] [Real]Absence check using state equation in 2401 ms returned sat
[2025-06-05 06:52:51] [INFO ] Deduced a trap composed of 38 places in 2652 ms of which 192 ms to minimize.
[2025-06-05 06:52:51] [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:2249)
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:52] [INFO ] [Real]Absence check using 401 positive place invariants in 315 ms returned sat
[2025-06-05 06:52:54] [INFO ] [Real]Absence check using state equation in 2369 ms returned sat
[2025-06-05 06:52:57] [INFO ] Deduced a trap composed of 25 places in 2437 ms of which 26 ms to minimize.
[2025-06-05 06:52:57] [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:2249)
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:58] [INFO ] [Real]Absence check using 401 positive place invariants in 298 ms returned sat
[2025-06-05 06:53:00] [INFO ] [Real]Absence check using state equation in 2427 ms returned sat
[2025-06-05 06:53:03] [INFO ] Deduced a trap composed of 36 places in 2609 ms of which 28 ms to minimize.
[2025-06-05 06:53:03] [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:2249)
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:53:04] [INFO ] [Real]Absence check using 401 positive place invariants in 283 ms returned sat
[2025-06-05 06:53:07] [INFO ] [Real]Absence check using state equation in 2251 ms returned sat
[2025-06-05 06:53:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:53:08] [INFO ] [Nat]Absence check using 401 positive place invariants in 295 ms returned sat
[2025-06-05 06:53:10] [INFO ] [Nat]Absence check using state equation in 2415 ms returned sat
[2025-06-05 06:53:13] [INFO ] Deduced a trap composed of 25 places in 2434 ms of which 25 ms to minimize.
[2025-06-05 06:53:13] [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:53:14] [INFO ] [Real]Absence check using 401 positive place invariants in 311 ms returned sat
[2025-06-05 06:53:16] [INFO ] [Real]Absence check using state equation in 2250 ms returned sat
[2025-06-05 06:53:19] [INFO ] Deduced a trap composed of 32 places in 2191 ms of which 23 ms to minimize.
[2025-06-05 06:53:19] [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:2249)
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:53:20] [INFO ] [Real]Absence check using 401 positive place invariants in 311 ms returned sat
[2025-06-05 06:53:22] [INFO ] [Real]Absence check using state equation in 2550 ms returned sat
[2025-06-05 06:53:25] [INFO ] Deduced a trap composed of 25 places in 2343 ms of which 23 ms to minimize.
[2025-06-05 06:53:25] [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:2249)
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:53:26] [INFO ] [Real]Absence check using 401 positive place invariants in 289 ms returned sat
[2025-06-05 06:53:28] [INFO ] [Real]Absence check using state equation in 2139 ms returned sat
[2025-06-05 06:53:31] [INFO ] Deduced a trap composed of 32 places in 2206 ms of which 24 ms to minimize.
[2025-06-05 06:53:31] [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:2249)
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:53:32] [INFO ] [Real]Absence check using 401 positive place invariants in 281 ms returned sat
[2025-06-05 06:53:34] [INFO ] [Real]Absence check using state equation in 2252 ms returned sat
[2025-06-05 06:53:37] [INFO ] Deduced a trap composed of 46 places in 2406 ms of which 24 ms to minimize.
[2025-06-05 06: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 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:2249)
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 5003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5003/5003 places, 5003/5003 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1595 transitions
Trivial Post-agglo rules discarded 1595 transitions
Performed 1595 trivial Post agglomeration. Transition count delta: 1595
Iterating post reduction 0 with 1595 rules applied. Total rules applied 1595 place count 5003 transition count 3408
Reduce places removed 1595 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 1597 rules applied. Total rules applied 3192 place count 3408 transition count 3406
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 3197 place count 3407 transition count 3402
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 3201 place count 3403 transition count 3402
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 399 Pre rules applied. Total rules applied 3201 place count 3403 transition count 3003
Deduced a syphon composed of 399 places in 30 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 4 with 798 rules applied. Total rules applied 3999 place count 3004 transition count 3003
Discarding 698 places :
Symmetric choice reduction at 4 with 698 rule applications. Total rules 4697 place count 2306 transition count 2305
Iterating global reduction 4 with 698 rules applied. Total rules applied 5395 place count 2306 transition count 2305
Performed 295 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 295 Pre rules applied. Total rules applied 5395 place count 2306 transition count 2010
Deduced a syphon composed of 295 places in 16 ms
Reduce places removed 295 places and 0 transitions.
Iterating global reduction 4 with 590 rules applied. Total rules applied 5985 place count 2011 transition count 2010
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 9 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 4 with 1802 rules applied. Total rules applied 7787 place count 1110 transition count 1109
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 8 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7989 place count 1009 transition count 1209
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8191 place count 908 transition count 1306
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: -92
Deduced a syphon composed of 93 places in 1 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 4 with 186 rules applied. Total rules applied 8377 place count 815 transition count 1398
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 8378 place count 815 transition count 1397
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 8380 place count 815 transition count 1395
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 8382 place count 813 transition count 1395
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 8384 place count 813 transition count 1393
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 8385 place count 812 transition count 1392
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 8386 place count 811 transition count 1392
Applied a total of 8386 rules in 1925 ms. Remains 811 /5003 variables (removed 4192) and now considering 1392/5003 (removed 3611) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1936 ms. Remains : 811/5003 places, 1392/5003 transitions.
// Phase 1: matrix 1392 rows 811 cols
[2025-06-05 06:53:38] [INFO ] Computed 400 invariants in 4 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 (262 resets) in 7703 ms. (129 steps per ms)
FORMULA ShieldRVt-PT-100B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 6736556 steps (178 resets) in 35007 ms. (192 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-06-05 06:54:21] [INFO ] Invariant cache hit.
[2025-06-05 06:54:21] [INFO ] [Real]Absence check using 400 positive place invariants in 53 ms returned sat
[2025-06-05 06:54:22] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2025-06-05 06:54:22] [INFO ] Computed and/alt/rep : 1389/4254/1389 causal constraints (skipped 0 transitions) in 86 ms.
[2025-06-05 06:54:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:54:22] [INFO ] [Nat]Absence check using 400 positive place invariants in 56 ms returned sat
[2025-06-05 06:54:23] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2025-06-05 06:54:23] [INFO ] Computed and/alt/rep : 1389/4254/1389 causal constraints (skipped 0 transitions) in 79 ms.
[2025-06-05 06:54:43] [INFO ] Added : 930 causal constraints over 186 iterations in 20120 ms.(timeout) Result :sat
Minimization took 1355 ms.
[2025-06-05 06:54:44] [INFO ] [Real]Absence check using 400 positive place invariants in 53 ms returned sat
[2025-06-05 06:54:45] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2025-06-05 06:54:45] [INFO ] Computed and/alt/rep : 1389/4254/1389 causal constraints (skipped 0 transitions) in 68 ms.
[2025-06-05 06:54:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:54:45] [INFO ] [Nat]Absence check using 400 positive place invariants in 53 ms returned sat
[2025-06-05 06:54:45] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2025-06-05 06:54:46] [INFO ] Computed and/alt/rep : 1389/4254/1389 causal constraints (skipped 0 transitions) in 80 ms.
[2025-06-05 06:55:06] [INFO ] Added : 920 causal constraints over 184 iterations in 20371 ms.(timeout) Result :sat
Minimization took 4124 ms.
[2025-06-05 06:55:10] [INFO ] [Real]Absence check using 400 positive place invariants in 55 ms returned sat
[2025-06-05 06:55:10] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2025-06-05 06:55:11] [INFO ] Computed and/alt/rep : 1389/4254/1389 causal constraints (skipped 0 transitions) in 69 ms.
[2025-06-05 06:55:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:55:11] [INFO ] [Nat]Absence check using 400 positive place invariants in 51 ms returned sat
[2025-06-05 06:55:11] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2025-06-05 06:55:11] [INFO ] Computed and/alt/rep : 1389/4254/1389 causal constraints (skipped 0 transitions) in 65 ms.
[2025-06-05 06:55:32] [INFO ] Added : 945 causal constraints over 189 iterations in 20326 ms.(timeout) Result :sat
Minimization took 1658 ms.
[2025-06-05 06:55:33] [INFO ] [Real]Absence check using 400 positive place invariants in 52 ms returned sat
[2025-06-05 06:55:34] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2025-06-05 06:55:34] [INFO ] Computed and/alt/rep : 1389/4254/1389 causal constraints (skipped 0 transitions) in 61 ms.
[2025-06-05 06:55:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:55:34] [INFO ] [Nat]Absence check using 400 positive place invariants in 50 ms returned sat
[2025-06-05 06:55:35] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2025-06-05 06:55:35] [INFO ] Computed and/alt/rep : 1389/4254/1389 causal constraints (skipped 0 transitions) in 65 ms.
[2025-06-05 06:55:55] [INFO ] Added : 930 causal constraints over 186 iterations in 20200 ms.(timeout) Result :sat
Minimization took 1481 ms.
[2025-06-05 06:55:57] [INFO ] [Real]Absence check using 400 positive place invariants in 51 ms returned sat
[2025-06-05 06:55:57] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2025-06-05 06:55:57] [INFO ] Computed and/alt/rep : 1389/4254/1389 causal constraints (skipped 0 transitions) in 68 ms.
[2025-06-05 06:55:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:55:57] [INFO ] [Nat]Absence check using 400 positive place invariants in 55 ms returned sat
[2025-06-05 06:55:58] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2025-06-05 06:55:58] [INFO ] Computed and/alt/rep : 1389/4254/1389 causal constraints (skipped 0 transitions) in 69 ms.
[2025-06-05 06:56:18] [INFO ] Added : 1035 causal constraints over 207 iterations in 20136 ms.(timeout) Result :sat
Minimization took 1963 ms.
[2025-06-05 06:56:20] [INFO ] [Real]Absence check using 400 positive place invariants in 54 ms returned sat
[2025-06-05 06:56:20] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2025-06-05 06:56:20] [INFO ] Computed and/alt/rep : 1389/4254/1389 causal constraints (skipped 0 transitions) in 70 ms.
[2025-06-05 06:56:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:56:21] [INFO ] [Nat]Absence check using 400 positive place invariants in 54 ms returned sat
[2025-06-05 06:56:21] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2025-06-05 06:56:21] [INFO ] Computed and/alt/rep : 1389/4254/1389 causal constraints (skipped 0 transitions) in 70 ms.
[2025-06-05 06:56:41] [INFO ] Added : 905 causal constraints over 181 iterations in 20295 ms.(timeout) Result :sat
Minimization took 1625 ms.
[2025-06-05 06:56:43] [INFO ] [Real]Absence check using 400 positive place invariants in 52 ms returned sat
[2025-06-05 06:56:44] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2025-06-05 06:56:44] [INFO ] Computed and/alt/rep : 1389/4254/1389 causal constraints (skipped 0 transitions) in 62 ms.
[2025-06-05 06:56:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:56:44] [INFO ] [Nat]Absence check using 400 positive place invariants in 53 ms returned sat
[2025-06-05 06:56:44] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2025-06-05 06:56:45] [INFO ] Computed and/alt/rep : 1389/4254/1389 causal constraints (skipped 0 transitions) in 68 ms.
[2025-06-05 06:57:05] [INFO ] Added : 905 causal constraints over 181 iterations in 20161 ms.(timeout) Result :sat
Minimization took 2122 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA ShieldRVt-PT-100B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-100B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 811 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 811/811 places, 1392/1392 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 811 transition count 1389
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 808 transition count 1389
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 806 transition count 1393
Applied a total of 10 rules in 53 ms. Remains 806 /811 variables (removed 5) and now considering 1393/1392 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 806/811 places, 1393/1392 transitions.
// Phase 1: matrix 1393 rows 806 cols
[2025-06-05 06:57:16] [INFO ] Computed 400 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (257 resets) in 7835 ms. (127 steps per ms)
BEST_FIRST walk for 4843723 steps (136 resets) in 25005 ms. (193 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-06-05 06:57:49] [INFO ] Invariant cache hit.
[2025-06-05 06:57:49] [INFO ] [Real]Absence check using 400 positive place invariants in 52 ms returned sat
[2025-06-05 06:57:50] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2025-06-05 06:57:50] [INFO ] Computed and/alt/rep : 1390/4306/1390 causal constraints (skipped 0 transitions) in 67 ms.
[2025-06-05 06:57:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:57:50] [INFO ] [Nat]Absence check using 400 positive place invariants in 51 ms returned sat
[2025-06-05 06:57:50] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2025-06-05 06:57:51] [INFO ] Computed and/alt/rep : 1390/4306/1390 causal constraints (skipped 0 transitions) in 70 ms.
[2025-06-05 06:58:11] [INFO ] Added : 1035 causal constraints over 207 iterations in 20146 ms.(timeout) Result :sat
Minimization took 1445 ms.
[2025-06-05 06:58:12] [INFO ] [Real]Absence check using 400 positive place invariants in 47 ms returned sat
[2025-06-05 06:58:13] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2025-06-05 06:58:13] [INFO ] Computed and/alt/rep : 1390/4306/1390 causal constraints (skipped 0 transitions) in 70 ms.
[2025-06-05 06:58:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:58:13] [INFO ] [Nat]Absence check using 400 positive place invariants in 49 ms returned sat
[2025-06-05 06:58:13] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2025-06-05 06:58:13] [INFO ] Computed and/alt/rep : 1390/4306/1390 causal constraints (skipped 0 transitions) in 59 ms.
[2025-06-05 06:58:33] [INFO ] Added : 960 causal constraints over 192 iterations in 20098 ms.(timeout) Result :sat
Minimization took 1381 ms.
[2025-06-05 06:58:35] [INFO ] [Real]Absence check using 400 positive place invariants in 49 ms returned sat
[2025-06-05 06:58:35] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2025-06-05 06:58:35] [INFO ] Computed and/alt/rep : 1390/4306/1390 causal constraints (skipped 0 transitions) in 60 ms.
[2025-06-05 06:58:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:58:36] [INFO ] [Nat]Absence check using 400 positive place invariants in 53 ms returned sat
[2025-06-05 06:58:36] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2025-06-05 06:58:36] [INFO ] Computed and/alt/rep : 1390/4306/1390 causal constraints (skipped 0 transitions) in 67 ms.
[2025-06-05 06:58:56] [INFO ] Added : 1005 causal constraints over 201 iterations in 20089 ms.(timeout) Result :sat
Minimization took 1609 ms.
[2025-06-05 06:58:58] [INFO ] [Real]Absence check using 400 positive place invariants in 50 ms returned sat
[2025-06-05 06:58:58] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2025-06-05 06:58:59] [INFO ] Computed and/alt/rep : 1390/4306/1390 causal constraints (skipped 0 transitions) in 88 ms.
[2025-06-05 06:58:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:58:59] [INFO ] [Nat]Absence check using 400 positive place invariants in 49 ms returned sat
[2025-06-05 06:58:59] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2025-06-05 06:58:59] [INFO ] Computed and/alt/rep : 1390/4306/1390 causal constraints (skipped 0 transitions) in 62 ms.
[2025-06-05 06:59:19] [INFO ] Added : 1010 causal constraints over 202 iterations in 20143 ms.(timeout) Result :sat
Minimization took 1608 ms.
[2025-06-05 06:59:21] [INFO ] [Real]Absence check using 400 positive place invariants in 49 ms returned sat
[2025-06-05 06:59:21] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2025-06-05 06:59:22] [INFO ] Computed and/alt/rep : 1390/4306/1390 causal constraints (skipped 0 transitions) in 65 ms.
[2025-06-05 06:59:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 06:59:22] [INFO ] [Nat]Absence check using 400 positive place invariants in 51 ms returned sat
[2025-06-05 06:59:22] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2025-06-05 06:59:22] [INFO ] Computed and/alt/rep : 1390/4306/1390 causal constraints (skipped 0 transitions) in 62 ms.
[2025-06-05 06:59:42] [INFO ] Added : 1035 causal constraints over 207 iterations in 20117 ms.(timeout) Result :sat
Minimization took 1401 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 1393/1393 transitions.
Applied a total of 0 rules in 50 ms. Remains 806 /806 variables (removed 0) and now considering 1393/1393 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 806/806 places, 1393/1393 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 806/806 places, 1393/1393 transitions.
Applied a total of 0 rules in 63 ms. Remains 806 /806 variables (removed 0) and now considering 1393/1393 (removed 0) transitions.
[2025-06-05 06:59:50] [INFO ] Invariant cache hit.
[2025-06-05 06:59:51] [INFO ] Implicit Places using invariants in 638 ms returned []
[2025-06-05 06:59:51] [INFO ] Invariant cache hit.
[2025-06-05 06:59:52] [INFO ] Implicit Places using invariants and state equation in 1095 ms returned []
Implicit Place search using SMT with State Equation took 1758 ms to find 0 implicit places.
[2025-06-05 06:59:52] [INFO ] Redundant transitions in 65 ms returned []
Running 1390 sub problems to find dead transitions.
[2025-06-05 06:59:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/806 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/2199 variables, and 400 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 0/806 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/806 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/806 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (OVERLAPS) 1393/2199 variables, 806/1206 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2199 variables, 1390/2596 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2199/2199 variables, and 2596 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 806/806 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 0/0 constraints]
After SMT, in 61092ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 61146ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63061 ms. Remains : 806/806 places, 1393/1393 transitions.
RANDOM walk for 40000 steps (15 resets) in 1803 ms. (22 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 533 ms. (74 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (9 resets) in 773 ms. (51 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 882 ms. (45 steps per ms) remains 10/10 properties
[2025-06-05 07:00:55] [INFO ] Flatten gal took : 366 ms
[2025-06-05 07:00:55] [INFO ] Flatten gal took : 286 ms
BEST_FIRST walk for 40004 steps (8 resets) in 863 ms. (46 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 800 ms. (49 steps per ms) remains 10/10 properties
[2025-06-05 07:00:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16592484982731639336.gal : 183 ms
BEST_FIRST walk for 40003 steps (8 resets) in 778 ms. (51 steps per ms) remains 10/10 properties
[2025-06-05 07:00:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15178471189864187138.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/ReachabilityCardinality16592484982731639336.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15178471189864187138.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 ...330
BEST_FIRST walk for 40002 steps (10 resets) in 515 ms. (77 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 457 ms. (87 steps per ms) remains 10/10 properties
Loading property file /tmp/ReachabilityCardinality15178471189864187138.prop.
BEST_FIRST walk for 40003 steps (8 resets) in 482 ms. (82 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 419 ms. (95 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :11 after 26
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :26 after 53
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :53 after 104
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :104 after 196
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :196 after 295
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :295 after 7656
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :7656 after 2.34881e+08
Invariant property MIN4 does not hold.
Reachability property MAX4 is true.
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2.34881e+08 after 1.83662e+16
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1.83662e+16 after 1.08803e+25
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.08803e+25 after 1.25442e+43
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.25442e+43 after 3.05311e+76
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6.08742e+111,0.998146,19704,2,2831,21,41507,6,0,4620,32347,0
Total reachable state count : 6.087422373604883413583272555549040612843e+111

Verifying 10 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1.02762e+47,1.01043,19704,2,1044,21,41507,7,0,4623,32347,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1.02762e+47,1.01136,19704,2,1044,21,41507,8,0,4624,32347,0
Reachability property MAX1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,9.76996e+76,1.0121,19704,2,1171,21,41507,9,0,4626,32347,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,9.76996e+76,1.01275,19704,2,1171,21,41507,10,0,4627,32347,0
Reachability property MAX2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,1.07374e+09,1.01374,19704,2,897,21,41507,11,0,4629,32347,0
Invariant property MIN2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,1.07374e+09,1.01455,19704,2,897,21,41507,12,0,4630,32347,0
Reachability property MAX3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,8.22095e+47,1.0154,19704,2,1065,21,41507,13,0,4632,32347,0
Invariant property MIN3 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,8.22095e+47,1.01612,19704,2,1065,21,41507,14,0,4633,32347,0
Reachability property MAX4 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX4,1.07374e+09,1.01692,19704,2,897,21,41507,15,0,4635,32347,0
Invariant property MIN4 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN4,1.07374e+09,1.01772,19704,2,897,21,41507,16,0,4636,32347,0
ITS tools runner thread asked to quit. Dying gracefully.
Interrupted probabilistic random walk after 197182 steps, run timeout after 6001 ms. (steps per millisecond=32 ) properties seen :0 out of 10
Probabilistic random walk after 197182 steps, saw 136272 distinct states, run finished after 6006 ms. (steps per millisecond=32 ) properties seen :0
FORMULA ShieldRVt-PT-100B-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
FORMULA ShieldRVt-PT-100B-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
FORMULA ShieldRVt-PT-100B-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
FORMULA ShieldRVt-PT-100B-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
FORMULA ShieldRVt-PT-100B-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 5 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 499490 ms.

BK_STOP 1749106862921

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-100B"
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-100B, 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-174902009200044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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