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.r107-tall-167814483700061.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 smartxred
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 r107-tall-167814483700061
=====================================================================

--------------------
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 1678321501140

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-308
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 00:25:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 00:25:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 00:25:02] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2023-03-09 00:25:02] [INFO ] Transformed 2585 places.
[2023-03-09 00:25:02] [INFO ] Transformed 3095 transitions.
[2023-03-09 00:25:02] [INFO ] Found NUPN structural information;
[2023-03-09 00:25:02] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 389 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 3095 rows 2585 cols
[2023-03-09 00:25:03] [INFO ] Computed 4 place invariants in 54 ms
Incomplete random walk after 10000 steps, including 75 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :2
FORMULA CloudReconfiguration-PT-308-UpperBounds-12 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 20 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :1
FORMULA CloudReconfiguration-PT-308-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 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 10000 steps, including 19 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 19 resets, run finished after 9 ms. (steps per millisecond=1111 ) 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 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 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 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 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 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 7 ms. (steps per millisecond=1428 ) 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
[2023-03-09 00:25:03] [INFO ] Invariant cache hit.
[2023-03-09 00:25:03] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 48 ms returned sat
[2023-03-09 00:25:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:25:05] [INFO ] [Real]Absence check using state equation in 1146 ms returned sat
[2023-03-09 00:25:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:25:05] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 00:25:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:25:06] [INFO ] [Nat]Absence check using state equation in 1199 ms returned sat
[2023-03-09 00:25:07] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 164 ms.
[2023-03-09 00:25:10] [INFO ] Added : 130 causal constraints over 26 iterations in 3366 ms. Result :unknown
[2023-03-09 00:25:10] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 00:25:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:25:11] [INFO ] [Real]Absence check using state equation in 1210 ms returned sat
[2023-03-09 00:25:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:25:12] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 00:25:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:25:13] [INFO ] [Nat]Absence check using state equation in 1177 ms returned sat
[2023-03-09 00:25:13] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 161 ms.
[2023-03-09 00:25:17] [INFO ] Added : 130 causal constraints over 26 iterations in 3325 ms. Result :unknown
[2023-03-09 00:25:17] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 36 ms returned sat
[2023-03-09 00:25:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:25:18] [INFO ] [Real]Absence check using state equation in 1194 ms returned sat
[2023-03-09 00:25:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:25:19] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-09 00:25:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:25:20] [INFO ] [Nat]Absence check using state equation in 1177 ms returned sat
[2023-03-09 00:25:20] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 129 ms.
[2023-03-09 00:25:23] [INFO ] Added : 130 causal constraints over 26 iterations in 3370 ms. Result :unknown
[2023-03-09 00:25:24] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 00:25:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:25:25] [INFO ] [Real]Absence check using state equation in 1232 ms returned sat
[2023-03-09 00:25:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:25:25] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-09 00:25:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:25:27] [INFO ] [Nat]Absence check using state equation in 1209 ms returned sat
[2023-03-09 00:25:27] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 144 ms.
[2023-03-09 00:25:30] [INFO ] Added : 130 causal constraints over 26 iterations in 3360 ms. Result :unknown
[2023-03-09 00:25:30] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 00:25:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:25:32] [INFO ] [Real]Absence check using state equation in 1137 ms returned sat
[2023-03-09 00:25:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:25:32] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 00:25:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:25:34] [INFO ] [Nat]Absence check using state equation in 1548 ms returned sat
[2023-03-09 00:25:34] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 139 ms.
[2023-03-09 00:25:37] [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 4
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-09 00:25:37] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-09 00:25:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:25:38] [INFO ] [Real]Absence check using state equation in 1134 ms returned sat
[2023-03-09 00:25:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:25:39] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 00:25:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:25:40] [INFO ] [Nat]Absence check using state equation in 1108 ms returned sat
[2023-03-09 00:25:40] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 140 ms.
[2023-03-09 00:25:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-09 00:25:44] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-09 00:25:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:25:45] [INFO ] [Real]Absence check using state equation in 1132 ms returned sat
[2023-03-09 00:25:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:25:45] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 00:25:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:25:47] [INFO ] [Nat]Absence check using state equation in 1134 ms returned sat
[2023-03-09 00:25:47] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 133 ms.
[2023-03-09 00:25:50] [INFO ] Added : 124 causal constraints over 25 iterations in 3428 ms. Result :unknown
[2023-03-09 00:25:51] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 00:25:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:25:52] [INFO ] [Real]Absence check using state equation in 1179 ms returned sat
[2023-03-09 00:25:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:25:52] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-09 00:25:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:25:53] [INFO ] [Nat]Absence check using state equation in 1208 ms returned sat
[2023-03-09 00:25:54] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 134 ms.
[2023-03-09 00:25:57] [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-09 00:25:57] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 00:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:25:58] [INFO ] [Real]Absence check using state equation in 1204 ms returned sat
[2023-03-09 00:25:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:25:59] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 00:25:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:26:00] [INFO ] [Nat]Absence check using state equation in 1222 ms returned sat
[2023-03-09 00:26:00] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 133 ms.
[2023-03-09 00:26:04] [INFO ] Added : 135 causal constraints over 27 iterations in 3351 ms. Result :unknown
[2023-03-09 00:26:04] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 00:26:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:26:05] [INFO ] [Real]Absence check using state equation in 1198 ms returned sat
[2023-03-09 00:26:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:26:06] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-09 00:26:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:26:07] [INFO ] [Nat]Absence check using state equation in 1192 ms returned sat
[2023-03-09 00:26:07] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 125 ms.
[2023-03-09 00:26:10] [INFO ] Added : 135 causal constraints over 27 iterations in 3406 ms. Result :unknown
[2023-03-09 00:26:11] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 00:26:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:26:12] [INFO ] [Real]Absence check using state equation in 1119 ms returned sat
[2023-03-09 00:26:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:26:12] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-09 00:26:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:26:13] [INFO ] [Nat]Absence check using state equation in 1116 ms returned sat
[2023-03-09 00:26:14] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 143 ms.
[2023-03-09 00:26:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
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-09 00:26:17] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-09 00:26:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:26:19] [INFO ] [Real]Absence check using state equation in 1230 ms returned sat
[2023-03-09 00:26:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:26:19] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-09 00:26:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:26:20] [INFO ] [Nat]Absence check using state equation in 1198 ms returned sat
[2023-03-09 00:26:20] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 146 ms.
[2023-03-09 00:26:24] [INFO ] Added : 125 causal constraints over 25 iterations in 3366 ms. Result :unknown
[2023-03-09 00:26:24] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 00:26:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 00:26:25] [INFO ] [Real]Absence check using state equation in 1052 ms returned sat
[2023-03-09 00:26:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 00:26:26] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-09 00:26:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 00:26:27] [INFO ] [Nat]Absence check using state equation in 1052 ms returned sat
[2023-03-09 00:26:27] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 124 ms.
[2023-03-09 00:26:30] [INFO ] Added : 145 causal constraints over 29 iterations in 3553 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]
FORMULA CloudReconfiguration-PT-308-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 12 out of 2585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2931 edges and 2585 vertex of which 835 / 2585 are part of one of the 62 SCC in 13 ms
Free SCC test removed 773 places
Drop transitions removed 945 transitions
Reduce isomorphic transitions removed 945 transitions.
Graph (complete) has 2430 edges and 1812 vertex of which 1798 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.5 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 1202 transitions
Trivial Post-agglo rules discarded 1202 transitions
Performed 1202 trivial Post agglomeration. Transition count delta: 1202
Iterating post reduction 0 with 1211 rules applied. Total rules applied 1213 place count 1798 transition count 930
Reduce places removed 1202 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 1336 rules applied. Total rules applied 2549 place count 596 transition count 796
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 2616 place count 536 transition count 789
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 2621 place count 534 transition count 786
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 2625 place count 532 transition count 784
Reduce places removed 1 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 5 with 9 rules applied. Total rules applied 2634 place count 531 transition count 776
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2642 place count 523 transition count 776
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 21 Pre rules applied. Total rules applied 2642 place count 523 transition count 755
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 2684 place count 502 transition count 755
Discarding 79 places :
Symmetric choice reduction at 7 with 79 rule applications. Total rules 2763 place count 423 transition count 676
Iterating global reduction 7 with 79 rules applied. Total rules applied 2842 place count 423 transition count 676
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 2842 place count 423 transition count 667
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 2860 place count 414 transition count 667
Discarding 60 places :
Symmetric choice reduction at 7 with 60 rule applications. Total rules 2920 place count 354 transition count 607
Iterating global reduction 7 with 60 rules applied. Total rules applied 2980 place count 354 transition count 607
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 3014 place count 354 transition count 573
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 3041 place count 337 transition count 563
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 3046 place count 332 transition count 563
Discarding 21 places :
Symmetric choice reduction at 10 with 21 rule applications. Total rules 3067 place count 311 transition count 530
Iterating global reduction 10 with 21 rules applied. Total rules applied 3088 place count 311 transition count 530
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 3097 place count 311 transition count 521
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 3106 place count 302 transition count 503
Iterating global reduction 11 with 9 rules applied. Total rules applied 3115 place count 302 transition count 503
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 3118 place count 299 transition count 497
Iterating global reduction 11 with 3 rules applied. Total rules applied 3121 place count 299 transition count 497
Performed 158 Post agglomeration using F-continuation condition with reduction of 82 identical transitions.
Deduced a syphon composed of 158 places in 0 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 11 with 316 rules applied. Total rules applied 3437 place count 141 transition count 257
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 3441 place count 141 transition count 253
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 3449 place count 137 transition count 249
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3455 place count 137 transition count 243
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 3461 place count 134 transition count 240
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3467 place count 134 transition count 234
Performed 36 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 14 with 72 rules applied. Total rules applied 3539 place count 98 transition count 269
Drop transitions removed 10 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 14 with 38 rules applied. Total rules applied 3577 place count 98 transition count 231
Discarding 20 places :
Symmetric choice reduction at 15 with 20 rule applications. Total rules 3597 place count 78 transition count 198
Iterating global reduction 15 with 20 rules applied. Total rules applied 3617 place count 78 transition count 198
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 15 with 11 rules applied. Total rules applied 3628 place count 78 transition count 187
Discarding 3 places :
Symmetric choice reduction at 16 with 3 rule applications. Total rules 3631 place count 75 transition count 181
Iterating global reduction 16 with 3 rules applied. Total rules applied 3634 place count 75 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 3637 place count 75 transition count 178
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 17 with 13 rules applied. Total rules applied 3650 place count 75 transition count 165
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 3651 place count 74 transition count 162
Iterating global reduction 17 with 1 rules applied. Total rules applied 3652 place count 74 transition count 162
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 3653 place count 73 transition count 161
Iterating global reduction 17 with 1 rules applied. Total rules applied 3654 place count 73 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 3655 place count 73 transition count 160
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 3656 place count 73 transition count 159
Free-agglomeration rule applied 5 times.
Iterating global reduction 18 with 5 rules applied. Total rules applied 3661 place count 73 transition count 154
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 8 rules applied. Total rules applied 3669 place count 68 transition count 151
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 3671 place count 68 transition count 149
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 3672 place count 68 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 3673 place count 67 transition count 148
Applied a total of 3673 rules in 280 ms. Remains 67 /2585 variables (removed 2518) and now considering 148/3095 (removed 2947) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 67/2585 places, 148/3095 transitions.
Normalized transition count is 140 out of 148 initially.
// Phase 1: matrix 140 rows 67 cols
[2023-03-09 00:26:31] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 12450 resets, run finished after 1090 ms. (steps per millisecond=917 ) properties (out of 12) seen :12
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
FORMULA CloudReconfiguration-PT-308-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-308-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 89670 ms.
ITS solved all properties within timeout

BK_STOP 1678321593352

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="smartxred"
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 smartxred"
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 r107-tall-167814483700061"
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 ;