fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r042-smll-165252095400221
Last Updated
Jun 22, 2022

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
552.443 97917.00 124495.00 378.70 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r042-smll-165252095400221.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CloudReconfiguration-PT-302, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-165252095400221
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 9.0K Apr 29 14:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 29 14:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 29 14:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 29 14:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 660K May 10 09:33 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-302-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-302-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652641227798

Running Version 202205111006
[2022-05-15 19:00:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 19:00:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 19:00:31] [INFO ] Load time of PNML (sax parser for PT used): 609 ms
[2022-05-15 19:00:31] [INFO ] Transformed 2585 places.
[2022-05-15 19:00:31] [INFO ] Transformed 3095 transitions.
[2022-05-15 19:00:31] [INFO ] Found NUPN structural information;
[2022-05-15 19:00:31] [INFO ] Parsed PT model containing 2585 places and 3095 transitions in 888 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
// Phase 1: matrix 3095 rows 2585 cols
[2022-05-15 19:00:31] [INFO ] Computed 4 place invariants in 122 ms
Incomplete random walk after 10000 steps, including 71 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 16) seen :4
FORMULA CloudReconfiguration-PT-302-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :1
FORMULA CloudReconfiguration-PT-302-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
// Phase 1: matrix 3095 rows 2585 cols
[2022-05-15 19:00:32] [INFO ] Computed 4 place invariants in 45 ms
[2022-05-15 19:00:33] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 146 ms returned sat
[2022-05-15 19:00:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:00:36] [INFO ] [Real]Absence check using state equation in 2220 ms returned sat
[2022-05-15 19:00:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:00:37] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2022-05-15 19:00:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:00:39] [INFO ] [Nat]Absence check using state equation in 2109 ms returned sat
[2022-05-15 19:00:40] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 340 ms.
[2022-05-15 19:00:41] [INFO ] Added : 15 causal constraints over 3 iterations in 1746 ms. Result :unknown
[2022-05-15 19:00:42] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 95 ms returned sat
[2022-05-15 19:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:00:44] [INFO ] [Real]Absence check using state equation in 2044 ms returned sat
[2022-05-15 19:00:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:00:45] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 72 ms returned sat
[2022-05-15 19:00:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:00:47] [INFO ] [Nat]Absence check using state equation in 2042 ms returned sat
[2022-05-15 19:00:48] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 377 ms.
[2022-05-15 19:00: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 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 19:00:50] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 65 ms returned sat
[2022-05-15 19:00:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:00:52] [INFO ] [Real]Absence check using state equation in 1715 ms returned sat
[2022-05-15 19:00:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:00:53] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 112 ms returned sat
[2022-05-15 19:00:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:00:55] [INFO ] [Nat]Absence check using state equation in 2399 ms returned sat
[2022-05-15 19:00:56] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 293 ms.
[2022-05-15 19:00: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: Broken pipe ... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 19:00:58] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-15 19:00:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:01:00] [INFO ] [Real]Absence check using state equation in 2193 ms returned sat
[2022-05-15 19:01:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:01:01] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-15 19:01:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:01:03] [INFO ] [Nat]Absence check using state equation in 2126 ms returned sat
[2022-05-15 19:01:04] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 529 ms.
[2022-05-15 19:01:05] [INFO ] Added : 25 causal constraints over 5 iterations in 2028 ms. Result :unknown
[2022-05-15 19:01:06] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 70 ms returned sat
[2022-05-15 19:01:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:01:09] [INFO ] [Real]Absence check using state equation in 2149 ms returned sat
[2022-05-15 19:01:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:01:10] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 106 ms returned sat
[2022-05-15 19:01:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:01:12] [INFO ] [Nat]Absence check using state equation in 2252 ms returned sat
[2022-05-15 19:01:12] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 292 ms.
[2022-05-15 19:01:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 19:01:15] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 19:01:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:01:16] [INFO ] [Real]Absence check using state equation in 1770 ms returned sat
[2022-05-15 19:01:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:01:17] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 112 ms returned sat
[2022-05-15 19:01:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:01:20] [INFO ] [Nat]Absence check using state equation in 3065 ms returned sat
[2022-05-15 19:01:21] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 188 ms.
[2022-05-15 19:01:22] [INFO ] Added : 15 causal constraints over 3 iterations in 1011 ms. Result :unknown
[2022-05-15 19:01:23] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 99 ms returned sat
[2022-05-15 19:01:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:01:25] [INFO ] [Real]Absence check using state equation in 2283 ms returned sat
[2022-05-15 19:01:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:01:26] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 19:01:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:01:27] [INFO ] [Nat]Absence check using state equation in 1644 ms returned sat
[2022-05-15 19:01:28] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 193 ms.
[2022-05-15 19:01:30] [INFO ] Added : 40 causal constraints over 8 iterations in 2676 ms. Result :unknown
[2022-05-15 19:01:31] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 63 ms returned sat
[2022-05-15 19:01:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:01:33] [INFO ] [Real]Absence check using state equation in 1882 ms returned sat
[2022-05-15 19:01:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:01:34] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 81 ms returned sat
[2022-05-15 19:01:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:01:36] [INFO ] [Nat]Absence check using state equation in 1853 ms returned sat
[2022-05-15 19:01:36] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 191 ms.
[2022-05-15 19:01:38] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 19:01:39] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 72 ms returned sat
[2022-05-15 19:01:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:01:41] [INFO ] [Real]Absence check using state equation in 2109 ms returned sat
[2022-05-15 19:01:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:01:42] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-15 19:01:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:01:44] [INFO ] [Nat]Absence check using state equation in 1940 ms returned sat
[2022-05-15 19:01:44] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 187 ms.
[2022-05-15 19:01:46] [INFO ] Added : 35 causal constraints over 7 iterations in 2447 ms. Result :unknown
[2022-05-15 19:01:47] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 109 ms returned sat
[2022-05-15 19:01:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:01:50] [INFO ] [Real]Absence check using state equation in 2216 ms returned sat
[2022-05-15 19:01:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:01:51] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 19:01:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:01:54] [INFO ] [Nat]Absence check using state equation in 3163 ms returned sat
[2022-05-15 19:01:54] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 203 ms.
[2022-05-15 19:01:55] [INFO ] Added : 15 causal constraints over 3 iterations in 1021 ms. Result :unknown
[2022-05-15 19:01:56] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 64 ms returned sat
[2022-05-15 19:01:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:01:58] [INFO ] [Real]Absence check using state equation in 1859 ms returned sat
[2022-05-15 19:01:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:01:58] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 19:01:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:02:01] [INFO ] [Nat]Absence check using state equation in 2310 ms returned sat
[2022-05-15 19:02:01] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 319 ms.
[2022-05-15 19:02:03] [INFO ] Added : 20 causal constraints over 4 iterations in 1765 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 11 out of 2585 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2931 edges and 2585 vertex of which 839 / 2585 are part of one of the 63 SCC in 53 ms
Free SCC test removed 776 places
Drop transitions removed 948 transitions
Reduce isomorphic transitions removed 948 transitions.
Graph (complete) has 2427 edges and 1809 vertex of which 1795 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.17 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 1201 transitions
Trivial Post-agglo rules discarded 1201 transitions
Performed 1201 trivial Post agglomeration. Transition count delta: 1201
Iterating post reduction 0 with 1210 rules applied. Total rules applied 1212 place count 1795 transition count 928
Reduce places removed 1201 places and 0 transitions.
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 1 with 1346 rules applied. Total rules applied 2558 place count 594 transition count 783
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 77 rules applied. Total rules applied 2635 place count 526 transition count 774
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 3 with 12 rules applied. Total rules applied 2647 place count 523 transition count 765
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 10 rules applied. Total rules applied 2657 place count 517 transition count 761
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 2666 place count 516 transition count 753
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2674 place count 508 transition count 753
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 2674 place count 508 transition count 731
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 2718 place count 486 transition count 731
Discarding 77 places :
Symmetric choice reduction at 7 with 77 rule applications. Total rules 2795 place count 409 transition count 654
Iterating global reduction 7 with 77 rules applied. Total rules applied 2872 place count 409 transition count 654
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2874 place count 409 transition count 652
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2875 place count 408 transition count 652
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 8 Pre rules applied. Total rules applied 2875 place count 408 transition count 644
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 9 with 16 rules applied. Total rules applied 2891 place count 400 transition count 644
Discarding 59 places :
Symmetric choice reduction at 9 with 59 rule applications. Total rules 2950 place count 341 transition count 585
Iterating global reduction 9 with 59 rules applied. Total rules applied 3009 place count 341 transition count 585
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 9 with 36 rules applied. Total rules applied 3045 place count 341 transition count 549
Reduce places removed 18 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 10 with 30 rules applied. Total rules applied 3075 place count 323 transition count 537
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 3081 place count 317 transition count 537
Discarding 20 places :
Symmetric choice reduction at 12 with 20 rule applications. Total rules 3101 place count 297 transition count 505
Iterating global reduction 12 with 20 rules applied. Total rules applied 3121 place count 297 transition count 505
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 3129 place count 297 transition count 497
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 3138 place count 288 transition count 479
Iterating global reduction 13 with 9 rules applied. Total rules applied 3147 place count 288 transition count 479
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 3150 place count 285 transition count 473
Iterating global reduction 13 with 3 rules applied. Total rules applied 3153 place count 285 transition count 473
Performed 149 Post agglomeration using F-continuation condition with reduction of 77 identical transitions.
Deduced a syphon composed of 149 places in 2 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 13 with 298 rules applied. Total rules applied 3451 place count 136 transition count 247
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 3453 place count 136 transition count 245
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 14 with 6 rules applied. Total rules applied 3459 place count 133 transition count 242
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 3465 place count 133 transition count 236
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 15 with 6 rules applied. Total rules applied 3471 place count 130 transition count 233
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 3477 place count 130 transition count 227
Performed 31 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 16 with 62 rules applied. Total rules applied 3539 place count 99 transition count 269
Drop transitions removed 11 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 16 with 34 rules applied. Total rules applied 3573 place count 99 transition count 235
Discarding 18 places :
Symmetric choice reduction at 17 with 18 rule applications. Total rules 3591 place count 81 transition count 207
Iterating global reduction 17 with 18 rules applied. Total rules applied 3609 place count 81 transition count 207
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 17 with 9 rules applied. Total rules applied 3618 place count 81 transition count 198
Discarding 4 places :
Symmetric choice reduction at 18 with 4 rule applications. Total rules 3622 place count 77 transition count 190
Iterating global reduction 18 with 4 rules applied. Total rules applied 3626 place count 77 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 3628 place count 77 transition count 188
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 19 with 16 rules applied. Total rules applied 3644 place count 77 transition count 172
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 3646 place count 75 transition count 168
Iterating global reduction 19 with 2 rules applied. Total rules applied 3648 place count 75 transition count 168
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 3649 place count 74 transition count 167
Iterating global reduction 19 with 1 rules applied. Total rules applied 3650 place count 74 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 3651 place count 74 transition count 166
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 20 with 1 rules applied. Total rules applied 3652 place count 74 transition count 165
Free-agglomeration rule applied 6 times.
Iterating global reduction 20 with 6 rules applied. Total rules applied 3658 place count 74 transition count 159
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 7 rules applied. Total rules applied 3665 place count 68 transition count 158
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 21 with 2 rules applied. Total rules applied 3667 place count 68 transition count 156
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 3668 place count 68 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 3669 place count 67 transition count 155
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 3670 place count 67 transition count 154
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 22 with 4 rules applied. Total rules applied 3674 place count 67 transition count 154
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 3675 place count 67 transition count 153
Discarding 1 places :
Symmetric choice reduction at 22 with 1 rule applications. Total rules 3676 place count 66 transition count 152
Iterating global reduction 22 with 1 rules applied. Total rules applied 3677 place count 66 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 22 with 1 rules applied. Total rules applied 3678 place count 65 transition count 151
Applied a total of 3678 rules in 636 ms. Remains 65 /2585 variables (removed 2520) and now considering 151/3095 (removed 2944) transitions.
Finished structural reductions, in 1 iterations. Remains : 65/2585 places, 151/3095 transitions.
Normalized transition count is 143 out of 151 initially.
// Phase 1: matrix 143 rows 65 cols
[2022-05-15 19:02:03] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 13808 resets, run finished after 1707 ms. (steps per millisecond=585 ) properties (out of 11) seen :11
FORMULA CloudReconfiguration-PT-302-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-302-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 95139 ms.

BK_STOP 1652641325715

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-302"
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-4028"
echo " Executing tool itstools"
echo " Input is CloudReconfiguration-PT-302, 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 r042-smll-165252095400221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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