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

About the Execution of 2022-gold for CloudReconfiguration-PT-402

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
758.071 103113.00 124518.00 324.40 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r127-tall-167814504300022.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 gold2022
Input is CloudReconfiguration-PT-402, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r127-tall-167814504300022
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.8K Feb 25 11:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 11:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 11:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 11:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 11:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Feb 25 11:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 11:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 11:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 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 912K 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-402-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-402-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-402-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-402-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-402-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-402-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-402-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-402-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-402-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-402-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-402-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-402-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-402-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-402-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-402-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-402-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678174458445

Running Version 202205111006
[2023-03-07 07:34:19] [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]
[2023-03-07 07:34:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 07:34:19] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2023-03-07 07:34:19] [INFO ] Transformed 3554 places.
[2023-03-07 07:34:20] [INFO ] Transformed 4263 transitions.
[2023-03-07 07:34:20] [INFO ] Found NUPN structural information;
[2023-03-07 07:34:20] [INFO ] Parsed PT model containing 3554 places and 4263 transitions in 326 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 4263 rows 3554 cols
[2023-03-07 07:34:20] [INFO ] Computed 5 place invariants in 80 ms
Incomplete random walk after 10000 steps, including 54 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :2
FORMULA CloudReconfiguration-PT-402-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-402-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :1
FORMULA CloudReconfiguration-PT-402-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 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 13 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 13 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 13 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
// Phase 1: matrix 4263 rows 3554 cols
[2023-03-07 07:34:20] [INFO ] Computed 5 place invariants in 27 ms
[2023-03-07 07:34:21] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 71 ms returned sat
[2023-03-07 07:34:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:23] [INFO ] [Real]Absence check using state equation in 1912 ms returned sat
[2023-03-07 07:34:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:34:23] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 62 ms returned sat
[2023-03-07 07:34:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:25] [INFO ] [Nat]Absence check using state equation in 1888 ms returned sat
[2023-03-07 07:34:26] [INFO ] Computed and/alt/rep : 4252/5222/4252 causal constraints (skipped 10 transitions) in 241 ms.
[2023-03-07 07:34:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
[2023-03-07 07:34:28] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 60 ms returned sat
[2023-03-07 07:34:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:30] [INFO ] [Real]Absence check using state equation in 1864 ms returned sat
[2023-03-07 07:34:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:34:31] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 64 ms returned sat
[2023-03-07 07:34:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:33] [INFO ] [Nat]Absence check using state equation in 1902 ms returned sat
[2023-03-07 07:34:33] [INFO ] Computed and/alt/rep : 4252/5222/4252 causal constraints (skipped 10 transitions) in 215 ms.
[2023-03-07 07:34:35] [INFO ] Added : 65 causal constraints over 13 iterations in 2468 ms. Result :unknown
[2023-03-07 07:34:36] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 66 ms returned sat
[2023-03-07 07:34:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:38] [INFO ] [Real]Absence check using state equation in 1944 ms returned sat
[2023-03-07 07:34:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:34:39] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 64 ms returned sat
[2023-03-07 07:34:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:41] [INFO ] [Nat]Absence check using state equation in 1978 ms returned sat
[2023-03-07 07:34:41] [INFO ] Computed and/alt/rep : 4252/5222/4252 causal constraints (skipped 10 transitions) in 241 ms.
[2023-03-07 07:34:43] [INFO ] Added : 60 causal constraints over 12 iterations in 2395 ms. Result :unknown
[2023-03-07 07:34:44] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 60 ms returned sat
[2023-03-07 07:34:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:45] [INFO ] [Real]Absence check using state equation in 1844 ms returned sat
[2023-03-07 07:34:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:34:46] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 61 ms returned sat
[2023-03-07 07:34:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:48] [INFO ] [Nat]Absence check using state equation in 1815 ms returned sat
[2023-03-07 07:34:48] [INFO ] Computed and/alt/rep : 4252/5222/4252 causal constraints (skipped 10 transitions) in 193 ms.
[2023-03-07 07:34:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
[2023-03-07 07:34:51] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 61 ms returned sat
[2023-03-07 07:34:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:53] [INFO ] [Real]Absence check using state equation in 1877 ms returned sat
[2023-03-07 07:34:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:34:54] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 63 ms returned sat
[2023-03-07 07:34:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:56] [INFO ] [Nat]Absence check using state equation in 1918 ms returned sat
[2023-03-07 07:34:56] [INFO ] Computed and/alt/rep : 4252/5222/4252 causal constraints (skipped 10 transitions) in 193 ms.
[2023-03-07 07:34:58] [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)
[2023-03-07 07:34:59] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 62 ms returned sat
[2023-03-07 07:34:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:01] [INFO ] [Real]Absence check using state equation in 1930 ms returned sat
[2023-03-07 07:35:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:35:01] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 63 ms returned sat
[2023-03-07 07:35:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:03] [INFO ] [Nat]Absence check using state equation in 1878 ms returned sat
[2023-03-07 07:35:04] [INFO ] Computed and/alt/rep : 4252/5222/4252 causal constraints (skipped 10 transitions) in 216 ms.
[2023-03-07 07:35:06] [INFO ] Added : 60 causal constraints over 12 iterations in 2543 ms. Result :unknown
[2023-03-07 07:35:07] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 59 ms returned sat
[2023-03-07 07:35:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:09] [INFO ] [Real]Absence check using state equation in 1961 ms returned sat
[2023-03-07 07:35:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:35:09] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 61 ms returned sat
[2023-03-07 07:35:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:11] [INFO ] [Nat]Absence check using state equation in 1886 ms returned sat
[2023-03-07 07:35:11] [INFO ] Computed and/alt/rep : 4252/5222/4252 causal constraints (skipped 10 transitions) in 194 ms.
[2023-03-07 07:35:14] [INFO ] Added : 60 causal constraints over 12 iterations in 2453 ms. Result :unknown
[2023-03-07 07:35:14] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 61 ms returned sat
[2023-03-07 07:35:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:16] [INFO ] [Real]Absence check using state equation in 1940 ms returned sat
[2023-03-07 07:35:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:35:17] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 66 ms returned sat
[2023-03-07 07:35:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:19] [INFO ] [Nat]Absence check using state equation in 1807 ms returned sat
[2023-03-07 07:35:19] [INFO ] Computed and/alt/rep : 4252/5222/4252 causal constraints (skipped 10 transitions) in 194 ms.
[2023-03-07 07:35:21] [INFO ] Added : 65 causal constraints over 13 iterations in 2639 ms. Result :unknown
[2023-03-07 07:35:22] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 60 ms returned sat
[2023-03-07 07:35:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:24] [INFO ] [Real]Absence check using state equation in 1869 ms returned sat
[2023-03-07 07:35:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:35:24] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 59 ms returned sat
[2023-03-07 07:35:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:26] [INFO ] [Nat]Absence check using state equation in 1820 ms returned sat
[2023-03-07 07:35:27] [INFO ] Computed and/alt/rep : 4252/5222/4252 causal constraints (skipped 10 transitions) in 182 ms.
[2023-03-07 07:35:29] [INFO ] Added : 65 causal constraints over 13 iterations in 2605 ms. Result :unknown
[2023-03-07 07:35:30] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 56 ms returned sat
[2023-03-07 07:35:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:31] [INFO ] [Real]Absence check using state equation in 1654 ms returned sat
[2023-03-07 07:35:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:35:32] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 62 ms returned sat
[2023-03-07 07:35:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:34] [INFO ] [Nat]Absence check using state equation in 1769 ms returned sat
[2023-03-07 07:35:34] [INFO ] Computed and/alt/rep : 4252/5222/4252 causal constraints (skipped 10 transitions) in 199 ms.
[2023-03-07 07:35:36] [INFO ] Added : 65 causal constraints over 13 iterations in 2598 ms. Result :unknown
[2023-03-07 07:35:37] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 59 ms returned sat
[2023-03-07 07:35:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:39] [INFO ] [Real]Absence check using state equation in 1939 ms returned sat
[2023-03-07 07:35:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:35:40] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 62 ms returned sat
[2023-03-07 07:35:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:42] [INFO ] [Nat]Absence check using state equation in 2423 ms returned sat
[2023-03-07 07:35:42] [INFO ] Computed and/alt/rep : 4252/5222/4252 causal constraints (skipped 10 transitions) in 181 ms.
[2023-03-07 07:35:44] [INFO ] Added : 50 causal constraints over 10 iterations in 2052 ms. Result :unknown
[2023-03-07 07:35:45] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 58 ms returned sat
[2023-03-07 07:35:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:47] [INFO ] [Real]Absence check using state equation in 1857 ms returned sat
[2023-03-07 07:35:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:35:47] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 65 ms returned sat
[2023-03-07 07:35:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:49] [INFO ] [Nat]Absence check using state equation in 1982 ms returned sat
[2023-03-07 07:35:49] [INFO ] Computed and/alt/rep : 4252/5222/4252 causal constraints (skipped 10 transitions) in 195 ms.
[2023-03-07 07:35:52] [INFO ] Added : 60 causal constraints over 12 iterations in 2385 ms. Result :unknown
[2023-03-07 07:35:52] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 61 ms returned sat
[2023-03-07 07:35:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:54] [INFO ] [Real]Absence check using state equation in 2003 ms returned sat
[2023-03-07 07:35:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:35:55] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 61 ms returned sat
[2023-03-07 07:35:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:35:57] [INFO ] [Nat]Absence check using state equation in 2340 ms returned sat
[2023-03-07 07:35:58] [INFO ] Computed and/alt/rep : 4252/5222/4252 causal constraints (skipped 10 transitions) in 191 ms.
[2023-03-07 07:35:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 13 out of 3554 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3554/3554 places, 4263/4263 transitions.
Graph (trivial) has 4053 edges and 3554 vertex of which 1228 / 3554 are part of one of the 87 SCC in 15 ms
Free SCC test removed 1141 places
Drop transitions removed 1396 transitions
Reduce isomorphic transitions removed 1396 transitions.
Graph (complete) has 3239 edges and 2413 vertex of which 2395 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.10 ms
Discarding 18 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 1611 transitions
Trivial Post-agglo rules discarded 1611 transitions
Performed 1611 trivial Post agglomeration. Transition count delta: 1611
Iterating post reduction 0 with 1623 rules applied. Total rules applied 1625 place count 2395 transition count 1232
Reduce places removed 1611 places and 0 transitions.
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 1 with 1801 rules applied. Total rules applied 3426 place count 784 transition count 1042
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 97 rules applied. Total rules applied 3523 place count 698 transition count 1031
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 12 rules applied. Total rules applied 3535 place count 694 transition count 1023
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 with 10 rules applied. Total rules applied 3545 place count 689 transition count 1018
Reduce places removed 2 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 5 with 9 rules applied. Total rules applied 3554 place count 687 transition count 1011
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 3561 place count 680 transition count 1011
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 30 Pre rules applied. Total rules applied 3561 place count 680 transition count 981
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 3621 place count 650 transition count 981
Discarding 104 places :
Symmetric choice reduction at 7 with 104 rule applications. Total rules 3725 place count 546 transition count 877
Iterating global reduction 7 with 104 rules applied. Total rules applied 3829 place count 546 transition count 877
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 7 with 2 rules applied. Total rules applied 3831 place count 546 transition count 875
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3832 place count 545 transition count 875
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 12 Pre rules applied. Total rules applied 3832 place count 545 transition count 863
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 3856 place count 533 transition count 863
Discarding 82 places :
Symmetric choice reduction at 9 with 82 rule applications. Total rules 3938 place count 451 transition count 781
Iterating global reduction 9 with 82 rules applied. Total rules applied 4020 place count 451 transition count 781
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 9 with 46 rules applied. Total rules applied 4066 place count 451 transition count 735
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 10 with 37 rules applied. Total rules applied 4103 place count 428 transition count 721
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 4110 place count 421 transition count 721
Discarding 28 places :
Symmetric choice reduction at 12 with 28 rule applications. Total rules 4138 place count 393 transition count 677
Iterating global reduction 12 with 28 rules applied. Total rules applied 4166 place count 393 transition count 677
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 12 with 12 rules applied. Total rules applied 4178 place count 393 transition count 665
Discarding 12 places :
Symmetric choice reduction at 13 with 12 rule applications. Total rules 4190 place count 381 transition count 641
Iterating global reduction 13 with 12 rules applied. Total rules applied 4202 place count 381 transition count 641
Discarding 4 places :
Symmetric choice reduction at 13 with 4 rule applications. Total rules 4206 place count 377 transition count 633
Iterating global reduction 13 with 4 rules applied. Total rules applied 4210 place count 377 transition count 633
Performed 197 Post agglomeration using F-continuation condition with reduction of 104 identical transitions.
Deduced a syphon composed of 197 places in 1 ms
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 13 with 394 rules applied. Total rules applied 4604 place count 180 transition count 332
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 4607 place count 180 transition count 329
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 4615 place count 176 transition count 325
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 4623 place count 176 transition count 317
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 15 with 8 rules applied. Total rules applied 4631 place count 172 transition count 313
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 4639 place count 172 transition count 305
Performed 47 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 16 with 94 rules applied. Total rules applied 4733 place count 125 transition count 348
Drop transitions removed 11 transitions
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 16 with 48 rules applied. Total rules applied 4781 place count 125 transition count 300
Discarding 28 places :
Symmetric choice reduction at 17 with 28 rule applications. Total rules 4809 place count 97 transition count 252
Iterating global reduction 17 with 28 rules applied. Total rules applied 4837 place count 97 transition count 252
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 17 with 14 rules applied. Total rules applied 4851 place count 97 transition count 238
Discarding 7 places :
Symmetric choice reduction at 18 with 7 rule applications. Total rules 4858 place count 90 transition count 224
Iterating global reduction 18 with 7 rules applied. Total rules applied 4865 place count 90 transition count 224
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 4869 place count 90 transition count 220
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 19 with 28 rules applied. Total rules applied 4897 place count 90 transition count 192
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 4899 place count 88 transition count 188
Iterating global reduction 19 with 2 rules applied. Total rules applied 4901 place count 88 transition count 188
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 4902 place count 87 transition count 187
Iterating global reduction 19 with 1 rules applied. Total rules applied 4903 place count 87 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 4904 place count 87 transition count 186
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 4906 place count 87 transition count 184
Free-agglomeration rule applied 7 times.
Iterating global reduction 20 with 7 rules applied. Total rules applied 4913 place count 87 transition count 177
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 8 rules applied. Total rules applied 4921 place count 80 transition count 176
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 4922 place count 80 transition count 175
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 21 with 7 rules applied. Total rules applied 4929 place count 80 transition count 175
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 21 with 3 rules applied. Total rules applied 4932 place count 80 transition count 172
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 4933 place count 79 transition count 171
Iterating global reduction 21 with 1 rules applied. Total rules applied 4934 place count 79 transition count 171
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 21 with 1 rules applied. Total rules applied 4935 place count 78 transition count 170
Applied a total of 4935 rules in 373 ms. Remains 78 /3554 variables (removed 3476) and now considering 170/4263 (removed 4093) transitions.
Finished structural reductions, in 1 iterations. Remains : 78/3554 places, 170/4263 transitions.
Normalized transition count is 159 out of 170 initially.
// Phase 1: matrix 159 rows 78 cols
[2023-03-07 07:36:00] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 12443 resets, run finished after 1201 ms. (steps per millisecond=832 ) properties (out of 13) seen :13
FORMULA CloudReconfiguration-PT-402-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-402-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-402-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-402-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-402-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-402-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-402-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-402-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-402-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-402-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-402-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-402-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-402-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 101850 ms.

BK_STOP 1678174561558

--------------------
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-402"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is CloudReconfiguration-PT-402, 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 r127-tall-167814504300022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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