fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r109-tall-171624207900121
Last Updated
July 7, 2024

About the Execution of 2023-gold for CloudReconfiguration-PT-311

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
675.936 92288.00 108848.00 425.10 1 1 1 1 0 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.r109-tall-171624207900121.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 CloudReconfiguration-PT-311, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624207900121
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.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 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 19:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 11 19:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 19:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 11 19:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 660K 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 CloudReconfiguration-PT-311-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716306750974

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=CloudReconfiguration-PT-311
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-21 15:52:32] [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-21 15:52:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:52:32] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2024-05-21 15:52:32] [INFO ] Transformed 2585 places.
[2024-05-21 15:52:32] [INFO ] Transformed 3095 transitions.
[2024-05-21 15:52:32] [INFO ] Found NUPN structural information;
[2024-05-21 15:52:32] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 3095 rows 2585 cols
[2024-05-21 15:52:32] [INFO ] Computed 4 invariants in 59 ms
Incomplete random walk after 10000 steps, including 100 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :1
FORMULA CloudReconfiguration-PT-311-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 35 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :1
FORMULA CloudReconfiguration-PT-311-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :1
FORMULA CloudReconfiguration-PT-311-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-21 15:52:33] [INFO ] Invariant cache hit.
[2024-05-21 15:52:33] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 50 ms returned sat
[2024-05-21 15:52:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:52:34] [INFO ] [Real]Absence check using state equation in 1147 ms returned sat
[2024-05-21 15:52:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:52:35] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2024-05-21 15:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:52:36] [INFO ] [Nat]Absence check using state equation in 1087 ms returned sat
[2024-05-21 15:52:36] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 179 ms.
[2024-05-21 15:52:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... 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: Broken pipe ...
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-21 15:52:40] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2024-05-21 15:52:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:52:41] [INFO ] [Real]Absence check using state equation in 1248 ms returned sat
[2024-05-21 15:52:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:52:42] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2024-05-21 15:52:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:52:43] [INFO ] [Nat]Absence check using state equation in 1241 ms returned sat
[2024-05-21 15:52:43] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 127 ms.
[2024-05-21 15:52:46] [INFO ] Added : 130 causal constraints over 26 iterations in 3355 ms. Result :unknown
[2024-05-21 15:52:47] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2024-05-21 15:52:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:52:48] [INFO ] [Real]Absence check using state equation in 1264 ms returned sat
[2024-05-21 15:52:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:52:48] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2024-05-21 15:52:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:52:50] [INFO ] [Nat]Absence check using state equation in 1263 ms returned sat
[2024-05-21 15:52:50] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 148 ms.
[2024-05-21 15:52:53] [INFO ] Added : 130 causal constraints over 26 iterations in 3323 ms. Result :unknown
[2024-05-21 15:52:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2024-05-21 15:52:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:52:55] [INFO ] [Real]Absence check using state equation in 1134 ms returned sat
[2024-05-21 15:52:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:52:55] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2024-05-21 15:52:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:52:56] [INFO ] [Nat]Absence check using state equation in 1092 ms returned sat
[2024-05-21 15:52:56] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 140 ms.
[2024-05-21 15:53:00] [INFO ] Added : 130 causal constraints over 26 iterations in 3502 ms. Result :unknown
[2024-05-21 15:53:00] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2024-05-21 15:53:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:53:01] [INFO ] [Real]Absence check using state equation in 1234 ms returned sat
[2024-05-21 15:53:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:53:02] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2024-05-21 15:53:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:53:03] [INFO ] [Nat]Absence check using state equation in 1267 ms returned sat
[2024-05-21 15:53:03] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 155 ms.
[2024-05-21 15:53:07] [INFO ] Added : 130 causal constraints over 26 iterations in 3304 ms. Result :unknown
[2024-05-21 15:53:07] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2024-05-21 15:53:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:53:08] [INFO ] [Real]Absence check using state equation in 1276 ms returned sat
[2024-05-21 15:53:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:53:09] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2024-05-21 15:53:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:53:10] [INFO ] [Nat]Absence check using state equation in 1214 ms returned sat
[2024-05-21 15:53:10] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 136 ms.
[2024-05-21 15:53:13] [INFO ] Added : 130 causal constraints over 26 iterations in 3368 ms. Result :unknown
[2024-05-21 15:53:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2024-05-21 15:53:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:53:15] [INFO ] [Real]Absence check using state equation in 1185 ms returned sat
[2024-05-21 15:53:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:53:15] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2024-05-21 15:53:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:53:17] [INFO ] [Nat]Absence check using state equation in 1184 ms returned sat
[2024-05-21 15:53:17] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 131 ms.
[2024-05-21 15:53:20] [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: Broken pipe ... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
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-21 15:53:20] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2024-05-21 15:53:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:53:22] [INFO ] [Real]Absence check using state equation in 1220 ms returned sat
[2024-05-21 15:53:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:53:22] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2024-05-21 15:53:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:53:23] [INFO ] [Nat]Absence check using state equation in 1282 ms returned sat
[2024-05-21 15:53:24] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 157 ms.
[2024-05-21 15:53:27] [INFO ] Added : 130 causal constraints over 26 iterations in 3289 ms. Result :unknown
[2024-05-21 15:53:27] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2024-05-21 15:53:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:53:28] [INFO ] [Real]Absence check using state equation in 1222 ms returned sat
[2024-05-21 15:53:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:53:29] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2024-05-21 15:53:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:53:30] [INFO ] [Nat]Absence check using state equation in 1451 ms returned sat
[2024-05-21 15:53:31] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 128 ms.
[2024-05-21 15:53:34] [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: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-21 15:53:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2024-05-21 15:53:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:53:35] [INFO ] [Real]Absence check using state equation in 1238 ms returned sat
[2024-05-21 15:53:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:53:36] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2024-05-21 15:53:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:53:37] [INFO ] [Nat]Absence check using state equation in 1444 ms returned sat
[2024-05-21 15:53:37] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 123 ms.
[2024-05-21 15:53:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... 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: Broken pipe ...
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-21 15:53:41] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2024-05-21 15:53:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:53:42] [INFO ] [Real]Absence check using state equation in 1064 ms returned sat
[2024-05-21 15:53:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:53:42] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2024-05-21 15:53:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:53:43] [INFO ] [Nat]Absence check using state equation in 1071 ms returned sat
[2024-05-21 15:53:44] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 138 ms.
[2024-05-21 15:53:47] [INFO ] Added : 135 causal constraints over 27 iterations in 3547 ms. Result :unknown
[2024-05-21 15:53:47] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2024-05-21 15:53:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:53:48] [INFO ] [Real]Absence check using state equation in 1063 ms returned sat
[2024-05-21 15:53:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:53:49] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2024-05-21 15:53:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:53:50] [INFO ] [Nat]Absence check using state equation in 1077 ms returned sat
[2024-05-21 15:53:50] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 130 ms.
[2024-05-21 15:53:54] [INFO ] Added : 140 causal constraints over 28 iterations in 3543 ms. Result :unknown
[2024-05-21 15:53:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2024-05-21 15:53:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:53:55] [INFO ] [Real]Absence check using state equation in 1193 ms returned sat
[2024-05-21 15:53:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:53:56] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2024-05-21 15:53:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:53:57] [INFO ] [Nat]Absence check using state equation in 1195 ms returned sat
[2024-05-21 15:53:57] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 124 ms.
[2024-05-21 15:54:00] [INFO ] Added : 135 causal constraints over 27 iterations in 3412 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 13 out of 2585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2928 edges and 2585 vertex of which 844 / 2585 are part of one of the 62 SCC in 13 ms
Free SCC test removed 782 places
Drop transitions removed 954 transitions
Reduce isomorphic transitions removed 954 transitions.
Graph (complete) has 2421 edges and 1803 vertex of which 1789 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.4 ms
Discarding 14 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 1191 transitions
Trivial Post-agglo rules discarded 1191 transitions
Performed 1191 trivial Post agglomeration. Transition count delta: 1191
Iterating post reduction 0 with 1200 rules applied. Total rules applied 1202 place count 1789 transition count 932
Reduce places removed 1191 places and 0 transitions.
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 1 with 1330 rules applied. Total rules applied 2532 place count 598 transition count 793
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 74 rules applied. Total rules applied 2606 place count 535 transition count 782
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 12 rules applied. Total rules applied 2618 place count 531 transition count 774
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 with 11 rules applied. Total rules applied 2629 place count 526 transition count 768
Reduce places removed 3 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 5 with 15 rules applied. Total rules applied 2644 place count 523 transition count 756
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 2656 place count 511 transition count 756
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 23 Pre rules applied. Total rules applied 2656 place count 511 transition count 733
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 7 with 46 rules applied. Total rules applied 2702 place count 488 transition count 733
Discarding 78 places :
Symmetric choice reduction at 7 with 78 rule applications. Total rules 2780 place count 410 transition count 655
Iterating global reduction 7 with 78 rules applied. Total rules applied 2858 place count 410 transition count 655
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 2858 place count 410 transition count 646
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 2876 place count 401 transition count 646
Discarding 60 places :
Symmetric choice reduction at 7 with 60 rule applications. Total rules 2936 place count 341 transition count 586
Iterating global reduction 7 with 60 rules applied. Total rules applied 2996 place count 341 transition count 586
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 7 with 34 rules applied. Total rules applied 3030 place count 341 transition count 552
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 27 rules applied. Total rules applied 3057 place count 324 transition count 542
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 3062 place count 319 transition count 542
Discarding 20 places :
Symmetric choice reduction at 10 with 20 rule applications. Total rules 3082 place count 299 transition count 511
Iterating global reduction 10 with 20 rules applied. Total rules applied 3102 place count 299 transition count 511
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 3111 place count 299 transition count 502
Discarding 8 places :
Symmetric choice reduction at 11 with 8 rule applications. Total rules 3119 place count 291 transition count 486
Iterating global reduction 11 with 8 rules applied. Total rules applied 3127 place count 291 transition count 486
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 3130 place count 288 transition count 480
Iterating global reduction 11 with 3 rules applied. Total rules applied 3133 place count 288 transition count 480
Performed 149 Post agglomeration using F-continuation condition with reduction of 80 identical transitions.
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 11 with 298 rules applied. Total rules applied 3431 place count 139 transition count 251
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 3433 place count 139 transition count 249
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 3439 place count 136 transition count 246
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3445 place count 136 transition count 240
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 3451 place count 133 transition count 237
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3457 place count 133 transition count 231
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 14 with 66 rules applied. Total rules applied 3523 place count 100 transition count 266
Drop transitions removed 11 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 14 with 35 rules applied. Total rules applied 3558 place count 100 transition count 231
Discarding 20 places :
Symmetric choice reduction at 15 with 20 rule applications. Total rules 3578 place count 80 transition count 198
Iterating global reduction 15 with 20 rules applied. Total rules applied 3598 place count 80 transition count 198
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 3608 place count 80 transition count 188
Discarding 3 places :
Symmetric choice reduction at 16 with 3 rule applications. Total rules 3611 place count 77 transition count 182
Iterating global reduction 16 with 3 rules applied. Total rules applied 3614 place count 77 transition count 182
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 3616 place count 77 transition count 180
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 17 with 19 rules applied. Total rules applied 3635 place count 77 transition count 161
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 3636 place count 76 transition count 158
Iterating global reduction 17 with 1 rules applied. Total rules applied 3637 place count 76 transition count 158
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 3638 place count 75 transition count 157
Iterating global reduction 17 with 1 rules applied. Total rules applied 3639 place count 75 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 3640 place count 75 transition count 156
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 3642 place count 74 transition count 155
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 3643 place count 74 transition count 154
Free-agglomeration rule applied 6 times.
Iterating global reduction 18 with 6 rules applied. Total rules applied 3649 place count 74 transition count 148
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 7 rules applied. Total rules applied 3656 place count 68 transition count 147
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 3658 place count 68 transition count 145
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 19 with 4 rules applied. Total rules applied 3662 place count 68 transition count 145
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 3663 place count 68 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 3664 place count 67 transition count 143
Applied a total of 3664 rules in 270 ms. Remains 67 /2585 variables (removed 2518) and now considering 143/3095 (removed 2952) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 67/2585 places, 143/3095 transitions.
Normalized transition count is 136 out of 143 initially.
// Phase 1: matrix 136 rows 67 cols
[2024-05-21 15:54:01] [INFO ] Computed 4 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 19630 resets, run finished after 959 ms. (steps per millisecond=1042 ) properties (out of 13) seen :12
FORMULA CloudReconfiguration-PT-311-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 5782 resets, run finished after 299 ms. (steps per millisecond=3344 ) properties (out of 1) seen :0
[2024-05-21 15:54:02] [INFO ] Flow matrix only has 136 transitions (discarded 7 similar events)
// Phase 1: matrix 136 rows 67 cols
[2024-05-21 15:54:02] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 15:54:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 15:54:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 15:54:02] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-21 15:54:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:54:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 15:54:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 15:54:02] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-21 15:54:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:54:02] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-21 15:54:02] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 6 ms to minimize.
[2024-05-21 15:54:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
Current structural bounds on expressions (after SMT) : [0] Max seen :[0]
FORMULA CloudReconfiguration-PT-311-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 90083 ms.

BK_STOP 1716306843262

--------------------
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="CloudReconfiguration-PT-311"
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 CloudReconfiguration-PT-311, 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 r109-tall-171624207900121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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