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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K 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:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 338K May 29 14:32 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749020213005

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-04 06:56:54] [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-04 06:56:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 06:56:54] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2025-06-04 06:56:54] [INFO ] Transformed 1403 places.
[2025-06-04 06:56:54] [INFO ] Transformed 1303 transitions.
[2025-06-04 06:56:54] [INFO ] Found NUPN structural information;
[2025-06-04 06:56:54] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 269 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1303 rows 1403 cols
[2025-06-04 06:56:54] [INFO ] Computed 181 invariants in 40 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 73 ms. (135 steps per ms)
FORMULA ShieldIIPt-PT-020B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70006 steps (14 resets) in 107 ms. (648 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-04 06:56:54] [INFO ] Invariant cache hit.
[2025-06-04 06:56:55] [INFO ] [Real]Absence check using 181 positive place invariants in 78 ms returned sat
[2025-06-04 06:56:56] [INFO ] [Real]Absence check using state equation in 629 ms returned sat
[2025-06-04 06:56:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 06:56:56] [INFO ] [Nat]Absence check using 181 positive place invariants in 66 ms returned sat
[2025-06-04 06:56:57] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2025-06-04 06:56:57] [INFO ] Deduced a trap composed of 21 places in 411 ms of which 59 ms to minimize.
[2025-06-04 06:56:57] [INFO ] Deduced a trap composed of 41 places in 332 ms of which 7 ms to minimize.
[2025-06-04 06:56:58] [INFO ] Deduced a trap composed of 21 places in 328 ms of which 7 ms to minimize.
[2025-06-04 06:56:58] [INFO ] Deduced a trap composed of 30 places in 325 ms of which 7 ms to minimize.
[2025-06-04 06:56:59] [INFO ] Deduced a trap composed of 20 places in 353 ms of which 6 ms to minimize.
[2025-06-04 06:56:59] [INFO ] Deduced a trap composed of 30 places in 295 ms of which 6 ms to minimize.
[2025-06-04 06:56:59] [INFO ] Deduced a trap composed of 26 places in 283 ms of which 6 ms to minimize.
[2025-06-04 06:57:00] [INFO ] Deduced a trap composed of 14 places in 272 ms of which 5 ms to minimize.
[2025-06-04 06:57:00] [INFO ] Deduced a trap composed of 20 places in 287 ms of which 6 ms to minimize.
[2025-06-04 06:57:00] [INFO ] Deduced a trap composed of 18 places in 285 ms of which 6 ms to minimize.
[2025-06-04 06:57:01] [INFO ] Deduced a trap composed of 27 places in 279 ms of which 6 ms to minimize.
[2025-06-04 06:57:01] [INFO ] Deduced a trap composed of 16 places in 260 ms of which 6 ms to minimize.
[2025-06-04 06:57: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 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-04 06:57:01] [INFO ] [Real]Absence check using 181 positive place invariants in 61 ms returned sat
[2025-06-04 06:57:02] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2025-06-04 06:57:02] [INFO ] Deduced a trap composed of 22 places in 313 ms of which 6 ms to minimize.
[2025-06-04 06:57:02] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 06:57:02] [INFO ] [Nat]Absence check using 181 positive place invariants in 65 ms returned sat
[2025-06-04 06:57:03] [INFO ] [Nat]Absence check using state equation in 420 ms returned sat
[2025-06-04 06:57:03] [INFO ] Deduced a trap composed of 22 places in 321 ms of which 6 ms to minimize.
[2025-06-04 06:57:04] [INFO ] Deduced a trap composed of 24 places in 316 ms of which 7 ms to minimize.
[2025-06-04 06:57:04] [INFO ] Deduced a trap composed of 27 places in 300 ms of which 6 ms to minimize.
[2025-06-04 06:57:04] [INFO ] Deduced a trap composed of 16 places in 301 ms of which 5 ms to minimize.
[2025-06-04 06:57:05] [INFO ] Deduced a trap composed of 23 places in 316 ms of which 7 ms to minimize.
[2025-06-04 06:57:05] [INFO ] Deduced a trap composed of 34 places in 278 ms of which 5 ms to minimize.
[2025-06-04 06:57:05] [INFO ] Deduced a trap composed of 18 places in 303 ms of which 6 ms to minimize.
[2025-06-04 06:57:06] [INFO ] Deduced a trap composed of 37 places in 310 ms of which 5 ms to minimize.
[2025-06-04 06:57:06] [INFO ] Deduced a trap composed of 30 places in 261 ms of which 5 ms to minimize.
[2025-06-04 06:57:06] [INFO ] Deduced a trap composed of 19 places in 262 ms of which 5 ms to minimize.
[2025-06-04 06:57:07] [INFO ] Deduced a trap composed of 27 places in 267 ms of which 6 ms to minimize.
[2025-06-04 06:57:07] [INFO ] Deduced a trap composed of 28 places in 262 ms of which 6 ms to minimize.
[2025-06-04 06:57:07] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 6 ms to minimize.
[2025-06-04 06:57:07] [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-04 06:57:07] [INFO ] [Real]Absence check using 181 positive place invariants in 67 ms returned sat
[2025-06-04 06:57:08] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2025-06-04 06:57:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 06:57:08] [INFO ] [Nat]Absence check using 181 positive place invariants in 67 ms returned sat
[2025-06-04 06:57:09] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2025-06-04 06:57:09] [INFO ] Deduced a trap composed of 28 places in 267 ms of which 5 ms to minimize.
[2025-06-04 06:57:09] [INFO ] Deduced a trap composed of 19 places in 261 ms of which 6 ms to minimize.
[2025-06-04 06:57:10] [INFO ] Deduced a trap composed of 37 places in 272 ms of which 6 ms to minimize.
[2025-06-04 06:57:10] [INFO ] Deduced a trap composed of 20 places in 252 ms of which 5 ms to minimize.
[2025-06-04 06:57:10] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 5 ms to minimize.
[2025-06-04 06:57:11] [INFO ] Deduced a trap composed of 22 places in 253 ms of which 5 ms to minimize.
[2025-06-04 06:57:11] [INFO ] Deduced a trap composed of 36 places in 269 ms of which 5 ms to minimize.
[2025-06-04 06:57:11] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 5 ms to minimize.
[2025-06-04 06:57:12] [INFO ] Deduced a trap composed of 18 places in 247 ms of which 5 ms to minimize.
[2025-06-04 06:57:12] [INFO ] Deduced a trap composed of 26 places in 268 ms of which 5 ms to minimize.
[2025-06-04 06:57:12] [INFO ] Deduced a trap composed of 28 places in 231 ms of which 5 ms to minimize.
[2025-06-04 06:57:12] [INFO ] Deduced a trap composed of 26 places in 243 ms of which 4 ms to minimize.
[2025-06-04 06:57:13] [INFO ] Deduced a trap composed of 18 places in 232 ms of which 7 ms to minimize.
[2025-06-04 06:57:13] [INFO ] Deduced a trap composed of 29 places in 228 ms of which 5 ms to minimize.
[2025-06-04 06:57: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 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-04 06:57:13] [INFO ] [Real]Absence check using 181 positive place invariants in 60 ms returned sat
[2025-06-04 06:57:14] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2025-06-04 06:57:14] [INFO ] Deduced a trap composed of 12 places in 322 ms of which 7 ms to minimize.
[2025-06-04 06:57:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 06:57:14] [INFO ] [Nat]Absence check using 181 positive place invariants in 68 ms returned sat
[2025-06-04 06:57:15] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2025-06-04 06:57:15] [INFO ] Deduced a trap composed of 12 places in 329 ms of which 6 ms to minimize.
[2025-06-04 06:57:16] [INFO ] Deduced a trap composed of 32 places in 318 ms of which 6 ms to minimize.
[2025-06-04 06:57:16] [INFO ] Deduced a trap composed of 28 places in 333 ms of which 7 ms to minimize.
[2025-06-04 06:57:16] [INFO ] Deduced a trap composed of 24 places in 318 ms of which 6 ms to minimize.
[2025-06-04 06:57:17] [INFO ] Deduced a trap composed of 31 places in 310 ms of which 6 ms to minimize.
[2025-06-04 06:57:17] [INFO ] Deduced a trap composed of 23 places in 306 ms of which 6 ms to minimize.
[2025-06-04 06:57:17] [INFO ] Deduced a trap composed of 27 places in 282 ms of which 6 ms to minimize.
[2025-06-04 06:57:18] [INFO ] Deduced a trap composed of 28 places in 282 ms of which 6 ms to minimize.
[2025-06-04 06:57:18] [INFO ] Deduced a trap composed of 18 places in 288 ms of which 5 ms to minimize.
[2025-06-04 06:57:18] [INFO ] Deduced a trap composed of 31 places in 322 ms of which 7 ms to minimize.
[2025-06-04 06:57:19] [INFO ] Deduced a trap composed of 33 places in 270 ms of which 5 ms to minimize.
[2025-06-04 06:57:19] [INFO ] Deduced a trap composed of 26 places in 278 ms of which 6 ms to minimize.
[2025-06-04 06:57:19] [INFO ] Deduced a trap composed of 23 places in 278 ms of which 5 ms to minimize.
[2025-06-04 06:57: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 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-04 06:57:20] [INFO ] [Real]Absence check using 181 positive place invariants in 61 ms returned sat
[2025-06-04 06:57:20] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2025-06-04 06:57:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 06:57:21] [INFO ] [Nat]Absence check using 181 positive place invariants in 64 ms returned sat
[2025-06-04 06:57:21] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2025-06-04 06:57:21] [INFO ] Deduced a trap composed of 20 places in 331 ms of which 7 ms to minimize.
[2025-06-04 06:57:22] [INFO ] Deduced a trap composed of 20 places in 316 ms of which 7 ms to minimize.
[2025-06-04 06:57:22] [INFO ] Deduced a trap composed of 18 places in 320 ms of which 7 ms to minimize.
[2025-06-04 06:57:22] [INFO ] Deduced a trap composed of 20 places in 318 ms of which 6 ms to minimize.
[2025-06-04 06:57:23] [INFO ] Deduced a trap composed of 35 places in 313 ms of which 6 ms to minimize.
[2025-06-04 06:57:23] [INFO ] Deduced a trap composed of 31 places in 320 ms of which 6 ms to minimize.
[2025-06-04 06:57:24] [INFO ] Deduced a trap composed of 25 places in 303 ms of which 6 ms to minimize.
[2025-06-04 06:57:24] [INFO ] Deduced a trap composed of 29 places in 301 ms of which 6 ms to minimize.
[2025-06-04 06:57:24] [INFO ] Deduced a trap composed of 25 places in 287 ms of which 6 ms to minimize.
[2025-06-04 06:57:25] [INFO ] Deduced a trap composed of 27 places in 297 ms of which 6 ms to minimize.
[2025-06-04 06:57:25] [INFO ] Deduced a trap composed of 23 places in 290 ms of which 6 ms to minimize.
[2025-06-04 06:57:25] [INFO ] Deduced a trap composed of 26 places in 296 ms of which 6 ms to minimize.
[2025-06-04 06:57:26] [INFO ] Deduced a trap composed of 33 places in 283 ms of which 6 ms to minimize.
[2025-06-04 06:57:26] [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-04 06:57:26] [INFO ] [Real]Absence check using 181 positive place invariants in 63 ms returned sat
[2025-06-04 06:57:26] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2025-06-04 06:57:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 06:57:27] [INFO ] [Nat]Absence check using 181 positive place invariants in 62 ms returned sat
[2025-06-04 06:57:27] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2025-06-04 06:57:28] [INFO ] Deduced a trap composed of 21 places in 316 ms of which 6 ms to minimize.
[2025-06-04 06:57:28] [INFO ] Deduced a trap composed of 41 places in 322 ms of which 6 ms to minimize.
[2025-06-04 06:57:28] [INFO ] Deduced a trap composed of 21 places in 314 ms of which 6 ms to minimize.
[2025-06-04 06:57:29] [INFO ] Deduced a trap composed of 30 places in 307 ms of which 6 ms to minimize.
[2025-06-04 06:57:29] [INFO ] Deduced a trap composed of 20 places in 303 ms of which 6 ms to minimize.
[2025-06-04 06:57:29] [INFO ] Deduced a trap composed of 30 places in 298 ms of which 6 ms to minimize.
[2025-06-04 06:57:30] [INFO ] Deduced a trap composed of 26 places in 281 ms of which 5 ms to minimize.
[2025-06-04 06:57:30] [INFO ] Deduced a trap composed of 14 places in 309 ms of which 6 ms to minimize.
[2025-06-04 06:57:30] [INFO ] Deduced a trap composed of 20 places in 315 ms of which 6 ms to minimize.
[2025-06-04 06:57:31] [INFO ] Deduced a trap composed of 18 places in 282 ms of which 6 ms to minimize.
[2025-06-04 06:57:31] [INFO ] Deduced a trap composed of 27 places in 290 ms of which 5 ms to minimize.
[2025-06-04 06:57:31] [INFO ] Deduced a trap composed of 16 places in 255 ms of which 6 ms to minimize.
[2025-06-04 06:57:32] [INFO ] Deduced a trap composed of 29 places in 252 ms of which 5 ms to minimize.
[2025-06-04 06:57:32] [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-04 06:57:32] [INFO ] [Real]Absence check using 181 positive place invariants in 60 ms returned sat
[2025-06-04 06:57:32] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2025-06-04 06:57:33] [INFO ] Deduced a trap composed of 23 places in 309 ms of which 6 ms to minimize.
[2025-06-04 06:57:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 06:57:33] [INFO ] [Nat]Absence check using 181 positive place invariants in 63 ms returned sat
[2025-06-04 06:57:33] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2025-06-04 06:57:34] [INFO ] Deduced a trap composed of 23 places in 297 ms of which 6 ms to minimize.
[2025-06-04 06:57:34] [INFO ] Deduced a trap composed of 16 places in 291 ms of which 6 ms to minimize.
[2025-06-04 06:57:35] [INFO ] Deduced a trap composed of 38 places in 291 ms of which 6 ms to minimize.
[2025-06-04 06:57:35] [INFO ] Deduced a trap composed of 27 places in 297 ms of which 6 ms to minimize.
[2025-06-04 06:57:35] [INFO ] Deduced a trap composed of 18 places in 273 ms of which 6 ms to minimize.
[2025-06-04 06:57:35] [INFO ] Deduced a trap composed of 22 places in 261 ms of which 5 ms to minimize.
[2025-06-04 06:57:36] [INFO ] Deduced a trap composed of 14 places in 287 ms of which 6 ms to minimize.
[2025-06-04 06:57:36] [INFO ] Deduced a trap composed of 29 places in 269 ms of which 6 ms to minimize.
[2025-06-04 06:57:36] [INFO ] Deduced a trap composed of 26 places in 254 ms of which 5 ms to minimize.
[2025-06-04 06:57:37] [INFO ] Deduced a trap composed of 26 places in 268 ms of which 5 ms to minimize.
[2025-06-04 06:57:37] [INFO ] Deduced a trap composed of 24 places in 263 ms of which 5 ms to minimize.
[2025-06-04 06:57:37] [INFO ] Deduced a trap composed of 26 places in 249 ms of which 5 ms to minimize.
[2025-06-04 06:57:38] [INFO ] Deduced a trap composed of 29 places in 249 ms of which 5 ms to minimize.
[2025-06-04 06:57:38] [INFO ] Deduced a trap composed of 25 places in 252 ms of which 5 ms to minimize.
[2025-06-04 06:57:38] [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)
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]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 339 transitions
Trivial Post-agglo rules discarded 339 transitions
Performed 339 trivial Post agglomeration. Transition count delta: 339
Iterating post reduction 0 with 339 rules applied. Total rules applied 339 place count 1403 transition count 964
Reduce places removed 339 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 341 rules applied. Total rules applied 680 place count 1064 transition count 962
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 682 place count 1063 transition count 961
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 683 place count 1062 transition count 961
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 80 Pre rules applied. Total rules applied 683 place count 1062 transition count 881
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 4 with 160 rules applied. Total rules applied 843 place count 982 transition count 881
Discarding 137 places :
Symmetric choice reduction at 4 with 137 rule applications. Total rules 980 place count 845 transition count 744
Iterating global reduction 4 with 137 rules applied. Total rules applied 1117 place count 845 transition count 744
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 59 Pre rules applied. Total rules applied 1117 place count 845 transition count 685
Deduced a syphon composed of 59 places in 8 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 1235 place count 786 transition count 685
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 3 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 4 with 678 rules applied. Total rules applied 1913 place count 447 transition count 346
Renaming transitions due to excessive name length > 1024 char.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 59 places in 3 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 2031 place count 388 transition count 384
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 2032 place count 388 transition count 383
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2033 place count 388 transition count 382
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2034 place count 387 transition count 382
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 2053 place count 387 transition count 382
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2054 place count 386 transition count 381
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2056 place count 384 transition count 381
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2056 place count 384 transition count 380
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2058 place count 383 transition count 380
Applied a total of 2058 rules in 419 ms. Remains 383 /1403 variables (removed 1020) and now considering 380/1303 (removed 923) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 432 ms. Remains : 383/1403 places, 380/1303 transitions.
// Phase 1: matrix 380 rows 383 cols
[2025-06-04 06:57:38] [INFO ] Computed 179 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 4551 ms. (219 steps per ms)
FORMULA ShieldIIPt-PT-020B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 2642 ms. (378 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 8 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-04 06:57:46] [INFO ] Flatten gal took : 76 ms
[2025-06-04 06:57:46] [INFO ] Flatten gal took : 33 ms
[2025-06-04 06:57:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5424920135765367114.gal : 21 ms
[2025-06-04 06:57:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6766328792371038823.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5424920135765367114.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6766328792371038823.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 52138 ms.

BK_STOP 1749020266516

--------------------
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="ShieldIIPt-PT-020B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is ShieldIIPt-PT-020B, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r209-tall-174894546700067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-020B.tgz
mv ShieldIIPt-PT-020B execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;