About the Execution of 2023-gold for StigmergyCommit-PT-03b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
453.523 | 38033.00 | 46660.00 | 1442.70 | 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/mcc2024-input.r417-tall-171690555700071.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 StigmergyCommit-PT-03b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690555700071
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 17:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 17:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 11 17:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 359K May 18 16:43 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 StigmergyCommit-PT-03b-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717110890840
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=StigmergyCommit-PT-03b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-30 23:14:52] [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-30 23:14:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 23:14:52] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-05-30 23:14:52] [INFO ] Transformed 1231 places.
[2024-05-30 23:14:52] [INFO ] Transformed 1476 transitions.
[2024-05-30 23:14:52] [INFO ] Found NUPN structural information;
[2024-05-30 23:14:52] [INFO ] Parsed PT model containing 1231 places and 1476 transitions and 4168 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 1476 rows 1231 cols
[2024-05-30 23:14:52] [INFO ] Computed 5 invariants in 37 ms
Incomplete random walk after 10000 steps, including 131 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :11
FORMULA StigmergyCommit-PT-03b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :0
[2024-05-30 23:14:52] [INFO ] Invariant cache hit.
[2024-05-30 23:14:53] [INFO ] [Real]Absence check using 5 positive place invariants in 25 ms returned sat
[2024-05-30 23:14:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:14:54] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2024-05-30 23:14:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:14:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 20 ms returned sat
[2024-05-30 23:14:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:14:54] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2024-05-30 23:14:55] [INFO ] Deduced a trap composed of 398 places in 398 ms of which 4 ms to minimize.
[2024-05-30 23:14:55] [INFO ] Deduced a trap composed of 396 places in 332 ms of which 1 ms to minimize.
[2024-05-30 23:14:56] [INFO ] Deduced a trap composed of 397 places in 296 ms of which 1 ms to minimize.
[2024-05-30 23:14:56] [INFO ] Deduced a trap composed of 398 places in 243 ms of which 1 ms to minimize.
[2024-05-30 23:14:56] [INFO ] Deduced a trap composed of 396 places in 315 ms of which 1 ms to minimize.
[2024-05-30 23:14:57] [INFO ] Deduced a trap composed of 398 places in 328 ms of which 0 ms to minimize.
[2024-05-30 23:14:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2273 ms
[2024-05-30 23:14:57] [INFO ] Computed and/alt/rep : 1399/2268/1399 causal constraints (skipped 76 transitions) in 89 ms.
[2024-05-30 23:14:59] [INFO ] Deduced a trap composed of 20 places in 412 ms of which 1 ms to minimize.
[2024-05-30 23:14:59] [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-30 23:14:59] [INFO ] [Real]Absence check using 5 positive place invariants in 18 ms returned sat
[2024-05-30 23:14:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:15:00] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2024-05-30 23:15:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:15:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 20 ms returned sat
[2024-05-30 23:15:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:15:01] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2024-05-30 23:15:01] [INFO ] Deduced a trap composed of 398 places in 364 ms of which 1 ms to minimize.
[2024-05-30 23:15:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 456 ms
[2024-05-30 23:15:01] [INFO ] Computed and/alt/rep : 1399/2268/1399 causal constraints (skipped 76 transitions) in 78 ms.
[2024-05-30 23: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 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.refineWithCausalOrder(DeadlockTester.java:1189)
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-30 23:15:05] [INFO ] [Real]Absence check using 5 positive place invariants in 18 ms returned sat
[2024-05-30 23:15:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:15:06] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2024-05-30 23:15:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:15:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 19 ms returned sat
[2024-05-30 23:15:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:15:06] [INFO ] [Nat]Absence check using state equation in 437 ms returned sat
[2024-05-30 23:15:07] [INFO ] Deduced a trap composed of 399 places in 378 ms of which 1 ms to minimize.
[2024-05-30 23:15:07] [INFO ] Deduced a trap composed of 490 places in 299 ms of which 1 ms to minimize.
[2024-05-30 23:15:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 858 ms
[2024-05-30 23:15:07] [INFO ] Computed and/alt/rep : 1399/2268/1399 causal constraints (skipped 76 transitions) in 75 ms.
[2024-05-30 23:15:11] [INFO ] Deduced a trap composed of 20 places in 382 ms of which 1 ms to minimize.
[2024-05-30 23:15:11] [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: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-30 23:15:11] [INFO ] [Real]Absence check using 5 positive place invariants in 16 ms returned sat
[2024-05-30 23:15:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:15:12] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2024-05-30 23:15:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:15:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 18 ms returned sat
[2024-05-30 23:15:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:15:12] [INFO ] [Nat]Absence check using state equation in 403 ms returned sat
[2024-05-30 23:15:13] [INFO ] Deduced a trap composed of 398 places in 378 ms of which 1 ms to minimize.
[2024-05-30 23:15:13] [INFO ] Deduced a trap composed of 402 places in 378 ms of which 1 ms to minimize.
[2024-05-30 23:15:14] [INFO ] Deduced a trap composed of 398 places in 300 ms of which 1 ms to minimize.
[2024-05-30 23:15:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1285 ms
[2024-05-30 23:15:14] [INFO ] Computed and/alt/rep : 1399/2268/1399 causal constraints (skipped 76 transitions) in 77 ms.
[2024-05-30 23:15:17] [INFO ] Deduced a trap composed of 20 places in 396 ms of which 1 ms to minimize.
[2024-05-30 23:15:17] [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-30 23:15:17] [INFO ] [Real]Absence check using 5 positive place invariants in 17 ms returned sat
[2024-05-30 23:15:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:15:18] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2024-05-30 23:15:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:15:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 19 ms returned sat
[2024-05-30 23:15:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:15:18] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2024-05-30 23:15:19] [INFO ] Deduced a trap composed of 489 places in 351 ms of which 1 ms to minimize.
[2024-05-30 23:15:19] [INFO ] Deduced a trap composed of 489 places in 281 ms of which 1 ms to minimize.
[2024-05-30 23:15:20] [INFO ] Deduced a trap composed of 396 places in 300 ms of which 1 ms to minimize.
[2024-05-30 23:15:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1142 ms
[2024-05-30 23:15:20] [INFO ] Computed and/alt/rep : 1399/2268/1399 causal constraints (skipped 76 transitions) in 74 ms.
[2024-05-30 23:15:23] [INFO ] Deduced a trap composed of 20 places in 378 ms of which 1 ms to minimize.
[2024-05-30 23:15:23] [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 :[0, 0, 0, 0, 0]
Support contains 5 out of 1231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1231/1231 places, 1476/1476 transitions.
Graph (trivial) has 1212 edges and 1231 vertex of which 75 / 1231 are part of one of the 11 SCC in 10 ms
Free SCC test removed 64 places
Drop transitions removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Graph (complete) has 1655 edges and 1167 vertex of which 1159 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 921 transitions
Trivial Post-agglo rules discarded 921 transitions
Performed 921 trivial Post agglomeration. Transition count delta: 921
Iterating post reduction 0 with 925 rules applied. Total rules applied 927 place count 1159 transition count 465
Reduce places removed 921 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 950 rules applied. Total rules applied 1877 place count 238 transition count 436
Reduce places removed 11 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 14 rules applied. Total rules applied 1891 place count 227 transition count 433
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1894 place count 224 transition count 433
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 42 Pre rules applied. Total rules applied 1894 place count 224 transition count 391
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 1978 place count 182 transition count 391
Discarding 49 places :
Symmetric choice reduction at 4 with 49 rule applications. Total rules 2027 place count 133 transition count 342
Iterating global reduction 4 with 49 rules applied. Total rules applied 2076 place count 133 transition count 342
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2076 place count 133 transition count 341
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2078 place count 132 transition count 341
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 2105 place count 105 transition count 185
Iterating global reduction 4 with 27 rules applied. Total rules applied 2132 place count 105 transition count 185
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 2145 place count 105 transition count 172
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 2153 place count 97 transition count 164
Iterating global reduction 5 with 8 rules applied. Total rules applied 2161 place count 97 transition count 164
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 2168 place count 90 transition count 157
Iterating global reduction 5 with 7 rules applied. Total rules applied 2175 place count 90 transition count 157
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 2181 place count 90 transition count 151
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 2209 place count 76 transition count 137
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2210 place count 76 transition count 136
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2214 place count 72 transition count 132
Iterating global reduction 7 with 4 rules applied. Total rules applied 2218 place count 72 transition count 132
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2222 place count 68 transition count 128
Iterating global reduction 7 with 4 rules applied. Total rules applied 2226 place count 68 transition count 128
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2230 place count 64 transition count 124
Iterating global reduction 7 with 4 rules applied. Total rules applied 2234 place count 64 transition count 124
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 2244 place count 59 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2245 place count 59 transition count 151
Free-agglomeration rule applied 23 times with reduction of 6 identical transitions.
Iterating global reduction 8 with 23 rules applied. Total rules applied 2268 place count 59 transition count 122
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 30 rules applied. Total rules applied 2298 place count 36 transition count 115
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 2302 place count 32 transition count 111
Iterating global reduction 9 with 4 rules applied. Total rules applied 2306 place count 32 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2307 place count 32 transition count 110
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 10 with 28 rules applied. Total rules applied 2335 place count 32 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2337 place count 31 transition count 85
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 2340 place count 31 transition count 85
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 2342 place count 31 transition count 83
Applied a total of 2342 rules in 132 ms. Remains 31 /1231 variables (removed 1200) and now considering 83/1476 (removed 1393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 31/1231 places, 83/1476 transitions.
// Phase 1: matrix 83 rows 31 cols
[2024-05-30 23:15:23] [INFO ] Computed 5 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1233 ms. (steps per millisecond=811 ) properties (out of 5) seen :4
FORMULA StigmergyCommit-PT-03b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=3436 ) properties (out of 1) seen :0
[2024-05-30 23:15:25] [INFO ] Invariant cache hit.
[2024-05-30 23:15:25] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-30 23:15:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 23:15:25] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-30 23:15:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 23:15:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-30 23:15:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 23:15:25] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-30 23:15:25] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-30 23:15:25] [INFO ] [Nat]Added 41 Read/Feed constraints in 3 ms returned sat
[2024-05-30 23:15:25] [INFO ] Computed and/alt/rep : 12/37/12 causal constraints (skipped 47 transitions) in 4 ms.
[2024-05-30 23:15:25] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
FORMULA StigmergyCommit-PT-03b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 33301 ms.
BK_STOP 1717110928873
--------------------
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="StigmergyCommit-PT-03b"
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 StigmergyCommit-PT-03b, 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 r417-tall-171690555700071"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-03b.tgz
mv StigmergyCommit-PT-03b 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 '
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 ;