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

About the Execution of 2024-gold for ShieldIIPt-PT-040B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15690.360 213406.00 241551.00 450.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-174894546700071.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-040B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r209-tall-174894546700071
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 686K 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-040B-UpperBounds-00
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-01
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-02
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-03
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-04
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-05
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-06
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-07
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-08
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-09
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-10
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-11
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-12
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-13
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-14
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749020263146

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-040B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-04 06:57:44] [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:57:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 06:57:44] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2025-06-04 06:57:44] [INFO ] Transformed 2803 places.
[2025-06-04 06:57:44] [INFO ] Transformed 2603 transitions.
[2025-06-04 06:57:44] [INFO ] Found NUPN structural information;
[2025-06-04 06:57:44] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 393 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 2603 rows 2803 cols
[2025-06-04 06:57:45] [INFO ] Computed 361 invariants in 56 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 118 ms. (84 steps per ms)
FORMULA ShieldIIPt-PT-040B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (16 resets) in 109 ms. (727 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-04 06:57:45] [INFO ] Invariant cache hit.
[2025-06-04 06:57:46] [INFO ] [Real]Absence check using 361 positive place invariants in 174 ms returned sat
[2025-06-04 06:57:47] [INFO ] [Real]Absence check using state equation in 1061 ms returned sat
[2025-06-04 06:57:48] [INFO ] Deduced a trap composed of 20 places in 1130 ms of which 117 ms to minimize.
[2025-06-04 06:57:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 06:57:49] [INFO ] [Nat]Absence check using 361 positive place invariants in 163 ms returned sat
[2025-06-04 06:57:50] [INFO ] [Nat]Absence check using state equation in 1032 ms returned sat
[2025-06-04 06:57:51] [INFO ] Deduced a trap composed of 20 places in 1014 ms of which 17 ms to minimize.
[2025-06-04 06:57:52] [INFO ] Deduced a trap composed of 18 places in 954 ms of which 16 ms to minimize.
[2025-06-04 06:57:53] [INFO ] Deduced a trap composed of 22 places in 1048 ms of which 15 ms to minimize.
[2025-06-04 06:57:54] [INFO ] Deduced a trap composed of 18 places in 953 ms of which 14 ms to minimize.
[2025-06-04 06:57:54] [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:55] [INFO ] [Real]Absence check using 361 positive place invariants in 170 ms returned sat
[2025-06-04 06:57:56] [INFO ] [Real]Absence check using state equation in 1028 ms returned sat
[2025-06-04 06:57:57] [INFO ] Deduced a trap composed of 23 places in 920 ms of which 13 ms to minimize.
[2025-06-04 06:57:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 06:57:58] [INFO ] [Nat]Absence check using 361 positive place invariants in 161 ms returned sat
[2025-06-04 06:57:59] [INFO ] [Nat]Absence check using state equation in 1000 ms returned sat
[2025-06-04 06:58:00] [INFO ] Deduced a trap composed of 23 places in 898 ms of which 13 ms to minimize.
[2025-06-04 06:58:01] [INFO ] Deduced a trap composed of 21 places in 901 ms of which 13 ms to minimize.
[2025-06-04 06:58:02] [INFO ] Deduced a trap composed of 15 places in 906 ms of which 12 ms to minimize.
[2025-06-04 06:58:03] [INFO ] Deduced a trap composed of 19 places in 864 ms of which 13 ms to minimize.
[2025-06-04 06:58: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 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:58:03] [INFO ] [Real]Absence check using 361 positive place invariants in 152 ms returned sat
[2025-06-04 06:58:05] [INFO ] [Real]Absence check using state equation in 1330 ms returned sat
[2025-06-04 06:58:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 06:58:05] [INFO ] [Nat]Absence check using 361 positive place invariants in 151 ms returned sat
[2025-06-04 06:58:06] [INFO ] [Nat]Absence check using state equation in 1029 ms returned sat
[2025-06-04 06:58:07] [INFO ] Deduced a trap composed of 14 places in 958 ms of which 14 ms to minimize.
[2025-06-04 06:58:08] [INFO ] Deduced a trap composed of 21 places in 935 ms of which 13 ms to minimize.
[2025-06-04 06:58:09] [INFO ] Deduced a trap composed of 21 places in 935 ms of which 13 ms to minimize.
[2025-06-04 06:58:10] [INFO ] Deduced a trap composed of 29 places in 919 ms of which 12 ms to minimize.
[2025-06-04 06:58:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:58:11] [INFO ] [Real]Absence check using 361 positive place invariants in 151 ms returned sat
[2025-06-04 06:58:12] [INFO ] [Real]Absence check using state equation in 1054 ms returned sat
[2025-06-04 06:58:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 06:58:12] [INFO ] [Nat]Absence check using 361 positive place invariants in 152 ms returned sat
[2025-06-04 06:58:13] [INFO ] [Nat]Absence check using state equation in 1021 ms returned sat
[2025-06-04 06:58:15] [INFO ] Deduced a trap composed of 18 places in 939 ms of which 13 ms to minimize.
[2025-06-04 06:58:16] [INFO ] Deduced a trap composed of 29 places in 937 ms of which 14 ms to minimize.
[2025-06-04 06:58:17] [INFO ] Deduced a trap composed of 14 places in 926 ms of which 13 ms to minimize.
[2025-06-04 06:58:18] [INFO ] Deduced a trap composed of 38 places in 910 ms of which 13 ms to minimize.
[2025-06-04 06:58: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 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:58:18] [INFO ] [Real]Absence check using 361 positive place invariants in 162 ms returned sat
[2025-06-04 06:58:19] [INFO ] [Real]Absence check using state equation in 1042 ms returned sat
[2025-06-04 06:58:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 06:58:20] [INFO ] [Nat]Absence check using 361 positive place invariants in 150 ms returned sat
[2025-06-04 06:58:21] [INFO ] [Nat]Absence check using state equation in 950 ms returned sat
[2025-06-04 06:58:22] [INFO ] Deduced a trap composed of 19 places in 1316 ms of which 17 ms to minimize.
[2025-06-04 06:58:24] [INFO ] Deduced a trap composed of 24 places in 1303 ms of which 16 ms to minimize.
[2025-06-04 06:58:25] [INFO ] Deduced a trap composed of 18 places in 1304 ms of which 17 ms to minimize.
[2025-06-04 06:58: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 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:58:25] [INFO ] [Real]Absence check using 361 positive place invariants in 152 ms returned sat
[2025-06-04 06:58:26] [INFO ] [Real]Absence check using state equation in 1033 ms returned sat
[2025-06-04 06:58:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 06:58:27] [INFO ] [Nat]Absence check using 361 positive place invariants in 149 ms returned sat
[2025-06-04 06:58:28] [INFO ] [Nat]Absence check using state equation in 977 ms returned sat
[2025-06-04 06:58:29] [INFO ] Deduced a trap composed of 30 places in 850 ms of which 13 ms to minimize.
[2025-06-04 06:58:30] [INFO ] Deduced a trap composed of 27 places in 895 ms of which 13 ms to minimize.
[2025-06-04 06:58:31] [INFO ] Deduced a trap composed of 15 places in 906 ms of which 13 ms to minimize.
[2025-06-04 06:58:32] [INFO ] Deduced a trap composed of 17 places in 886 ms of which 13 ms to minimize.
[2025-06-04 06:58: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:58:33] [INFO ] [Real]Absence check using 361 positive place invariants in 164 ms returned sat
[2025-06-04 06:58:34] [INFO ] [Real]Absence check using state equation in 1086 ms returned sat
[2025-06-04 06:58:35] [INFO ] Deduced a trap composed of 26 places in 1041 ms of which 15 ms to minimize.
[2025-06-04 06:58:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 06:58:36] [INFO ] [Nat]Absence check using 361 positive place invariants in 155 ms returned sat
[2025-06-04 06:58:37] [INFO ] [Nat]Absence check using state equation in 1089 ms returned sat
[2025-06-04 06:58:38] [INFO ] Deduced a trap composed of 26 places in 1062 ms of which 14 ms to minimize.
[2025-06-04 06:58:39] [INFO ] Deduced a trap composed of 46 places in 1029 ms of which 15 ms to minimize.
[2025-06-04 06:58:40] [INFO ] Deduced a trap composed of 17 places in 988 ms of which 16 ms to minimize.
[2025-06-04 06:58:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-04 06:58:41] [INFO ] [Real]Absence check using 361 positive place invariants in 170 ms returned sat
[2025-06-04 06:58:42] [INFO ] [Real]Absence check using state equation in 1149 ms returned sat
[2025-06-04 06:58:43] [INFO ] Deduced a trap composed of 14 places in 930 ms of which 14 ms to minimize.
[2025-06-04 06:58:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 06:58:44] [INFO ] [Nat]Absence check using 361 positive place invariants in 169 ms returned sat
[2025-06-04 06:58:45] [INFO ] [Nat]Absence check using state equation in 1159 ms returned sat
[2025-06-04 06:58:46] [INFO ] Deduced a trap composed of 14 places in 916 ms of which 13 ms to minimize.
[2025-06-04 06:58:47] [INFO ] Deduced a trap composed of 28 places in 938 ms of which 14 ms to minimize.
[2025-06-04 06:58:48] [INFO ] Deduced a trap composed of 28 places in 906 ms of which 13 ms to minimize.
[2025-06-04 06:58:49] [INFO ] Deduced a trap composed of 25 places in 905 ms of which 16 ms to minimize.
[2025-06-04 06:58:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 678 transitions
Trivial Post-agglo rules discarded 678 transitions
Performed 678 trivial Post agglomeration. Transition count delta: 678
Iterating post reduction 0 with 678 rules applied. Total rules applied 678 place count 2803 transition count 1925
Reduce places removed 678 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 680 rules applied. Total rules applied 1358 place count 2125 transition count 1923
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1359 place count 2124 transition count 1923
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 161 Pre rules applied. Total rules applied 1359 place count 2124 transition count 1762
Deduced a syphon composed of 161 places in 3 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 3 with 322 rules applied. Total rules applied 1681 place count 1963 transition count 1762
Discarding 278 places :
Symmetric choice reduction at 3 with 278 rule applications. Total rules 1959 place count 1685 transition count 1484
Iterating global reduction 3 with 278 rules applied. Total rules applied 2237 place count 1685 transition count 1484
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 119 Pre rules applied. Total rules applied 2237 place count 1685 transition count 1365
Deduced a syphon composed of 119 places in 8 ms
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 238 rules applied. Total rules applied 2475 place count 1566 transition count 1365
Performed 678 Post agglomeration using F-continuation condition.Transition count delta: 678
Deduced a syphon composed of 678 places in 2 ms
Reduce places removed 678 places and 0 transitions.
Iterating global reduction 3 with 1356 rules applied. Total rules applied 3831 place count 888 transition count 687
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4033 place count 787 transition count 752
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 4065 place count 771 transition count 763
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4066 place count 771 transition count 762
Partial Free-agglomeration rule applied 41 times.
Drop transitions (Partial Free agglomeration) removed 41 transitions
Iterating global reduction 4 with 41 rules applied. Total rules applied 4107 place count 771 transition count 762
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4108 place count 770 transition count 761
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4110 place count 768 transition count 761
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4110 place count 768 transition count 760
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4112 place count 767 transition count 760
Applied a total of 4112 rules in 953 ms. Remains 767 /2803 variables (removed 2036) and now considering 760/2603 (removed 1843) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 963 ms. Remains : 767/2803 places, 760/2603 transitions.
// Phase 1: matrix 760 rows 767 cols
[2025-06-04 06:58:50] [INFO ] Computed 359 invariants in 3 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 (2 resets) in 6878 ms. (145 steps per ms)
FORMULA ShieldIIPt-PT-040B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5000004 steps (10 resets) in 23632 ms. (211 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-04 06:59:20] [INFO ] Invariant cache hit.
[2025-06-04 06:59:20] [INFO ] [Real]Absence check using 359 positive place invariants in 46 ms returned sat
[2025-06-04 06:59:21] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2025-06-04 06:59:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-04 06:59:21] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-04 06:59:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 06:59:21] [INFO ] [Nat]Absence check using 359 positive place invariants in 50 ms returned sat
[2025-06-04 06:59:21] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2025-06-04 06:59:21] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 06:59:21] [INFO ] Computed and/alt/rep : 757/1351/757 causal constraints (skipped 0 transitions) in 41 ms.
[2025-06-04 06:59:30] [INFO ] Added : 677 causal constraints over 136 iterations in 9246 ms. Result :sat
Minimization took 1161 ms.
[2025-06-04 06:59:32] [INFO ] [Real]Absence check using 359 positive place invariants in 46 ms returned sat
[2025-06-04 06:59:32] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2025-06-04 06:59:32] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-04 06:59:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 06:59:32] [INFO ] [Nat]Absence check using 359 positive place invariants in 49 ms returned sat
[2025-06-04 06:59:32] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2025-06-04 06:59:32] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 06:59:32] [INFO ] Computed and/alt/rep : 757/1351/757 causal constraints (skipped 0 transitions) in 43 ms.
[2025-06-04 06:59:42] [INFO ] Added : 678 causal constraints over 137 iterations in 9345 ms. Result :sat
Minimization took 1133 ms.
[2025-06-04 06:59:43] [INFO ] [Real]Absence check using 359 positive place invariants in 48 ms returned sat
[2025-06-04 06:59:43] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2025-06-04 06:59:43] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-04 06:59:43] [INFO ] Computed and/alt/rep : 757/1351/757 causal constraints (skipped 0 transitions) in 38 ms.
[2025-06-04 06:59:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 06:59:44] [INFO ] [Nat]Absence check using 359 positive place invariants in 48 ms returned sat
[2025-06-04 06:59:44] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2025-06-04 06:59:44] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 06:59:44] [INFO ] Computed and/alt/rep : 757/1351/757 causal constraints (skipped 0 transitions) in 35 ms.
[2025-06-04 06:59:52] [INFO ] Added : 682 causal constraints over 137 iterations in 8455 ms. Result :sat
Minimization took 1311 ms.
[2025-06-04 06:59:54] [INFO ] [Real]Absence check using 359 positive place invariants in 45 ms returned sat
[2025-06-04 06:59:54] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2025-06-04 06:59:54] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 06:59:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 06:59:54] [INFO ] [Nat]Absence check using 359 positive place invariants in 46 ms returned sat
[2025-06-04 06:59:54] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2025-06-04 06:59:54] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 06:59:55] [INFO ] Computed and/alt/rep : 757/1351/757 causal constraints (skipped 0 transitions) in 38 ms.
[2025-06-04 07:00:03] [INFO ] Added : 689 causal constraints over 138 iterations in 8746 ms. Result :sat
Minimization took 3641 ms.
[2025-06-04 07:00:07] [INFO ] [Real]Absence check using 359 positive place invariants in 52 ms returned sat
[2025-06-04 07:00:07] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2025-06-04 07:00:07] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-04 07:00:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:00:07] [INFO ] [Nat]Absence check using 359 positive place invariants in 46 ms returned sat
[2025-06-04 07:00:08] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2025-06-04 07:00:08] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 07:00:08] [INFO ] Computed and/alt/rep : 757/1351/757 causal constraints (skipped 0 transitions) in 41 ms.
[2025-06-04 07:00:16] [INFO ] Added : 668 causal constraints over 134 iterations in 8234 ms. Result :sat
Minimization took 761 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA ShieldIIPt-PT-040B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 767 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 767/767 places, 760/760 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 767 transition count 757
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 764 transition count 757
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 764 transition count 756
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 763 transition count 756
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 762 transition count 755
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 760 transition count 758
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 760 transition count 757
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 759 transition count 757
Applied a total of 16 rules in 143 ms. Remains 759 /767 variables (removed 8) and now considering 757/760 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 759/767 places, 757/760 transitions.
// Phase 1: matrix 757 rows 759 cols
[2025-06-04 07:00:20] [INFO ] Computed 359 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 6713 ms. (148 steps per ms)
FORMULA ShieldIIPt-PT-040B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000002 steps (4 resets) in 9358 ms. (213 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-04 07:00:36] [INFO ] Invariant cache hit.
[2025-06-04 07:00:36] [INFO ] [Real]Absence check using 359 positive place invariants in 45 ms returned sat
[2025-06-04 07:00:36] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2025-06-04 07:00:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-04 07:00:36] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-04 07:00:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:00:36] [INFO ] [Nat]Absence check using 359 positive place invariants in 47 ms returned sat
[2025-06-04 07:00:37] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2025-06-04 07:00:37] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-04 07:00:37] [INFO ] Computed and/alt/rep : 754/1347/754 causal constraints (skipped 0 transitions) in 39 ms.
[2025-06-04 07:00:44] [INFO ] Added : 657 causal constraints over 132 iterations in 7758 ms. Result :sat
Minimization took 1435 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 759 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p822) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 753/753 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 757 transition count 751
Applied a total of 4 rules in 47 ms. Remains 757 /759 variables (removed 2) and now considering 751/753 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 757/759 places, 751/753 transitions.
// Phase 1: matrix 751 rows 757 cols
[2025-06-04 07:00:47] [INFO ] Computed 359 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 6581 ms. (151 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 4689 ms. (213 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-04 07:00:58] [INFO ] Invariant cache hit.
[2025-06-04 07:00:58] [INFO ] [Real]Absence check using 359 positive place invariants in 49 ms returned sat
[2025-06-04 07:00:58] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2025-06-04 07:00:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-04 07:00:58] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-06-04 07:00:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:00:59] [INFO ] [Nat]Absence check using 359 positive place invariants in 47 ms returned sat
[2025-06-04 07:00:59] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2025-06-04 07:00:59] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-04 07:00:59] [INFO ] Computed and/alt/rep : 748/1339/748 causal constraints (skipped 0 transitions) in 44 ms.
[2025-06-04 07:01:06] [INFO ] Added : 664 causal constraints over 133 iterations in 7519 ms. Result :sat
Minimization took 354 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 751/751 transitions.
Applied a total of 0 rules in 15 ms. Remains 757 /757 variables (removed 0) and now considering 751/751 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 757/757 places, 751/751 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 751/751 transitions.
Applied a total of 0 rules in 15 ms. Remains 757 /757 variables (removed 0) and now considering 751/751 (removed 0) transitions.
[2025-06-04 07:01:07] [INFO ] Invariant cache hit.
[2025-06-04 07:01:08] [INFO ] Implicit Places using invariants in 417 ms returned [746]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 420 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 756/757 places, 751/751 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 755 transition count 750
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 755 transition count 750
Applied a total of 2 rules in 30 ms. Remains 755 /756 variables (removed 1) and now considering 750/751 (removed 1) transitions.
// Phase 1: matrix 750 rows 755 cols
[2025-06-04 07:01:08] [INFO ] Computed 358 invariants in 8 ms
[2025-06-04 07:01:08] [INFO ] Implicit Places using invariants in 400 ms returned []
[2025-06-04 07:01:08] [INFO ] Invariant cache hit.
[2025-06-04 07:01:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 07:01:09] [INFO ] Implicit Places using invariants and state equation in 775 ms returned []
Implicit Place search using SMT with State Equation took 1177 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 755/757 places, 750/751 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1650 ms. Remains : 755/757 places, 750/751 transitions.
[2025-06-04 07:01:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA ShieldIIPt-PT-040B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 6552 ms. (152 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-04 07:01:16] [INFO ] Flatten gal took : 100 ms
[2025-06-04 07:01:16] [INFO ] Flatten gal took : 58 ms
[2025-06-04 07:01:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4714625630616874522.gal : 27 ms
[2025-06-04 07:01:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16384329431863025238.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/ReachabilityCardinality4714625630616874522.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16384329431863025238.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 212054 ms.

BK_STOP 1749020476552

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-040B"
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-040B, 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-174894546700071"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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