About the Execution of 2024-gold for MedleyB-PT-B05
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15694.090 | 94898.00 | 120694.00 | 376.10 | 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.r265-tall-174931349700058.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 MedleyB-PT-B05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-174931349700058
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 7.2K Jun 6 09:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Jun 6 09:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 6 09:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Jun 6 09:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 12:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 12:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 12:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.0K Jun 6 09:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Jun 6 09:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 6 09:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 6 09:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 1.2M Jun 5 20:08 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 MedleyB-PT-B05-UpperBounds-00
FORMULA_NAME MedleyB-PT-B05-UpperBounds-01
FORMULA_NAME MedleyB-PT-B05-UpperBounds-02
FORMULA_NAME MedleyB-PT-B05-UpperBounds-03
FORMULA_NAME MedleyB-PT-B05-UpperBounds-04
FORMULA_NAME MedleyB-PT-B05-UpperBounds-05
FORMULA_NAME MedleyB-PT-B05-UpperBounds-06
FORMULA_NAME MedleyB-PT-B05-UpperBounds-07
FORMULA_NAME MedleyB-PT-B05-UpperBounds-08
FORMULA_NAME MedleyB-PT-B05-UpperBounds-09
FORMULA_NAME MedleyB-PT-B05-UpperBounds-10
FORMULA_NAME MedleyB-PT-B05-UpperBounds-11
FORMULA_NAME MedleyB-PT-B05-UpperBounds-12
FORMULA_NAME MedleyB-PT-B05-UpperBounds-13
FORMULA_NAME MedleyB-PT-B05-UpperBounds-14
FORMULA_NAME MedleyB-PT-B05-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1749319026126
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-07 17:57:07] [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-07 17:57:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:57:07] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2025-06-07 17:57:07] [INFO ] Transformed 1831 places.
[2025-06-07 17:57:07] [INFO ] Transformed 3454 transitions.
[2025-06-07 17:57:07] [INFO ] Found NUPN structural information;
[2025-06-07 17:57:07] [INFO ] Parsed PT model containing 1831 places and 3454 transitions and 22350 arcs in 331 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 3454 rows 1831 cols
[2025-06-07 17:57:07] [INFO ] Computed 7 invariants in 101 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 (89 resets) in 53 ms. (185 steps per ms)
FORMULA MedleyB-PT-B05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110006 steps (160 resets) in 126 ms. (866 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-07 17:57:08] [INFO ] Invariant cache hit.
[2025-06-07 17:57:08] [INFO ] [Real]Absence check using 7 positive place invariants in 41 ms returned sat
[2025-06-07 17:57:09] [INFO ] [Real]Absence check using state equation in 900 ms returned sat
[2025-06-07 17:57:11] [INFO ] Deduced a trap composed of 300 places in 1494 ms of which 95 ms to minimize.
[2025-06-07 17:57:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 33 ms returned sat
[2025-06-07 17:57:12] [INFO ] [Nat]Absence check using state equation in 1007 ms returned sat
[2025-06-07 17:57:14] [INFO ] Deduced a trap composed of 300 places in 1238 ms of which 16 ms to minimize.
[2025-06-07 17:57:15] [INFO ] Deduced a trap composed of 472 places in 1144 ms of which 11 ms to minimize.
[2025-06-07 17:57:16] [INFO ] Deduced a trap composed of 400 places in 1126 ms of which 11 ms to minimize.
[2025-06-07 17:57:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-07 17:57:16] [INFO ] [Real]Absence check using 7 positive place invariants in 33 ms returned sat
[2025-06-07 17:57:17] [INFO ] [Real]Absence check using state equation in 957 ms returned sat
[2025-06-07 17:57:18] [INFO ] Deduced a trap composed of 396 places in 1000 ms of which 9 ms to minimize.
[2025-06-07 17:57:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 33 ms returned sat
[2025-06-07 17:57:20] [INFO ] [Nat]Absence check using state equation in 946 ms returned sat
[2025-06-07 17:57:21] [INFO ] Deduced a trap composed of 396 places in 1018 ms of which 9 ms to minimize.
[2025-06-07 17:57:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1237 ms
[2025-06-07 17:57:21] [INFO ] Computed and/alt/rep : 3279/10994/3279 causal constraints (skipped 174 transitions) in 274 ms.
Maximisation of solution failed !
Minimization took 3 ms.
[2025-06-07 17:57:24] [INFO ] [Real]Absence check using 7 positive place invariants in 31 ms returned sat
[2025-06-07 17:57:25] [INFO ] [Real]Absence check using state equation in 914 ms returned sat
[2025-06-07 17:57:26] [INFO ] Deduced a trap composed of 296 places in 1219 ms of which 10 ms to minimize.
[2025-06-07 17:57:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 34 ms returned sat
[2025-06-07 17:57:28] [INFO ] [Nat]Absence check using state equation in 849 ms returned sat
[2025-06-07 17:57:29] [INFO ] Deduced a trap composed of 296 places in 1211 ms of which 12 ms to minimize.
[2025-06-07 17:57:30] [INFO ] Deduced a trap composed of 297 places in 1141 ms of which 13 ms to minimize.
[2025-06-07 17:57:31] [INFO ] Deduced a trap composed of 284 places in 1009 ms of which 10 ms to minimize.
[2025-06-07 17:57:32] [INFO ] Deduced a trap composed of 398 places in 1172 ms of which 12 ms to minimize.
[2025-06-07 17:57:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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-07 17:57:33] [INFO ] [Real]Absence check using 7 positive place invariants in 33 ms returned sat
[2025-06-07 17:57:34] [INFO ] [Real]Absence check using state equation in 862 ms returned sat
[2025-06-07 17:57:35] [INFO ] Deduced a trap composed of 296 places in 986 ms of which 9 ms to minimize.
[2025-06-07 17:57:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:35] [INFO ] [Nat]Absence check using 7 positive place invariants in 32 ms returned sat
[2025-06-07 17:57:36] [INFO ] [Nat]Absence check using state equation in 850 ms returned sat
[2025-06-07 17:57:37] [INFO ] Deduced a trap composed of 296 places in 1002 ms of which 9 ms to minimize.
[2025-06-07 17:57:38] [INFO ] Deduced a trap composed of 396 places in 843 ms of which 8 ms to minimize.
[2025-06-07 17:57:39] [INFO ] Deduced a trap composed of 204 places in 905 ms of which 9 ms to minimize.
[2025-06-07 17:57:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3103 ms
[2025-06-07 17:57:40] [INFO ] Computed and/alt/rep : 3279/10994/3279 causal constraints (skipped 174 transitions) in 414 ms.
[2025-06-07 17:57:40] [INFO ] Added : 15 causal constraints over 3 iterations in 772 ms. Result :unknown
[2025-06-07 17:57:40] [INFO ] [Real]Absence check using 7 positive place invariants in 32 ms returned sat
[2025-06-07 17:57:41] [INFO ] [Real]Absence check using state equation in 885 ms returned sat
[2025-06-07 17:57:42] [INFO ] Deduced a trap composed of 208 places in 1047 ms of which 9 ms to minimize.
[2025-06-07 17:57:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 32 ms returned sat
[2025-06-07 17:57:43] [INFO ] [Nat]Absence check using state equation in 850 ms returned sat
[2025-06-07 17:57:45] [INFO ] Deduced a trap composed of 208 places in 1069 ms of which 10 ms to minimize.
[2025-06-07 17:57:46] [INFO ] Deduced a trap composed of 399 places in 942 ms of which 9 ms to minimize.
[2025-06-07 17:57:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2337 ms
[2025-06-07 17:57:46] [INFO ] Computed and/alt/rep : 3279/10994/3279 causal constraints (skipped 174 transitions) in 232 ms.
[2025-06-07 17:57:47] [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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
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-07 17:57:48] [INFO ] [Real]Absence check using 7 positive place invariants in 35 ms returned sat
[2025-06-07 17:57:49] [INFO ] [Real]Absence check using state equation in 900 ms returned sat
[2025-06-07 17:57:50] [INFO ] Deduced a trap composed of 298 places in 1122 ms of which 15 ms to minimize.
[2025-06-07 17:57:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 35 ms returned sat
[2025-06-07 17:57:51] [INFO ] [Nat]Absence check using state equation in 869 ms returned sat
[2025-06-07 17:57:52] [INFO ] Deduced a trap composed of 298 places in 1123 ms of which 10 ms to minimize.
[2025-06-07 17:57:53] [INFO ] Deduced a trap composed of 395 places in 961 ms of which 9 ms to minimize.
[2025-06-07 17:57:55] [INFO ] Deduced a trap composed of 296 places in 1052 ms of which 10 ms to minimize.
[2025-06-07 17:57:56] [INFO ] Deduced a trap composed of 398 places in 978 ms of which 9 ms to minimize.
[2025-06-07 17:57:56] [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-07 17:57:56] [INFO ] [Real]Absence check using 7 positive place invariants in 33 ms returned sat
[2025-06-07 17:57:57] [INFO ] [Real]Absence check using state equation in 896 ms returned sat
[2025-06-07 17:57:58] [INFO ] Deduced a trap composed of 296 places in 1071 ms of which 10 ms to minimize.
[2025-06-07 17:57:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 33 ms returned sat
[2025-06-07 17:57:59] [INFO ] [Nat]Absence check using state equation in 913 ms returned sat
[2025-06-07 17:58:00] [INFO ] Deduced a trap composed of 296 places in 1090 ms of which 10 ms to minimize.
[2025-06-07 17:58:02] [INFO ] Deduced a trap composed of 395 places in 986 ms of which 12 ms to minimize.
[2025-06-07 17:58:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2364 ms
[2025-06-07 17:58:02] [INFO ] Computed and/alt/rep : 3279/10994/3279 causal constraints (skipped 174 transitions) in 189 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-06-07 17:58:03] [INFO ] [Real]Absence check using 7 positive place invariants in 34 ms returned sat
[2025-06-07 17:58:04] [INFO ] [Real]Absence check using state equation in 871 ms returned sat
[2025-06-07 17:58:05] [INFO ] Deduced a trap composed of 437 places in 1064 ms of which 9 ms to minimize.
[2025-06-07 17:58:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:58:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 32 ms returned sat
[2025-06-07 17:58:07] [INFO ] [Nat]Absence check using state equation in 867 ms returned sat
[2025-06-07 17:58:08] [INFO ] Deduced a trap composed of 437 places in 1085 ms of which 10 ms to minimize.
[2025-06-07 17:58:09] [INFO ] Deduced a trap composed of 296 places in 973 ms of which 9 ms to minimize.
[2025-06-07 17:58:10] [INFO ] Deduced a trap composed of 395 places in 925 ms of which 8 ms to minimize.
[2025-06-07 17:58:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3345 ms
[2025-06-07 17:58:10] [INFO ] Computed and/alt/rep : 3279/10994/3279 causal constraints (skipped 174 transitions) in 192 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-06-07 17:58:11] [INFO ] [Real]Absence check using 7 positive place invariants in 33 ms returned sat
[2025-06-07 17:58:12] [INFO ] [Real]Absence check using state equation in 919 ms returned sat
[2025-06-07 17:58:13] [INFO ] Deduced a trap composed of 329 places in 1090 ms of which 9 ms to minimize.
[2025-06-07 17:58:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:58:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 32 ms returned sat
[2025-06-07 17:58:14] [INFO ] [Nat]Absence check using state equation in 921 ms returned sat
[2025-06-07 17:58:16] [INFO ] Deduced a trap composed of 329 places in 1162 ms of which 10 ms to minimize.
[2025-06-07 17:58:17] [INFO ] Deduced a trap composed of 463 places in 995 ms of which 9 ms to minimize.
[2025-06-07 17:58:18] [INFO ] Deduced a trap composed of 489 places in 863 ms of which 8 ms to minimize.
[2025-06-07 17:58:19] [INFO ] Deduced a trap composed of 301 places in 913 ms of which 8 ms to minimize.
[2025-06-07 17:58:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
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-07 17:58:19] [INFO ] [Real]Absence check using 7 positive place invariants in 33 ms returned sat
[2025-06-07 17:58:20] [INFO ] [Real]Absence check using state equation in 933 ms returned sat
[2025-06-07 17:58:21] [INFO ] Deduced a trap composed of 296 places in 1118 ms of which 10 ms to minimize.
[2025-06-07 17:58:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:58:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 35 ms returned sat
[2025-06-07 17:58:23] [INFO ] [Nat]Absence check using state equation in 885 ms returned sat
[2025-06-07 17:58:24] [INFO ] Deduced a trap composed of 296 places in 1144 ms of which 9 ms to minimize.
[2025-06-07 17:58:25] [INFO ] Deduced a trap composed of 395 places in 1030 ms of which 9 ms to minimize.
[2025-06-07 17:58:26] [INFO ] Deduced a trap composed of 303 places in 1167 ms of which 9 ms to minimize.
[2025-06-07 17:58:27] [INFO ] Deduced a trap composed of 399 places in 947 ms of which 9 ms to minimize.
[2025-06-07 17:58:27] [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 9
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-07 17:58:28] [INFO ] [Real]Absence check using 7 positive place invariants in 32 ms returned sat
[2025-06-07 17:58:28] [INFO ] [Real]Absence check using state equation in 853 ms returned sat
[2025-06-07 17:58:30] [INFO ] Deduced a trap composed of 399 places in 1242 ms of which 11 ms to minimize.
[2025-06-07 17:58:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:58:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 35 ms returned sat
[2025-06-07 17:58:31] [INFO ] [Nat]Absence check using state equation in 927 ms returned sat
[2025-06-07 17:58:32] [INFO ] Deduced a trap composed of 399 places in 1214 ms of which 11 ms to minimize.
[2025-06-07 17:58:34] [INFO ] Deduced a trap composed of 300 places in 1117 ms of which 10 ms to minimize.
[2025-06-07 17:58:35] [INFO ] Deduced a trap composed of 399 places in 986 ms of which 10 ms to minimize.
[2025-06-07 17:58:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3680 ms
[2025-06-07 17:58:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:954)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
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, 0, 0, 0] Max Struct:[1, 1, 1, 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, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 11 out of 1831 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1831/1831 places, 3454/3454 transitions.
Graph (trivial) has 1799 edges and 1831 vertex of which 117 / 1831 are part of one of the 18 SCC in 12 ms
Free SCC test removed 99 places
Drop transitions (Empty/Sink Transition effects.) removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Graph (complete) has 2725 edges and 1732 vertex of which 1720 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.21 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1365 transitions
Trivial Post-agglo rules discarded 1365 transitions
Performed 1365 trivial Post agglomeration. Transition count delta: 1365
Iterating post reduction 0 with 1371 rules applied. Total rules applied 1373 place count 1720 transition count 1949
Reduce places removed 1365 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 1406 rules applied. Total rules applied 2779 place count 355 transition count 1908
Reduce places removed 16 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 23 rules applied. Total rules applied 2802 place count 339 transition count 1901
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 2809 place count 332 transition count 1901
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 62 Pre rules applied. Total rules applied 2809 place count 332 transition count 1839
Deduced a syphon composed of 62 places in 2 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 2933 place count 270 transition count 1839
Discarding 71 places :
Symmetric choice reduction at 4 with 71 rule applications. Total rules 3004 place count 199 transition count 1768
Iterating global reduction 4 with 71 rules applied. Total rules applied 3075 place count 199 transition count 1768
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3075 place count 199 transition count 1767
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3077 place count 198 transition count 1767
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 3114 place count 161 transition count 401
Iterating global reduction 4 with 37 rules applied. Total rules applied 3151 place count 161 transition count 401
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 3169 place count 161 transition count 383
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 3177 place count 153 transition count 375
Iterating global reduction 5 with 8 rules applied. Total rules applied 3185 place count 153 transition count 375
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 3193 place count 145 transition count 367
Iterating global reduction 5 with 8 rules applied. Total rules applied 3201 place count 145 transition count 367
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 3209 place count 145 transition count 359
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 3247 place count 126 transition count 340
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3248 place count 126 transition count 339
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 3254 place count 120 transition count 333
Iterating global reduction 7 with 6 rules applied. Total rules applied 3260 place count 120 transition count 333
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 3266 place count 114 transition count 327
Iterating global reduction 7 with 6 rules applied. Total rules applied 3272 place count 114 transition count 327
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 3277 place count 109 transition count 322
Iterating global reduction 7 with 5 rules applied. Total rules applied 3282 place count 109 transition count 322
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 3290 place count 105 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3291 place count 105 transition count 336
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 3292 place count 105 transition count 335
Free-agglomeration rule applied 39 times.
Iterating global reduction 8 with 39 rules applied. Total rules applied 3331 place count 105 transition count 296
Reduce places removed 39 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 56 rules applied. Total rules applied 3387 place count 66 transition count 279
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 3393 place count 60 transition count 273
Iterating global reduction 9 with 6 rules applied. Total rules applied 3399 place count 60 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 71 transitions
Redundant transition composition rules discarded 71 transitions
Iterating global reduction 9 with 71 rules applied. Total rules applied 3470 place count 60 transition count 202
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3472 place count 60 transition count 200
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 3474 place count 58 transition count 200
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 10 with 9 rules applied. Total rules applied 3483 place count 58 transition count 200
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 3489 place count 58 transition count 194
Applied a total of 3489 rules in 383 ms. Remains 58 /1831 variables (removed 1773) and now considering 194/3454 (removed 3260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 394 ms. Remains : 58/1831 places, 194/3454 transitions.
// Phase 1: matrix 194 rows 58 cols
[2025-06-07 17:58:35] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 4317 ms. (231 steps per ms)
FORMULA MedleyB-PT-B05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 405 ms. (2463 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-07 17:58:40] [INFO ] Flatten gal took : 68 ms
[2025-06-07 17:58:40] [INFO ] Flatten gal took : 28 ms
[2025-06-07 17:58:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2768810904407961623.gal : 12 ms
[2025-06-07 17:58:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17184705669734595632.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/ReachabilityCardinality2768810904407961623.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17184705669734595632.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
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 93610 ms.
BK_STOP 1749319121024
--------------------
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="MedleyB-PT-B05"
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 MedleyB-PT-B05, 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 r265-tall-174931349700058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyB-PT-B05.tgz
mv MedleyB-PT-B05 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 '
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 ;