Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r241-tall-171649628400236.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool gold2023
Input is LeafsetExtension-PT-S32C4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r241-tall-171649628400236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 17K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 13:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 13:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 13:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 13:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.4M May 18 16:42 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

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

=== Now, execution of the tool begins

BK_START 1716563646262

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S32C4
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-24 15:14: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]
[2024-05-24 15:14:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:14:08] [INFO ] Load time of PNML (sax parser for PT used): 205 ms
[2024-05-24 15:14:08] [INFO ] Transformed 5622 places.
[2024-05-24 15:14:08] [INFO ] Transformed 5449 transitions.
[2024-05-24 15:14:08] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 538 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 5449 rows 5622 cols
[2024-05-24 15:14:08] [INFO ] Computed 173 invariants in 302 ms
Incomplete random walk after 10000 steps, including 298 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 16) seen :8
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :3
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :2
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :2
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-24 15:14:08] [INFO ] Invariant cache hit.
[2024-05-24 15:14:09] [INFO ] [Real]Absence check using 35 positive place invariants in 75 ms returned sat
[2024-05-24 15:14:09] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 155 ms returned sat
[2024-05-24 15:14:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 15:14:13] [INFO ] [Real]Absence check using state equation in 3303 ms returned sat
[2024-05-24 15:14:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 15:14:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 61 ms returned sat
[2024-05-24 15:14:14] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 144 ms returned sat
[2024-05-24 15:14:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 15:14:17] [INFO ] [Nat]Absence check using state equation in 3218 ms returned sat
[2024-05-24 15:14:17] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 301 ms.
[2024-05-24 15:14:25] [INFO ] Deduced a trap composed of 2 places in 6870 ms of which 11 ms to minimize.
[2024-05-24 15:14: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 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-24 15:14:25] [INFO ] [Real]Absence check using 35 positive place invariants in 55 ms returned sat
[2024-05-24 15:14:25] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 134 ms returned sat
[2024-05-24 15:14:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 15:14:29] [INFO ] [Real]Absence check using state equation in 3256 ms returned sat
[2024-05-24 15:14:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 15:14:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 63 ms returned sat
[2024-05-24 15:14:30] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 153 ms returned sat
[2024-05-24 15:14:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 15:14:33] [INFO ] [Nat]Absence check using state equation in 3278 ms returned sat
[2024-05-24 15:14:33] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 260 ms.
[2024-05-24 15:14:41] [INFO ] Deduced a trap composed of 2 places in 6638 ms of which 7 ms to minimize.
[2024-05-24 15:14:41] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-24 15:14:41] [INFO ] [Real]Absence check using 35 positive place invariants in 55 ms returned sat
[2024-05-24 15:14:41] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 133 ms returned sat
[2024-05-24 15:14:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 15:14:44] [INFO ] [Real]Absence check using state equation in 3169 ms returned sat
[2024-05-24 15:14:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 15:14:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 55 ms returned sat
[2024-05-24 15:14:45] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 140 ms returned sat
[2024-05-24 15:14:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 15:14:48] [INFO ] [Nat]Absence check using state equation in 3118 ms returned sat
[2024-05-24 15:14:49] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 241 ms.
[2024-05-24 15:14:50] [INFO ] Added : 18 causal constraints over 4 iterations in 1082 ms. Result :unknown
[2024-05-24 15:14:50] [INFO ] [Real]Absence check using 35 positive place invariants in 51 ms returned sat
[2024-05-24 15:14:50] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 135 ms returned sat
[2024-05-24 15:14:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 15:14:53] [INFO ] [Real]Absence check using state equation in 3153 ms returned sat
[2024-05-24 15:14:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 15:14:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 55 ms returned sat
[2024-05-24 15:14:54] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 132 ms returned sat
[2024-05-24 15:14:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 15:14:57] [INFO ] [Nat]Absence check using state equation in 3136 ms returned sat
[2024-05-24 15:14:58] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 232 ms.
[2024-05-24 15:15:05] [INFO ] Deduced a trap composed of 2 places in 6570 ms of which 7 ms to minimize.
[2024-05-24 15:15:05] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-24 15:15:06] [INFO ] [Real]Absence check using 35 positive place invariants in 59 ms returned sat
[2024-05-24 15:15:06] [INFO ] [Real]Absence check using 35 positive and 138 generalized place invariants in 138 ms returned sat
[2024-05-24 15:15:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 15:15:09] [INFO ] [Real]Absence check using state equation in 3208 ms returned sat
[2024-05-24 15:15:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 15:15:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 58 ms returned sat
[2024-05-24 15:15:10] [INFO ] [Nat]Absence check using 35 positive and 138 generalized place invariants in 122 ms returned sat
[2024-05-24 15:15:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 15:15:13] [INFO ] [Nat]Absence check using state equation in 3180 ms returned sat
[2024-05-24 15:15:13] [INFO ] Computed and/alt/rep : 5346/7458/5346 causal constraints (skipped 70 transitions) in 242 ms.
[2024-05-24 15:15:21] [INFO ] Deduced a trap composed of 2 places in 6977 ms of which 15 ms to minimize.
[2024-05-24 15:15:21] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, 1] Max seen :[1, 0, 0, 0, 0]
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 5622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Graph (complete) has 11001 edges and 5622 vertex of which 199 are kept as prefixes of interest. Removing 5423 places using SCC suffix rule.18 ms
Discarding 5423 places :
Also discarding 3875 output transitions
Drop transitions removed 3875 transitions
Drop transitions removed 1111 transitions
Reduce isomorphic transitions removed 1111 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 1158 rules applied. Total rules applied 1159 place count 199 transition count 416
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 55 rules applied. Total rules applied 1214 place count 149 transition count 411
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1217 place count 146 transition count 411
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1217 place count 146 transition count 408
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1223 place count 143 transition count 408
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1238 place count 128 transition count 393
Iterating global reduction 3 with 15 rules applied. Total rules applied 1253 place count 128 transition count 393
Free-agglomeration rule applied 32 times.
Iterating global reduction 3 with 32 rules applied. Total rules applied 1285 place count 128 transition count 361
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 1317 place count 96 transition count 361
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1319 place count 96 transition count 359
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1321 place count 94 transition count 359
Partial Free-agglomeration rule applied 45 times.
Drop transitions removed 45 transitions
Iterating global reduction 5 with 45 rules applied. Total rules applied 1366 place count 94 transition count 359
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 1369 place count 91 transition count 359
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1371 place count 91 transition count 357
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1373 place count 89 transition count 357
Applied a total of 1373 rules in 120 ms. Remains 89 /5622 variables (removed 5533) and now considering 357/5449 (removed 5092) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 89/5622 places, 357/5449 transitions.
Successfully produced net in file /tmp/petri1000_3897682174934691802.dot
Successfully produced net in file /tmp/petri1001_18379545517769528411.dot
Successfully produced net in file /tmp/petri1002_13039344647021246413.dot
Successfully produced net in file /tmp/petri1003_2932827276983327419.dot
Successfully produced net in file /tmp/petri1004_2258199125896177284.dot
Successfully produced net in file /tmp/petri1005_10606923578740534683.dot
Successfully produced net in file /tmp/petri1006_3395702887207724350.dot
Successfully produced net in file /tmp/petri1007_14784594003068923902.dot
Successfully produced net in file /tmp/petri1008_4506755033299634253.dot
Successfully produced net in file /tmp/petri1009_10697321289371199795.dot
Successfully produced net in file /tmp/petri1010_11773383480026350649.dot
Successfully produced net in file /tmp/petri1011_12604715801982457879.dot
Successfully produced net in file /tmp/petri1012_11647638088182998379.dot
Successfully produced net in file /tmp/petri1013_11068493883398488626.dot
Successfully produced net in file /tmp/petri1014_6093567420198626839.dot
Successfully produced net in file /tmp/petri1015_502072470911138475.dot
Successfully produced net in file /tmp/petri1016_2878062406594017470.dot
Successfully produced net in file /tmp/petri1017_8171666450146269520.dot
Successfully produced net in file /tmp/petri1018_772270174739957597.dot
Successfully produced net in file /tmp/petri1019_16718723751420846460.dot
Successfully produced net in file /tmp/petri1020_8301176355228431071.dot
Successfully produced net in file /tmp/petri1021_5430325948774703802.dot
Successfully produced net in file /tmp/petri1022_9989903470233170464.dot
Successfully produced net in file /tmp/petri1023_16791120008874156944.dot
Successfully produced net in file /tmp/petri1024_13091060501210693667.dot
Successfully produced net in file /tmp/petri1025_13647577057551414397.dot
Successfully produced net in file /tmp/petri1026_10031023709583406564.dot
Successfully produced net in file /tmp/petri1027_12230645107825243807.dot
Successfully produced net in file /tmp/petri1028_14902061403153427206.dot
Successfully produced net in file /tmp/petri1029_7910885460454458292.dot
Successfully produced net in file /tmp/petri1030_3959728790552315425.dot
Successfully produced net in file /tmp/petri1031_12446945401166990540.dot
Successfully produced net in file /tmp/petri1032_6378193306276208984.dot
Successfully produced net in file /tmp/petri1033_14069093138860410049.dot
Successfully produced net in file /tmp/petri1034_1581586282828212204.dot
Successfully produced net in file /tmp/petri1035_2287796958779915759.dot
Successfully produced net in file /tmp/petri1036_6786297790598542208.dot
Successfully produced net in file /tmp/petri1037_7290186827940192348.dot
Successfully produced net in file /tmp/petri1038_1290618337674149684.dot
Successfully produced net in file /tmp/petri1039_17425947399983191337.dot
Successfully produced net in file /tmp/petri1040_14084416016025292845.dot
Successfully produced net in file /tmp/petri1041_17070976495999714626.dot
Successfully produced net in file /tmp/petri1042_5122735336602179896.dot
Successfully produced net in file /tmp/petri1043_13418552231839281818.dot
Successfully produced net in file /tmp/petri1044_654467701810291208.dot
Drop transitions removed 45 transitions
Dominated transitions for bounds rules discarded 45 transitions
Normalized transition count is 89 out of 312 initially.
// Phase 1: matrix 89 rows 89 cols
[2024-05-24 15:15:22] [INFO ] Computed 3 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 85314 resets, run finished after 1903 ms. (steps per millisecond=525 ) properties (out of 4) seen :7
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 7452 resets, run finished after 579 ms. (steps per millisecond=1727 ) properties (out of 1) seen :4
[2024-05-24 15:15:24] [INFO ] Flow matrix only has 89 transitions (discarded 223 similar events)
// Phase 1: matrix 89 rows 89 cols
[2024-05-24 15:15:24] [INFO ] Computed 3 invariants in 2 ms
[2024-05-24 15:15:24] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 15:15:24] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-24 15:15:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 15:15:24] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
Current structural bounds on expressions (after SMT) : [4] Max seen :[4]
FORMULA LeafsetExtension-PT-S32C4-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 76873 ms.

BK_STOP 1716563725519

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="LeafsetExtension-PT-S32C4"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is LeafsetExtension-PT-S32C4, 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 r241-tall-171649628400236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S32C4.tgz
mv LeafsetExtension-PT-S32C4 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;