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-165252095600317.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-314, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-165252095600317
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 8.3K Apr 29 14:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 29 14:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 14:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 29 14:25 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:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:20 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-314-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-314-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652675987088

Running Version 202205111006
[2022-05-16 04:39:48] [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-16 04:39:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 04:39:49] [INFO ] Load time of PNML (sax parser for PT used): 357 ms
[2022-05-16 04:39:49] [INFO ] Transformed 2585 places.
[2022-05-16 04:39:49] [INFO ] Transformed 3095 transitions.
[2022-05-16 04:39:49] [INFO ] Found NUPN structural information;
[2022-05-16 04:39:49] [INFO ] Parsed PT model containing 2585 places and 3095 transitions in 565 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
// Phase 1: matrix 3095 rows 2585 cols
[2022-05-16 04:39:49] [INFO ] Computed 4 place invariants in 84 ms
Incomplete random walk after 10000 steps, including 103 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :2
FORMULA CloudReconfiguration-PT-314-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-314-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :1
FORMULA CloudReconfiguration-PT-314-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :0
// Phase 1: matrix 3095 rows 2585 cols
[2022-05-16 04:39:50] [INFO ] Computed 4 place invariants in 26 ms
[2022-05-16 04:39:51] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 74 ms returned sat
[2022-05-16 04:39:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 04:39:53] [INFO ] [Real]Absence check using state equation in 2274 ms returned sat
[2022-05-16 04:39:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 04:39:54] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 73 ms returned sat
[2022-05-16 04:39:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 04:39:56] [INFO ] [Nat]Absence check using state equation in 1818 ms returned sat
[2022-05-16 04:39:56] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 374 ms.
[2022-05-16 04:39: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 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)
[2022-05-16 04:39:59] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 106 ms returned sat
[2022-05-16 04:39:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 04:40:01] [INFO ] [Real]Absence check using state equation in 1880 ms returned sat
[2022-05-16 04:40:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 04:40:02] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 04:40:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 04:40:04] [INFO ] [Nat]Absence check using state equation in 1673 ms returned sat
[2022-05-16 04:40:04] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 247 ms.
[2022-05-16 04:40:06] [INFO ] Added : 45 causal constraints over 9 iterations in 2381 ms. Result :unknown
[2022-05-16 04:40:07] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-16 04:40:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 04:40:09] [INFO ] [Real]Absence check using state equation in 2203 ms returned sat
[2022-05-16 04:40:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 04:40:10] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-16 04:40:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 04:40:12] [INFO ] [Nat]Absence check using state equation in 2160 ms returned sat
[2022-05-16 04:40:13] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 201 ms.
[2022-05-16 04:40:15] [INFO ] Added : 35 causal constraints over 7 iterations in 2095 ms. Result :unknown
[2022-05-16 04:40:16] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-16 04:40:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 04:40:17] [INFO ] [Real]Absence check using state equation in 1753 ms returned sat
[2022-05-16 04:40:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 04:40:18] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 04:40:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 04:40:20] [INFO ] [Nat]Absence check using state equation in 2134 ms returned sat
[2022-05-16 04:40:21] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 346 ms.
[2022-05-16 04:40:22] [INFO ] Added : 40 causal constraints over 8 iterations in 2013 ms. Result :unknown
[2022-05-16 04:40:23] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 04:40:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 04:40:25] [INFO ] [Real]Absence check using state equation in 1886 ms returned sat
[2022-05-16 04:40:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 04:40:26] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 70 ms returned sat
[2022-05-16 04:40:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 04:40:28] [INFO ] [Nat]Absence check using state equation in 1903 ms returned sat
[2022-05-16 04:40:28] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 202 ms.
[2022-05-16 04:40:30] [INFO ] Added : 60 causal constraints over 12 iterations in 2430 ms. Result :unknown
[2022-05-16 04:40:31] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-16 04:40:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 04:40:32] [INFO ] [Real]Absence check using state equation in 1633 ms returned sat
[2022-05-16 04:40:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 04:40:33] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 70 ms returned sat
[2022-05-16 04:40:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 04:40:35] [INFO ] [Nat]Absence check using state equation in 1707 ms returned sat
[2022-05-16 04:40:35] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 197 ms.
[2022-05-16 04:40: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 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-16 04:40:38] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-16 04:40:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 04:40:40] [INFO ] [Real]Absence check using state equation in 1794 ms returned sat
[2022-05-16 04:40:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 04:40:41] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 04:40:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 04:40:43] [INFO ] [Nat]Absence check using state equation in 1809 ms returned sat
[2022-05-16 04:40:43] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 204 ms.
[2022-05-16 04:40:45] [INFO ] Added : 65 causal constraints over 13 iterations in 2513 ms. Result :unknown
[2022-05-16 04:40:46] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-16 04:40:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 04:40:48] [INFO ] [Real]Absence check using state equation in 1759 ms returned sat
[2022-05-16 04:40:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 04:40:48] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-16 04:40:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 04:40:50] [INFO ] [Nat]Absence check using state equation in 1778 ms returned sat
[2022-05-16 04:40:50] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 186 ms.
[2022-05-16 04:40:53] [INFO ] Added : 45 causal constraints over 9 iterations in 2568 ms. Result :unknown
[2022-05-16 04:40:53] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-16 04:40:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 04:40:55] [INFO ] [Real]Absence check using state equation in 1983 ms returned sat
[2022-05-16 04:40:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 04:40:56] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 70 ms returned sat
[2022-05-16 04:40:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 04:40:58] [INFO ] [Nat]Absence check using state equation in 2278 ms returned sat
[2022-05-16 04:40:59] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 197 ms.
[2022-05-16 04:41:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-16 04:41:01] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-16 04:41:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 04:41:03] [INFO ] [Real]Absence check using state equation in 1889 ms returned sat
[2022-05-16 04:41:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 04:41:04] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-16 04:41:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 04:41:06] [INFO ] [Nat]Absence check using state equation in 1873 ms returned sat
[2022-05-16 04:41:06] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 212 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2022-05-16 04:41:08] [INFO ] Added : 50 causal constraints over 10 iterations in 2503 ms. Result :unknown
[2022-05-16 04:41:09] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-16 04:41:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 04:41:11] [INFO ] [Real]Absence check using state equation in 1888 ms returned sat
[2022-05-16 04:41:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 04:41:12] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 04:41:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 04:41:14] [INFO ] [Nat]Absence check using state equation in 1969 ms returned sat
[2022-05-16 04:41:14] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 271 ms.
[2022-05-16 04:41:16] [INFO ] Added : 40 causal constraints over 8 iterations in 2163 ms. Result :unknown
[2022-05-16 04:41:17] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-16 04:41:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 04:41:19] [INFO ] [Real]Absence check using state equation in 1918 ms returned sat
[2022-05-16 04:41:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 04:41:20] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 04:41:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 04:41:22] [INFO ] [Nat]Absence check using state equation in 1918 ms returned sat
[2022-05-16 04:41:22] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 197 ms.
[2022-05-16 04:41:24] [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 11
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-16 04:41:25] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 04:41:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 04:41:27] [INFO ] [Real]Absence check using state equation in 2065 ms returned sat
[2022-05-16 04:41:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 04:41:28] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-16 04:41:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 04:41:30] [INFO ] [Nat]Absence check using state equation in 2075 ms returned sat
[2022-05-16 04:41:30] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 279 ms.
[2022-05-16 04:41:32] [INFO ] Added : 40 causal constraints over 8 iterations in 2131 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 13 out of 2585 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2928 edges and 2585 vertex of which 824 / 2585 are part of one of the 59 SCC in 23 ms
Free SCC test removed 765 places
Drop transitions removed 932 transitions
Reduce isomorphic transitions removed 932 transitions.
Graph (complete) has 2443 edges and 1820 vertex of which 1806 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.15 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 1205 transitions
Trivial Post-agglo rules discarded 1205 transitions
Performed 1205 trivial Post agglomeration. Transition count delta: 1205
Iterating post reduction 0 with 1214 rules applied. Total rules applied 1216 place count 1806 transition count 940
Reduce places removed 1205 places and 0 transitions.
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 1 with 1344 rules applied. Total rules applied 2560 place count 601 transition count 801
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 70 rules applied. Total rules applied 2630 place count 539 transition count 793
Reduce places removed 2 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 3 with 13 rules applied. Total rules applied 2643 place count 537 transition count 782
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 2655 place count 526 transition count 781
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 23 Pre rules applied. Total rules applied 2655 place count 526 transition count 758
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 2701 place count 503 transition count 758
Discarding 79 places :
Symmetric choice reduction at 5 with 79 rule applications. Total rules 2780 place count 424 transition count 679
Iterating global reduction 5 with 79 rules applied. Total rules applied 2859 place count 424 transition count 679
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 5 with 2 rules applied. Total rules applied 2861 place count 424 transition count 677
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2862 place count 423 transition count 677
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 2862 place count 423 transition count 668
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 2880 place count 414 transition count 668
Discarding 60 places :
Symmetric choice reduction at 7 with 60 rule applications. Total rules 2940 place count 354 transition count 608
Iterating global reduction 7 with 60 rules applied. Total rules applied 3000 place count 354 transition count 608
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 7 with 34 rules applied. Total rules applied 3034 place count 354 transition count 574
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 27 rules applied. Total rules applied 3061 place count 337 transition count 564
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 3066 place count 332 transition count 564
Discarding 21 places :
Symmetric choice reduction at 10 with 21 rule applications. Total rules 3087 place count 311 transition count 531
Iterating global reduction 10 with 21 rules applied. Total rules applied 3108 place count 311 transition count 531
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 3117 place count 311 transition count 522
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 3126 place count 302 transition count 504
Iterating global reduction 11 with 9 rules applied. Total rules applied 3135 place count 302 transition count 504
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 3138 place count 299 transition count 498
Iterating global reduction 11 with 3 rules applied. Total rules applied 3141 place count 299 transition count 498
Performed 156 Post agglomeration using F-continuation condition with reduction of 82 identical transitions.
Deduced a syphon composed of 156 places in 1 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 11 with 312 rules applied. Total rules applied 3453 place count 143 transition count 260
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 3456 place count 143 transition count 257
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 12 with 6 rules applied. Total rules applied 3462 place count 140 transition count 254
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3468 place count 140 transition count 248
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 3474 place count 137 transition count 245
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3480 place count 137 transition count 239
Performed 37 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 14 with 74 rules applied. Total rules applied 3554 place count 100 transition count 273
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 14 with 28 rules applied. Total rules applied 3582 place count 100 transition count 245
Discarding 20 places :
Symmetric choice reduction at 15 with 20 rule applications. Total rules 3602 place count 80 transition count 205
Iterating global reduction 15 with 20 rules applied. Total rules applied 3622 place count 80 transition count 205
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 3632 place count 80 transition count 195
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 3636 place count 76 transition count 187
Iterating global reduction 16 with 4 rules applied. Total rules applied 3640 place count 76 transition count 187
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 3644 place count 76 transition count 183
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 17 with 4 rules applied. Total rules applied 3648 place count 76 transition count 179
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 3650 place count 75 transition count 178
Free-agglomeration rule applied 4 times.
Iterating global reduction 17 with 4 rules applied. Total rules applied 3654 place count 75 transition count 174
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 7 rules applied. Total rules applied 3661 place count 71 transition count 171
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 3662 place count 71 transition count 170
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 3664 place count 71 transition count 170
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 3665 place count 71 transition count 169
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 3666 place count 70 transition count 168
Iterating global reduction 18 with 1 rules applied. Total rules applied 3667 place count 70 transition count 168
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 3668 place count 69 transition count 167
Applied a total of 3668 rules in 420 ms. Remains 69 /2585 variables (removed 2516) and now considering 167/3095 (removed 2928) transitions.
Finished structural reductions, in 1 iterations. Remains : 69/2585 places, 167/3095 transitions.
Normalized transition count is 156 out of 167 initially.
// Phase 1: matrix 156 rows 69 cols
[2022-05-16 04:41:33] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 12541 resets, run finished after 1341 ms. (steps per millisecond=745 ) properties (out of 13) seen :12
FORMULA CloudReconfiguration-PT-314-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-314-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-314-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-314-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-314-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-314-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-314-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-314-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-314-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-314-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-314-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-314-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 4173 resets, run finished after 433 ms. (steps per millisecond=2309 ) properties (out of 1) seen :0
[2022-05-16 04:41:34] [INFO ] Flow matrix only has 156 transitions (discarded 11 similar events)
// Phase 1: matrix 156 rows 69 cols
[2022-05-16 04:41:34] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 04:41:34] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-16 04:41:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 04:41:34] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-05-16 04:41:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 04:41:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2022-05-16 04:41:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 04:41:35] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-05-16 04:41:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 04:41:35] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2022-05-16 04:41:35] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 5 ms to minimize.
[2022-05-16 04:41:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
Current structural bounds on expressions (after SMT) : [0] Max seen :[0]
FORMULA CloudReconfiguration-PT-314-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 106295 ms.

BK_STOP 1652676095193

--------------------
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-314"
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-314, 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-165252095600317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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