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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 908K
-rw-r--r-- 1 mcc users 8.5K Apr 29 14:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 29 14:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 14:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 14:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 660K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-301-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652637248235

Running Version 202205111006
[2022-05-15 17:54:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 17:54:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 17:54:11] [INFO ] Load time of PNML (sax parser for PT used): 540 ms
[2022-05-15 17:54:11] [INFO ] Transformed 2584 places.
[2022-05-15 17:54:11] [INFO ] Transformed 3094 transitions.
[2022-05-15 17:54:11] [INFO ] Found NUPN structural information;
[2022-05-15 17:54:11] [INFO ] Parsed PT model containing 2584 places and 3094 transitions in 816 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
// Phase 1: matrix 3094 rows 2584 cols
[2022-05-15 17:54:11] [INFO ] Computed 4 place invariants in 75 ms
Incomplete random walk after 10000 steps, including 77 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 16) seen :1
FORMULA CloudReconfiguration-PT-301-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 15) seen :1
FORMULA CloudReconfiguration-PT-301-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 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 22 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :1
FORMULA CloudReconfiguration-PT-301-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :0
// Phase 1: matrix 3094 rows 2584 cols
[2022-05-15 17:54:12] [INFO ] Computed 4 place invariants in 33 ms
[2022-05-15 17:54:13] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 73 ms returned sat
[2022-05-15 17:54:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:54:15] [INFO ] [Real]Absence check using state equation in 2325 ms returned sat
[2022-05-15 17:54:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:54:16] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-15 17:54:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:54:18] [INFO ] [Nat]Absence check using state equation in 1665 ms returned sat
[2022-05-15 17:54:19] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 398 ms.
[2022-05-15 17:54:21] [INFO ] Added : 30 causal constraints over 6 iterations in 2306 ms. Result :unknown
[2022-05-15 17:54:21] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 65 ms returned sat
[2022-05-15 17:54:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:54:23] [INFO ] [Real]Absence check using state equation in 1861 ms returned sat
[2022-05-15 17:54:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:54:24] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 85 ms returned sat
[2022-05-15 17:54:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:54:26] [INFO ] [Nat]Absence check using state equation in 1908 ms returned sat
[2022-05-15 17:54:26] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 275 ms.
[2022-05-15 17:54:29] [INFO ] Added : 35 causal constraints over 7 iterations in 2373 ms. Result :unknown
[2022-05-15 17:54:29] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 64 ms returned sat
[2022-05-15 17:54:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:54:31] [INFO ] [Real]Absence check using state equation in 1793 ms returned sat
[2022-05-15 17:54:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:54:32] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 76 ms returned sat
[2022-05-15 17:54:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:54:34] [INFO ] [Nat]Absence check using state equation in 1725 ms returned sat
[2022-05-15 17:54:34] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 205 ms.
[2022-05-15 17:54:36] [INFO ] Added : 40 causal constraints over 8 iterations in 2582 ms. Result :unknown
[2022-05-15 17:54:37] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 64 ms returned sat
[2022-05-15 17:54:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:54:39] [INFO ] [Real]Absence check using state equation in 1846 ms returned sat
[2022-05-15 17:54:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:54:40] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 109 ms returned sat
[2022-05-15 17:54:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:54:42] [INFO ] [Nat]Absence check using state equation in 1950 ms returned sat
[2022-05-15 17:54:43] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 330 ms.
[2022-05-15 17:54:44] [INFO ] Added : 45 causal constraints over 9 iterations in 2251 ms. Result :unknown
[2022-05-15 17:54:45] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 64 ms returned sat
[2022-05-15 17:54:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:54:47] [INFO ] [Real]Absence check using state equation in 1805 ms returned sat
[2022-05-15 17:54:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:54:48] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 94 ms returned sat
[2022-05-15 17:54:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:54:50] [INFO ] [Nat]Absence check using state equation in 1746 ms returned sat
[2022-05-15 17:54:50] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 274 ms.
[2022-05-15 17:54:52] [INFO ] Added : 40 causal constraints over 8 iterations in 2270 ms. Result :unknown
[2022-05-15 17:54:53] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 63 ms returned sat
[2022-05-15 17:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:54:55] [INFO ] [Real]Absence check using state equation in 1636 ms returned sat
[2022-05-15 17:54:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:54:56] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 103 ms returned sat
[2022-05-15 17:54:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:54:58] [INFO ] [Nat]Absence check using state equation in 1852 ms returned sat
[2022-05-15 17:54:58] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 165 ms.
[2022-05-15 17:55:00] [INFO ] Added : 35 causal constraints over 7 iterations in 2232 ms. Result :unknown
[2022-05-15 17:55:01] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 97 ms returned sat
[2022-05-15 17:55:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:55:03] [INFO ] [Real]Absence check using state equation in 2179 ms returned sat
[2022-05-15 17:55:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:55:04] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 111 ms returned sat
[2022-05-15 17:55:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:55:06] [INFO ] [Nat]Absence check using state equation in 2018 ms returned sat
[2022-05-15 17:55:06] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 193 ms.
[2022-05-15 17:55:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 17:55:09] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 64 ms returned sat
[2022-05-15 17:55:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:55:11] [INFO ] [Real]Absence check using state equation in 1905 ms returned sat
[2022-05-15 17:55:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:55:12] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-15 17:55:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:55:14] [INFO ] [Nat]Absence check using state equation in 1746 ms returned sat
[2022-05-15 17:55:14] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 198 ms.
[2022-05-15 17:55:16] [INFO ] Added : 40 causal constraints over 8 iterations in 2691 ms. Result :unknown
[2022-05-15 17:55:17] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 65 ms returned sat
[2022-05-15 17:55:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:55:19] [INFO ] [Real]Absence check using state equation in 1931 ms returned sat
[2022-05-15 17:55:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:55:20] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2022-05-15 17:55:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:55:22] [INFO ] [Nat]Absence check using state equation in 1964 ms returned sat
[2022-05-15 17:55:23] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 325 ms.
[2022-05-15 17:55: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 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-15 17:55:25] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 63 ms returned sat
[2022-05-15 17:55:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:55:27] [INFO ] [Real]Absence check using state equation in 1847 ms returned sat
[2022-05-15 17:55:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:55:28] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 82 ms returned sat
[2022-05-15 17:55:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:55:30] [INFO ] [Nat]Absence check using state equation in 1783 ms returned sat
[2022-05-15 17:55:30] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 203 ms.
[2022-05-15 17:55:32] [INFO ] Added : 45 causal constraints over 9 iterations in 2530 ms. Result :unknown
[2022-05-15 17:55:33] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 64 ms returned sat
[2022-05-15 17:55:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:55:35] [INFO ] [Real]Absence check using state equation in 1889 ms returned sat
[2022-05-15 17:55:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:55:36] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 77 ms returned sat
[2022-05-15 17:55:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:55:38] [INFO ] [Nat]Absence check using state equation in 1757 ms returned sat
[2022-05-15 17:55:38] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 190 ms.
[2022-05-15 17:55:40] [INFO ] Added : 40 causal constraints over 8 iterations in 2583 ms. Result :unknown
[2022-05-15 17:55:41] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-15 17:55:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:55:43] [INFO ] [Real]Absence check using state equation in 1739 ms returned sat
[2022-05-15 17:55:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:55:44] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 66 ms returned sat
[2022-05-15 17:55:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:55:46] [INFO ] [Nat]Absence check using state equation in 1738 ms returned sat
[2022-05-15 17:55:46] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 273 ms.
[2022-05-15 17:55:48] [INFO ] Added : 35 causal constraints over 7 iterations in 2532 ms. Result :unknown
[2022-05-15 17:55:49] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 64 ms returned sat
[2022-05-15 17:55:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 17:55:51] [INFO ] [Real]Absence check using state equation in 1593 ms returned sat
[2022-05-15 17:55:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 17:55:51] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 101 ms returned sat
[2022-05-15 17:55:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 17:55:53] [INFO ] [Nat]Absence check using state equation in 1923 ms returned sat
[2022-05-15 17:55:54] [INFO ] Computed and/alt/rep : 3085/3787/3085 causal constraints (skipped 8 transitions) in 192 ms.
[2022-05-15 17:55:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 2584 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Graph (trivial) has 2928 edges and 2584 vertex of which 811 / 2584 are part of one of the 59 SCC in 23 ms
Free SCC test removed 752 places
Drop transitions removed 916 transitions
Reduce isomorphic transitions removed 916 transitions.
Graph (complete) has 2456 edges and 1832 vertex of which 1818 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.14 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 1214 transitions
Trivial Post-agglo rules discarded 1214 transitions
Performed 1214 trivial Post agglomeration. Transition count delta: 1214
Iterating post reduction 0 with 1223 rules applied. Total rules applied 1225 place count 1818 transition count 946
Reduce places removed 1214 places and 0 transitions.
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 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 1352 rules applied. Total rules applied 2577 place count 604 transition count 808
Reduce places removed 62 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 73 rules applied. Total rules applied 2650 place count 542 transition count 797
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 9 rules applied. Total rules applied 2659 place count 538 transition count 792
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 6 rules applied. Total rules applied 2665 place count 535 transition count 789
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 5 with 7 rules applied. Total rules applied 2672 place count 534 transition count 783
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2678 place count 528 transition count 783
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 2678 place count 528 transition count 761
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 2722 place count 506 transition count 761
Discarding 77 places :
Symmetric choice reduction at 7 with 77 rule applications. Total rules 2799 place count 429 transition count 684
Iterating global reduction 7 with 77 rules applied. Total rules applied 2876 place count 429 transition count 684
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 2879 place count 429 transition count 681
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 2882 place count 428 transition count 679
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 3 rules applied. Total rules applied 2885 place count 427 transition count 677
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 3 rules applied. Total rules applied 2888 place count 426 transition count 675
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 2889 place count 425 transition count 675
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 5 Pre rules applied. Total rules applied 2889 place count 425 transition count 670
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 12 with 10 rules applied. Total rules applied 2899 place count 420 transition count 670
Discarding 59 places :
Symmetric choice reduction at 12 with 59 rule applications. Total rules 2958 place count 361 transition count 611
Iterating global reduction 12 with 59 rules applied. Total rules applied 3017 place count 361 transition count 611
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 12 with 36 rules applied. Total rules applied 3053 place count 361 transition count 575
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 13 with 30 rules applied. Total rules applied 3083 place count 343 transition count 563
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 3089 place count 337 transition count 563
Discarding 19 places :
Symmetric choice reduction at 15 with 19 rule applications. Total rules 3108 place count 318 transition count 533
Iterating global reduction 15 with 19 rules applied. Total rules applied 3127 place count 318 transition count 533
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 3135 place count 318 transition count 525
Discarding 8 places :
Symmetric choice reduction at 16 with 8 rule applications. Total rules 3143 place count 310 transition count 509
Iterating global reduction 16 with 8 rules applied. Total rules applied 3151 place count 310 transition count 509
Discarding 3 places :
Symmetric choice reduction at 16 with 3 rule applications. Total rules 3154 place count 307 transition count 503
Iterating global reduction 16 with 3 rules applied. Total rules applied 3157 place count 307 transition count 503
Performed 162 Post agglomeration using F-continuation condition with reduction of 84 identical transitions.
Deduced a syphon composed of 162 places in 1 ms
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 16 with 324 rules applied. Total rules applied 3481 place count 145 transition count 257
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 3483 place count 145 transition count 255
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 17 with 6 rules applied. Total rules applied 3489 place count 142 transition count 252
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 3495 place count 142 transition count 246
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 18 with 6 rules applied. Total rules applied 3501 place count 139 transition count 243
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 3507 place count 139 transition count 237
Performed 37 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 19 with 74 rules applied. Total rules applied 3581 place count 102 transition count 276
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 19 with 28 rules applied. Total rules applied 3609 place count 102 transition count 248
Discarding 19 places :
Symmetric choice reduction at 20 with 19 rule applications. Total rules 3628 place count 83 transition count 210
Iterating global reduction 20 with 19 rules applied. Total rules applied 3647 place count 83 transition count 210
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 20 with 11 rules applied. Total rules applied 3658 place count 83 transition count 199
Discarding 2 places :
Symmetric choice reduction at 21 with 2 rule applications. Total rules 3660 place count 81 transition count 195
Iterating global reduction 21 with 2 rules applied. Total rules applied 3662 place count 81 transition count 195
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 3664 place count 81 transition count 193
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 3665 place count 81 transition count 192
Free-agglomeration rule applied 4 times.
Iterating global reduction 22 with 4 rules applied. Total rules applied 3669 place count 81 transition count 188
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 3675 place count 77 transition count 186
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 23 with 1 rules applied. Total rules applied 3676 place count 77 transition count 185
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 23 with 8 rules applied. Total rules applied 3684 place count 77 transition count 185
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 23 with 2 rules applied. Total rules applied 3686 place count 77 transition count 183
Discarding 2 places :
Symmetric choice reduction at 23 with 2 rule applications. Total rules 3688 place count 75 transition count 181
Iterating global reduction 23 with 2 rules applied. Total rules applied 3690 place count 75 transition count 181
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 23 with 1 rules applied. Total rules applied 3691 place count 74 transition count 180
Applied a total of 3691 rules in 600 ms. Remains 74 /2584 variables (removed 2510) and now considering 180/3094 (removed 2914) transitions.
Finished structural reductions, in 1 iterations. Remains : 74/2584 places, 180/3094 transitions.
Normalized transition count is 169 out of 180 initially.
// Phase 1: matrix 169 rows 74 cols
[2022-05-15 17:55:56] [INFO ] Computed 4 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 12730 resets, run finished after 1871 ms. (steps per millisecond=534 ) properties (out of 13) seen :13
FORMULA CloudReconfiguration-PT-301-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-301-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 108000 ms.

BK_STOP 1652637358787

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

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