fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r101-tall-167814474900061
Last Updated
May 14, 2023

About the Execution of ITS-Tools for CloudReconfiguration-PT-308

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
673.472 91706.00 109301.00 389.60 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/mcc2023-input.r101-tall-167814474900061.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is CloudReconfiguration-PT-308, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814474900061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.3K Feb 25 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 11:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 11:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Feb 25 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 11:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 11:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 660K Mar 5 18:22 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-308-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-308-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678224173770

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-308
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-07 21:22:55] [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]
[2023-03-07 21:22:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 21:22:55] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2023-03-07 21:22:55] [INFO ] Transformed 2585 places.
[2023-03-07 21:22:55] [INFO ] Transformed 3095 transitions.
[2023-03-07 21:22:55] [INFO ] Found NUPN structural information;
[2023-03-07 21:22:55] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 3095 rows 2585 cols
[2023-03-07 21:22:55] [INFO ] Computed 4 place invariants in 63 ms
Incomplete random walk after 10000 steps, including 71 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :3
FORMULA CloudReconfiguration-PT-308-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
[2023-03-07 21:22:55] [INFO ] Invariant cache hit.
[2023-03-07 21:22:56] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 45 ms returned sat
[2023-03-07 21:22:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 21:22:57] [INFO ] [Real]Absence check using state equation in 1142 ms returned sat
[2023-03-07 21:22:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 21:22:58] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-07 21:22:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 21:22:59] [INFO ] [Nat]Absence check using state equation in 1213 ms returned sat
[2023-03-07 21:23:00] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 221 ms.
[2023-03-07 21:23:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-07 21:23:03] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 21:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 21:23:04] [INFO ] [Real]Absence check using state equation in 1138 ms returned sat
[2023-03-07 21:23:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 21:23:05] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-07 21:23:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 21:23:06] [INFO ] [Nat]Absence check using state equation in 1254 ms returned sat
[2023-03-07 21:23:06] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 153 ms.
[2023-03-07 21:23:09] [INFO ] Added : 125 causal constraints over 25 iterations in 3239 ms. Result :unknown
[2023-03-07 21:23:10] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 21:23:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 21:23:11] [INFO ] [Real]Absence check using state equation in 1219 ms returned sat
[2023-03-07 21:23:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 21:23:11] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-07 21:23:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 21:23:12] [INFO ] [Nat]Absence check using state equation in 1184 ms returned sat
[2023-03-07 21:23:13] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 140 ms.
[2023-03-07 21:23:16] [INFO ] Added : 130 causal constraints over 26 iterations in 3423 ms. Result :unknown
[2023-03-07 21:23:16] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 21:23:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 21:23:18] [INFO ] [Real]Absence check using state equation in 1201 ms returned sat
[2023-03-07 21:23:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 21:23:18] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 21:23:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 21:23:19] [INFO ] [Nat]Absence check using state equation in 1195 ms returned sat
[2023-03-07 21:23:19] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 126 ms.
[2023-03-07 21:23:23] [INFO ] Added : 135 causal constraints over 27 iterations in 3386 ms. Result :unknown
[2023-03-07 21:23:23] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-07 21:23:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 21:23:24] [INFO ] [Real]Absence check using state equation in 1133 ms returned sat
[2023-03-07 21:23:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 21:23:25] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 21:23:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 21:23:26] [INFO ] [Nat]Absence check using state equation in 1527 ms returned sat
[2023-03-07 21:23:26] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 139 ms.
[2023-03-07 21:23:29] [INFO ] Added : 120 causal constraints over 24 iterations in 3070 ms. Result :unknown
[2023-03-07 21:23:30] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 21:23:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 21:23:31] [INFO ] [Real]Absence check using state equation in 1125 ms returned sat
[2023-03-07 21:23:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 21:23:31] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 21:23:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 21:23:32] [INFO ] [Nat]Absence check using state equation in 1089 ms returned sat
[2023-03-07 21:23:33] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 133 ms.
[2023-03-07 21:23:36] [INFO ] Added : 140 causal constraints over 28 iterations in 3498 ms. Result :unknown
[2023-03-07 21:23:36] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 21:23:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 21:23:37] [INFO ] [Real]Absence check using state equation in 1041 ms returned sat
[2023-03-07 21:23:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 21:23:38] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 21:23:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 21:23:39] [INFO ] [Nat]Absence check using state equation in 1076 ms returned sat
[2023-03-07 21:23:39] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 127 ms.
[2023-03-07 21:23:42] [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:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-07 21:23:43] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 21:23:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 21:23:44] [INFO ] [Real]Absence check using state equation in 1154 ms returned sat
[2023-03-07 21:23:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 21:23:44] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 21:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 21:23:46] [INFO ] [Nat]Absence check using state equation in 1207 ms returned sat
[2023-03-07 21:23:46] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 151 ms.
[2023-03-07 21:23:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-07 21:23:50] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 21:23:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 21:23:51] [INFO ] [Real]Absence check using state equation in 1222 ms returned sat
[2023-03-07 21:23:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 21:23:51] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 21:23:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 21:23:52] [INFO ] [Nat]Absence check using state equation in 1192 ms returned sat
[2023-03-07 21:23:53] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 141 ms.
[2023-03-07 21:23:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-07 21:23:56] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 21:23:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 21:23:57] [INFO ] [Real]Absence check using state equation in 1153 ms returned sat
[2023-03-07 21:23:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 21:23:58] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 21:23:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 21:23:59] [INFO ] [Nat]Absence check using state equation in 1165 ms returned sat
[2023-03-07 21:23:59] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 153 ms.
[2023-03-07 21:24:03] [INFO ] Added : 130 causal constraints over 26 iterations in 3439 ms. Result :unknown
[2023-03-07 21:24:03] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 21:24:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 21:24:04] [INFO ] [Real]Absence check using state equation in 1116 ms returned sat
[2023-03-07 21:24:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 21:24:05] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 21:24:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 21:24:06] [INFO ] [Nat]Absence check using state equation in 1062 ms returned sat
[2023-03-07 21:24:06] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 152 ms.
[2023-03-07 21:24:09] [INFO ] Added : 131 causal constraints over 27 iterations in 3567 ms. Result :unknown
[2023-03-07 21:24:10] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 21:24:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 21:24:11] [INFO ] [Real]Absence check using state equation in 1226 ms returned sat
[2023-03-07 21:24:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 21:24:11] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 21:24:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 21:24:13] [INFO ] [Nat]Absence check using state equation in 1162 ms returned sat
[2023-03-07 21:24:13] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 137 ms.
[2023-03-07 21:24:16] [INFO ] Added : 130 causal constraints over 26 iterations in 3451 ms. Result :unknown
[2023-03-07 21:24:16] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 21:24:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 21:24:17] [INFO ] [Real]Absence check using state equation in 1011 ms returned sat
[2023-03-07 21:24:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 21:24:18] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 21:24:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 21:24:19] [INFO ] [Nat]Absence check using state equation in 1088 ms returned sat
[2023-03-07 21:24:19] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 130 ms.
[2023-03-07 21:24: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 12
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:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CloudReconfiguration-PT-308-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 9 out of 2585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2937 edges and 2585 vertex of which 848 / 2585 are part of one of the 63 SCC in 11 ms
Free SCC test removed 785 places
Drop transitions removed 959 transitions
Reduce isomorphic transitions removed 959 transitions.
Graph (complete) has 2416 edges and 1800 vertex of which 1786 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 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1208 rules applied. Total rules applied 1210 place count 1786 transition count 919
Reduce places removed 1199 places and 0 transitions.
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 1 with 1333 rules applied. Total rules applied 2543 place count 587 transition count 785
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 67 rules applied. Total rules applied 2610 place count 527 transition count 778
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 2615 place count 525 transition count 775
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 2619 place count 523 transition count 773
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 5 with 7 rules applied. Total rules applied 2626 place count 522 transition count 767
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2632 place count 516 transition count 767
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 2632 place count 516 transition count 745
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 2676 place count 494 transition count 745
Discarding 79 places :
Symmetric choice reduction at 7 with 79 rule applications. Total rules 2755 place count 415 transition count 666
Iterating global reduction 7 with 79 rules applied. Total rules applied 2834 place count 415 transition count 666
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 2834 place count 415 transition count 657
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 2852 place count 406 transition count 657
Discarding 60 places :
Symmetric choice reduction at 7 with 60 rule applications. Total rules 2912 place count 346 transition count 597
Iterating global reduction 7 with 60 rules applied. Total rules applied 2972 place count 346 transition count 597
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 3006 place count 346 transition count 563
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 8 with 29 rules applied. Total rules applied 3035 place count 329 transition count 551
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 3041 place count 323 transition count 551
Discarding 21 places :
Symmetric choice reduction at 10 with 21 rule applications. Total rules 3062 place count 302 transition count 518
Iterating global reduction 10 with 21 rules applied. Total rules applied 3083 place count 302 transition count 518
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 3092 place count 302 transition count 509
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 3101 place count 293 transition count 491
Iterating global reduction 11 with 9 rules applied. Total rules applied 3110 place count 293 transition count 491
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 3113 place count 290 transition count 485
Iterating global reduction 11 with 3 rules applied. Total rules applied 3116 place count 290 transition count 485
Performed 156 Post agglomeration using F-continuation condition with reduction of 82 identical transitions.
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 11 with 312 rules applied. Total rules applied 3428 place count 134 transition count 247
Drop transitions removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 3432 place count 134 transition count 243
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 3440 place count 130 transition count 239
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3446 place count 130 transition count 233
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 3452 place count 127 transition count 230
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3458 place count 127 transition count 224
Performed 35 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 14 with 70 rules applied. Total rules applied 3528 place count 92 transition count 258
Drop transitions removed 11 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 14 with 39 rules applied. Total rules applied 3567 place count 92 transition count 219
Discarding 21 places :
Symmetric choice reduction at 15 with 21 rule applications. Total rules 3588 place count 71 transition count 185
Iterating global reduction 15 with 21 rules applied. Total rules applied 3609 place count 71 transition count 185
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 15 with 12 rules applied. Total rules applied 3621 place count 71 transition count 173
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 3625 place count 67 transition count 165
Iterating global reduction 16 with 4 rules applied. Total rules applied 3629 place count 67 transition count 165
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 3633 place count 67 transition count 161
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 17 with 12 rules applied. Total rules applied 3645 place count 67 transition count 149
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 3646 place count 66 transition count 146
Iterating global reduction 17 with 1 rules applied. Total rules applied 3647 place count 66 transition count 146
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 3648 place count 65 transition count 145
Iterating global reduction 17 with 1 rules applied. Total rules applied 3649 place count 65 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 3650 place count 65 transition count 144
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 3651 place count 65 transition count 143
Free-agglomeration rule applied 4 times.
Iterating global reduction 18 with 4 rules applied. Total rules applied 3655 place count 65 transition count 139
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 7 rules applied. Total rules applied 3662 place count 61 transition count 136
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 61 transition count 135
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 3664 place count 61 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 3665 place count 60 transition count 134
Applied a total of 3665 rules in 254 ms. Remains 60 /2585 variables (removed 2525) and now considering 134/3095 (removed 2961) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 254 ms. Remains : 60/2585 places, 134/3095 transitions.
Normalized transition count is 126 out of 134 initially.
// Phase 1: matrix 126 rows 60 cols
[2023-03-07 21:24:23] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 13045 resets, run finished after 945 ms. (steps per millisecond=1058 ) properties (out of 9) seen :9
FORMULA CloudReconfiguration-PT-308-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 89292 ms.

BK_STOP 1678224265476

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-308"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-5348"
echo " Executing tool itstools"
echo " Input is CloudReconfiguration-PT-308, 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 r101-tall-167814474900061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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