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

About the Execution of 2024-gold for ShieldPPPt-PT-020B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15687.800 56205.00 73073.00 250.50 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r209-tall-174894546800111.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 ShieldPPPt-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-174894546800111
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K 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 55K 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.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K 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 376K 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 ShieldPPPt-PT-020B-UpperBounds-00
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-01
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-02
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-03
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-04
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-05
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-06
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-07
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-08
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-09
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-10
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-11
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-12
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-13
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-14
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749020650031

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-04 07:04:11] [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 07:04:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 07:04:11] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2025-06-04 07:04:11] [INFO ] Transformed 1563 places.
[2025-06-04 07:04:11] [INFO ] Transformed 1423 transitions.
[2025-06-04 07:04:11] [INFO ] Found NUPN structural information;
[2025-06-04 07:04:11] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 324 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 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 1423 rows 1563 cols
[2025-06-04 07:04:11] [INFO ] Computed 221 invariants in 36 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 68 ms. (144 steps per ms)
FORMULA ShieldPPPt-PT-020B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70007 steps (14 resets) in 93 ms. (744 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 07:04:11] [INFO ] Invariant cache hit.
[2025-06-04 07:04:12] [INFO ] [Real]Absence check using 221 positive place invariants in 84 ms returned sat
[2025-06-04 07:04:12] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2025-06-04 07:04:13] [INFO ] Deduced a trap composed of 28 places in 477 ms of which 74 ms to minimize.
[2025-06-04 07:04:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:04:14] [INFO ] [Nat]Absence check using 221 positive place invariants in 83 ms returned sat
[2025-06-04 07:04:14] [INFO ] [Nat]Absence check using state equation in 540 ms returned sat
[2025-06-04 07:04:15] [INFO ] Deduced a trap composed of 28 places in 366 ms of which 7 ms to minimize.
[2025-06-04 07:04:15] [INFO ] Deduced a trap composed of 32 places in 359 ms of which 7 ms to minimize.
[2025-06-04 07:04:15] [INFO ] Deduced a trap composed of 35 places in 411 ms of which 8 ms to minimize.
[2025-06-04 07:04:16] [INFO ] Deduced a trap composed of 26 places in 398 ms of which 8 ms to minimize.
[2025-06-04 07:04:16] [INFO ] Deduced a trap composed of 26 places in 336 ms of which 7 ms to minimize.
[2025-06-04 07:04:17] [INFO ] Deduced a trap composed of 25 places in 378 ms of which 8 ms to minimize.
[2025-06-04 07:04:17] [INFO ] Deduced a trap composed of 32 places in 355 ms of which 7 ms to minimize.
[2025-06-04 07:04:17] [INFO ] Deduced a trap composed of 26 places in 336 ms of which 6 ms to minimize.
[2025-06-04 07:04:18] [INFO ] Deduced a trap composed of 27 places in 325 ms of which 7 ms to minimize.
[2025-06-04 07:04:18] [INFO ] Deduced a trap composed of 25 places in 312 ms of which 6 ms to minimize.
[2025-06-04 07:04:18] [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 07:04:19] [INFO ] [Real]Absence check using 221 positive place invariants in 80 ms returned sat
[2025-06-04 07:04:19] [INFO ] [Real]Absence check using state equation in 493 ms returned sat
[2025-06-04 07:04:20] [INFO ] Deduced a trap composed of 28 places in 361 ms of which 8 ms to minimize.
[2025-06-04 07:04:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:04:20] [INFO ] [Nat]Absence check using 221 positive place invariants in 73 ms returned sat
[2025-06-04 07:04:20] [INFO ] [Nat]Absence check using state equation in 526 ms returned sat
[2025-06-04 07:04:21] [INFO ] Deduced a trap composed of 28 places in 394 ms of which 7 ms to minimize.
[2025-06-04 07:04:21] [INFO ] Deduced a trap composed of 34 places in 383 ms of which 7 ms to minimize.
[2025-06-04 07:04:22] [INFO ] Deduced a trap composed of 24 places in 368 ms of which 7 ms to minimize.
[2025-06-04 07:04:22] [INFO ] Deduced a trap composed of 27 places in 335 ms of which 6 ms to minimize.
[2025-06-04 07:04:23] [INFO ] Deduced a trap composed of 25 places in 338 ms of which 7 ms to minimize.
[2025-06-04 07:04:23] [INFO ] Deduced a trap composed of 30 places in 329 ms of which 7 ms to minimize.
[2025-06-04 07:04:23] [INFO ] Deduced a trap composed of 26 places in 327 ms of which 7 ms to minimize.
[2025-06-04 07:04:24] [INFO ] Deduced a trap composed of 25 places in 330 ms of which 6 ms to minimize.
[2025-06-04 07:04:24] [INFO ] Deduced a trap composed of 24 places in 348 ms of which 8 ms to minimize.
[2025-06-04 07:04:24] [INFO ] Deduced a trap composed of 33 places in 320 ms of which 7 ms to minimize.
[2025-06-04 07:04:25] [INFO ] Deduced a trap composed of 37 places in 340 ms of which 7 ms to minimize.
[2025-06-04 07:04: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 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 07:04:25] [INFO ] [Real]Absence check using 221 positive place invariants in 84 ms returned sat
[2025-06-04 07:04:26] [INFO ] [Real]Absence check using state equation in 512 ms returned sat
[2025-06-04 07:04:26] [INFO ] Deduced a trap composed of 23 places in 359 ms of which 7 ms to minimize.
[2025-06-04 07:04:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:04:27] [INFO ] [Nat]Absence check using 221 positive place invariants in 72 ms returned sat
[2025-06-04 07:04:27] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2025-06-04 07:04:27] [INFO ] Deduced a trap composed of 23 places in 351 ms of which 7 ms to minimize.
[2025-06-04 07:04:28] [INFO ] Deduced a trap composed of 25 places in 363 ms of which 7 ms to minimize.
[2025-06-04 07:04:28] [INFO ] Deduced a trap composed of 20 places in 347 ms of which 7 ms to minimize.
[2025-06-04 07:04:29] [INFO ] Deduced a trap composed of 20 places in 437 ms of which 34 ms to minimize.
[2025-06-04 07:04:29] [INFO ] Deduced a trap composed of 36 places in 418 ms of which 6 ms to minimize.
[2025-06-04 07:04:30] [INFO ] Deduced a trap composed of 21 places in 312 ms of which 6 ms to minimize.
[2025-06-04 07:04:30] [INFO ] Deduced a trap composed of 27 places in 330 ms of which 6 ms to minimize.
[2025-06-04 07:04:30] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 6 ms to minimize.
[2025-06-04 07:04:31] [INFO ] Deduced a trap composed of 21 places in 283 ms of which 6 ms to minimize.
[2025-06-04 07:04:31] [INFO ] Deduced a trap composed of 17 places in 272 ms of which 7 ms to minimize.
[2025-06-04 07:04:31] [INFO ] Deduced a trap composed of 20 places in 273 ms of which 5 ms to minimize.
[2025-06-04 07:04: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 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 07:04:32] [INFO ] [Real]Absence check using 221 positive place invariants in 67 ms returned sat
[2025-06-04 07:04:32] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2025-06-04 07:04:32] [INFO ] Deduced a trap composed of 23 places in 349 ms of which 7 ms to minimize.
[2025-06-04 07:04:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:04:33] [INFO ] [Nat]Absence check using 221 positive place invariants in 75 ms returned sat
[2025-06-04 07:04:33] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2025-06-04 07:04:34] [INFO ] Deduced a trap composed of 23 places in 348 ms of which 7 ms to minimize.
[2025-06-04 07:04:34] [INFO ] Deduced a trap composed of 18 places in 337 ms of which 7 ms to minimize.
[2025-06-04 07:04:35] [INFO ] Deduced a trap composed of 26 places in 343 ms of which 7 ms to minimize.
[2025-06-04 07:04:35] [INFO ] Deduced a trap composed of 30 places in 339 ms of which 7 ms to minimize.
[2025-06-04 07:04:35] [INFO ] Deduced a trap composed of 20 places in 353 ms of which 7 ms to minimize.
[2025-06-04 07:04:36] [INFO ] Deduced a trap composed of 17 places in 330 ms of which 7 ms to minimize.
[2025-06-04 07:04:36] [INFO ] Deduced a trap composed of 20 places in 317 ms of which 6 ms to minimize.
[2025-06-04 07:04:36] [INFO ] Deduced a trap composed of 30 places in 319 ms of which 7 ms to minimize.
[2025-06-04 07:04:37] [INFO ] Deduced a trap composed of 19 places in 322 ms of which 7 ms to minimize.
[2025-06-04 07:04:37] [INFO ] Deduced a trap composed of 21 places in 291 ms of which 6 ms to minimize.
[2025-06-04 07:04:37] [INFO ] Deduced a trap composed of 27 places in 287 ms of which 6 ms to minimize.
[2025-06-04 07:04:38] [INFO ] Deduced a trap composed of 31 places in 267 ms of which 6 ms to minimize.
[2025-06-04 07:04: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 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 07:04:38] [INFO ] [Real]Absence check using 221 positive place invariants in 72 ms returned sat
[2025-06-04 07:04:39] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2025-06-04 07:04:39] [INFO ] Deduced a trap composed of 26 places in 407 ms of which 8 ms to minimize.
[2025-06-04 07:04:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:04:39] [INFO ] [Nat]Absence check using 221 positive place invariants in 74 ms returned sat
[2025-06-04 07:04:40] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2025-06-04 07:04:40] [INFO ] Deduced a trap composed of 26 places in 407 ms of which 8 ms to minimize.
[2025-06-04 07:04:41] [INFO ] Deduced a trap composed of 21 places in 406 ms of which 8 ms to minimize.
[2025-06-04 07:04:41] [INFO ] Deduced a trap composed of 20 places in 408 ms of which 8 ms to minimize.
[2025-06-04 07:04:42] [INFO ] Deduced a trap composed of 23 places in 402 ms of which 7 ms to minimize.
[2025-06-04 07:04:42] [INFO ] Deduced a trap composed of 25 places in 400 ms of which 8 ms to minimize.
[2025-06-04 07:04:43] [INFO ] Deduced a trap composed of 21 places in 388 ms of which 7 ms to minimize.
[2025-06-04 07:04:43] [INFO ] Deduced a trap composed of 19 places in 394 ms of which 10 ms to minimize.
[2025-06-04 07:04:43] [INFO ] Deduced a trap composed of 29 places in 375 ms of which 7 ms to minimize.
[2025-06-04 07:04:44] [INFO ] Deduced a trap composed of 21 places in 377 ms of which 8 ms to minimize.
[2025-06-04 07:04:44] [INFO ] Deduced a trap composed of 26 places in 365 ms of which 8 ms to minimize.
[2025-06-04 07:04:44] [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 07:04:45] [INFO ] [Real]Absence check using 221 positive place invariants in 72 ms returned sat
[2025-06-04 07:04:45] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2025-06-04 07:04:45] [INFO ] Deduced a trap composed of 29 places in 348 ms of which 8 ms to minimize.
[2025-06-04 07:04:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:04:46] [INFO ] [Nat]Absence check using 221 positive place invariants in 77 ms returned sat
[2025-06-04 07:04:46] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2025-06-04 07:04:47] [INFO ] Deduced a trap composed of 29 places in 353 ms of which 8 ms to minimize.
[2025-06-04 07:04:47] [INFO ] Deduced a trap composed of 15 places in 330 ms of which 6 ms to minimize.
[2025-06-04 07:04:47] [INFO ] Deduced a trap composed of 22 places in 320 ms of which 7 ms to minimize.
[2025-06-04 07:04:48] [INFO ] Deduced a trap composed of 23 places in 308 ms of which 7 ms to minimize.
[2025-06-04 07:04:48] [INFO ] Deduced a trap composed of 28 places in 304 ms of which 6 ms to minimize.
[2025-06-04 07:04:49] [INFO ] Deduced a trap composed of 21 places in 302 ms of which 6 ms to minimize.
[2025-06-04 07:04:49] [INFO ] Deduced a trap composed of 21 places in 298 ms of which 6 ms to minimize.
[2025-06-04 07:04:49] [INFO ] Deduced a trap composed of 23 places in 296 ms of which 6 ms to minimize.
[2025-06-04 07:04:50] [INFO ] Deduced a trap composed of 23 places in 298 ms of which 6 ms to minimize.
[2025-06-04 07:04:50] [INFO ] Deduced a trap composed of 21 places in 290 ms of which 6 ms to minimize.
[2025-06-04 07:04:50] [INFO ] Deduced a trap composed of 29 places in 284 ms of which 6 ms to minimize.
[2025-06-04 07:04:51] [INFO ] Deduced a trap composed of 18 places in 275 ms of which 6 ms to minimize.
[2025-06-04 07:04: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 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 07:04:51] [INFO ] [Real]Absence check using 221 positive place invariants in 72 ms returned sat
[2025-06-04 07:04:51] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2025-06-04 07:04:52] [INFO ] Deduced a trap composed of 25 places in 384 ms of which 7 ms to minimize.
[2025-06-04 07:04:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:04:52] [INFO ] [Nat]Absence check using 221 positive place invariants in 75 ms returned sat
[2025-06-04 07:04:53] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2025-06-04 07:04:53] [INFO ] Deduced a trap composed of 25 places in 375 ms of which 8 ms to minimize.
[2025-06-04 07:04:53] [INFO ] Deduced a trap composed of 23 places in 386 ms of which 8 ms to minimize.
[2025-06-04 07:04:54] [INFO ] Deduced a trap composed of 32 places in 358 ms of which 7 ms to minimize.
[2025-06-04 07:04:54] [INFO ] Deduced a trap composed of 29 places in 372 ms of which 8 ms to minimize.
[2025-06-04 07:04:55] [INFO ] Deduced a trap composed of 44 places in 367 ms of which 8 ms to minimize.
[2025-06-04 07:04:55] [INFO ] Deduced a trap composed of 33 places in 364 ms of which 8 ms to minimize.
[2025-06-04 07:04:56] [INFO ] Deduced a trap composed of 25 places in 349 ms of which 7 ms to minimize.
[2025-06-04 07:04:56] [INFO ] Deduced a trap composed of 20 places in 343 ms of which 7 ms to minimize.
[2025-06-04 07:04:56] [INFO ] Deduced a trap composed of 37 places in 347 ms of which 7 ms to minimize.
[2025-06-04 07:04:57] [INFO ] Deduced a trap composed of 23 places in 349 ms of which 7 ms to minimize.
[2025-06-04 07:04:57] [INFO ] Deduced a trap composed of 24 places in 341 ms of which 7 ms to minimize.
[2025-06-04 07:04: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 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 1563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 378 transitions
Trivial Post-agglo rules discarded 378 transitions
Performed 378 trivial Post agglomeration. Transition count delta: 378
Iterating post reduction 0 with 378 rules applied. Total rules applied 378 place count 1563 transition count 1045
Reduce places removed 378 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 380 rules applied. Total rules applied 758 place count 1185 transition count 1043
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 763 place count 1184 transition count 1039
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 767 place count 1180 transition count 1039
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 80 Pre rules applied. Total rules applied 767 place count 1180 transition count 959
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 927 place count 1100 transition count 959
Discarding 139 places :
Symmetric choice reduction at 4 with 139 rule applications. Total rules 1066 place count 961 transition count 820
Iterating global reduction 4 with 139 rules applied. Total rules applied 1205 place count 961 transition count 820
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 1205 place count 961 transition count 762
Deduced a syphon composed of 58 places in 14 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1321 place count 903 transition count 762
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 1 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 4 with 678 rules applied. Total rules applied 1999 place count 564 transition count 423
Renaming transitions due to excessive name length > 1024 char.
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 2115 place count 506 transition count 423
Partial Free-agglomeration rule applied 57 times.
Drop transitions (Partial Free agglomeration) removed 57 transitions
Iterating global reduction 4 with 57 rules applied. Total rules applied 2172 place count 506 transition count 423
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2173 place count 505 transition count 422
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2174 place count 504 transition count 422
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2174 place count 504 transition count 420
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2178 place count 502 transition count 420
Applied a total of 2178 rules in 446 ms. Remains 502 /1563 variables (removed 1061) and now considering 420/1423 (removed 1003) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 458 ms. Remains : 502/1563 places, 420/1423 transitions.
// Phase 1: matrix 420 rows 502 cols
[2025-06-04 07:04:58] [INFO ] Computed 220 invariants in 3 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 4868 ms. (205 steps per ms)
FORMULA ShieldPPPt-PT-020B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 2893 ms. (345 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 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 07:05:06] [INFO ] Flatten gal took : 74 ms
[2025-06-04 07:05:06] [INFO ] Flatten gal took : 32 ms
[2025-06-04 07:05:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17874186714978903167.gal : 21 ms
[2025-06-04 07:05:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1938836807762478610.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/ReachabilityCardinality17874186714978903167.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1938836807762478610.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 ...329
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 54909 ms.

BK_STOP 1749020706236

--------------------
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="ShieldPPPt-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 ShieldPPPt-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-174894546800111"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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