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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 5.4K Apr 29 14:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Apr 29 14:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 29 14:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 14:32 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:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 07:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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-310-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-310-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-310-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-310-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-310-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-310-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-310-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-310-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-310-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-310-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-310-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-310-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-310-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-310-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-310-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-310-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652663138492

Running Version 202205111006
[2022-05-16 01:05:40] [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 01:05:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 01:05:41] [INFO ] Load time of PNML (sax parser for PT used): 462 ms
[2022-05-16 01:05:41] [INFO ] Transformed 2585 places.
[2022-05-16 01:05:41] [INFO ] Transformed 3095 transitions.
[2022-05-16 01:05:41] [INFO ] Found NUPN structural information;
[2022-05-16 01:05:41] [INFO ] Parsed PT model containing 2585 places and 3095 transitions in 725 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
// Phase 1: matrix 3095 rows 2585 cols
[2022-05-16 01:05:41] [INFO ] Computed 4 place invariants in 139 ms
Incomplete random walk after 10000 steps, including 82 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 16) seen :1
FORMULA CloudReconfiguration-PT-310-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 15) seen :1
FORMULA CloudReconfiguration-PT-310-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :1
FORMULA CloudReconfiguration-PT-310-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 25 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 22 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 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 22 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :0
// Phase 1: matrix 3095 rows 2585 cols
[2022-05-16 01:05:42] [INFO ] Computed 4 place invariants in 27 ms
[2022-05-16 01:05:43] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 77 ms returned sat
[2022-05-16 01:05:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:05:45] [INFO ] [Real]Absence check using state equation in 2159 ms returned sat
[2022-05-16 01:05:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:05:46] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 71 ms returned sat
[2022-05-16 01:05:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:05:48] [INFO ] [Nat]Absence check using state equation in 2132 ms returned sat
[2022-05-16 01:05:49] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 276 ms.
[2022-05-16 01:05:51] [INFO ] Added : 40 causal constraints over 8 iterations in 2027 ms. Result :unknown
[2022-05-16 01:05:52] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 109 ms returned sat
[2022-05-16 01:05:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:05:54] [INFO ] [Real]Absence check using state equation in 2138 ms returned sat
[2022-05-16 01:05:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:05:55] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 70 ms returned sat
[2022-05-16 01:05:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:05:57] [INFO ] [Nat]Absence check using state equation in 2113 ms returned sat
[2022-05-16 01:05:57] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 292 ms.
[2022-05-16 01:05:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 01:06:00] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 01:06:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:06:02] [INFO ] [Real]Absence check using state equation in 1876 ms returned sat
[2022-05-16 01:06:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:06:02] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 01:06:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:06:04] [INFO ] [Nat]Absence check using state equation in 1872 ms returned sat
[2022-05-16 01:06:05] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 263 ms.
[2022-05-16 01:06:07] [INFO ] Added : 40 causal constraints over 8 iterations in 2404 ms. Result :unknown
[2022-05-16 01:06:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-16 01:06:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:06:10] [INFO ] [Real]Absence check using state equation in 2054 ms returned sat
[2022-05-16 01:06:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:06:11] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-16 01:06:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:06:13] [INFO ] [Nat]Absence check using state equation in 2399 ms returned sat
[2022-05-16 01:06:13] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 326 ms.
[2022-05-16 01:06:15] [INFO ] Added : 30 causal constraints over 6 iterations in 1714 ms. Result :unknown
[2022-05-16 01:06:16] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-16 01:06:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:06:18] [INFO ] [Real]Absence check using state equation in 2155 ms returned sat
[2022-05-16 01:06:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:06:19] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 01:06:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:06:21] [INFO ] [Nat]Absence check using state equation in 2046 ms returned sat
[2022-05-16 01:06:21] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 198 ms.
[2022-05-16 01:06:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 01:06:24] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 82 ms returned sat
[2022-05-16 01:06:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:06:26] [INFO ] [Real]Absence check using state equation in 2329 ms returned sat
[2022-05-16 01:06:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:06:27] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 71 ms returned sat
[2022-05-16 01:06:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:06:29] [INFO ] [Nat]Absence check using state equation in 2066 ms returned sat
[2022-05-16 01:06:30] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 323 ms.
[2022-05-16 01:06:31] [INFO ] Added : 40 causal constraints over 8 iterations in 2092 ms. Result :unknown
[2022-05-16 01:06:32] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 67 ms returned sat
[2022-05-16 01:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:06:34] [INFO ] [Real]Absence check using state equation in 1965 ms returned sat
[2022-05-16 01:06:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:06:35] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 01:06:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:06:37] [INFO ] [Nat]Absence check using state equation in 1845 ms returned sat
[2022-05-16 01:06:37] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 219 ms.
[2022-05-16 01:06:39] [INFO ] Added : 40 causal constraints over 8 iterations in 2310 ms. Result :unknown
[2022-05-16 01:06:40] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 108 ms returned sat
[2022-05-16 01:06:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:06:42] [INFO ] [Real]Absence check using state equation in 2211 ms returned sat
[2022-05-16 01:06:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:06:43] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 70 ms returned sat
[2022-05-16 01:06:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:06:46] [INFO ] [Nat]Absence check using state equation in 2133 ms returned sat
[2022-05-16 01:06:46] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 296 ms.
[2022-05-16 01:06:48] [INFO ] Added : 25 causal constraints over 5 iterations in 1917 ms. Result :unknown
[2022-05-16 01:06:48] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 01:06:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:06:51] [INFO ] [Real]Absence check using state equation in 2143 ms returned sat
[2022-05-16 01:06:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:06:52] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 01:06:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:06:54] [INFO ] [Nat]Absence check using state equation in 1981 ms returned sat
[2022-05-16 01:06:54] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 234 ms.
[2022-05-16 01:06:56] [INFO ] Added : 30 causal constraints over 6 iterations in 2121 ms. Result :unknown
[2022-05-16 01:06:57] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 01:06:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:06:59] [INFO ] [Real]Absence check using state equation in 2088 ms returned sat
[2022-05-16 01:06:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:06:59] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 107 ms returned sat
[2022-05-16 01:06:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:07:02] [INFO ] [Nat]Absence check using state equation in 2704 ms returned sat
[2022-05-16 01:07:03] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 246 ms.
[2022-05-16 01:07:04] [INFO ] Added : 20 causal constraints over 4 iterations in 1551 ms. Result :unknown
[2022-05-16 01:07:05] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 68 ms returned sat
[2022-05-16 01:07:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:07:07] [INFO ] [Real]Absence check using state equation in 2079 ms returned sat
[2022-05-16 01:07:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:07:08] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 104 ms returned sat
[2022-05-16 01:07:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:07:10] [INFO ] [Nat]Absence check using state equation in 2275 ms returned sat
[2022-05-16 01:07:10] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 196 ms.
[2022-05-16 01:07:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 01:07:13] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 111 ms returned sat
[2022-05-16 01:07:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:07:15] [INFO ] [Real]Absence check using state equation in 1888 ms returned sat
[2022-05-16 01:07:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:07:16] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2022-05-16 01:07:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:07:18] [INFO ] [Nat]Absence check using state equation in 2019 ms returned sat
[2022-05-16 01:07:18] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 283 ms.
[2022-05-16 01:07:20] [INFO ] Added : 25 causal constraints over 5 iterations in 2083 ms. Result :unknown
[2022-05-16 01:07:21] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 102 ms returned sat
[2022-05-16 01:07:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:07:23] [INFO ] [Real]Absence check using state equation in 1840 ms returned sat
[2022-05-16 01:07:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:07:24] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 106 ms returned sat
[2022-05-16 01:07:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:07:26] [INFO ] [Nat]Absence check using state equation in 1820 ms returned sat
[2022-05-16 01:07:26] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 237 ms.
[2022-05-16 01:07:28] [INFO ] Added : 30 causal constraints over 6 iterations in 2240 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CloudReconfiguration-PT-310-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 12 out of 2585 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2936 edges and 2585 vertex of which 871 / 2585 are part of one of the 63 SCC in 28 ms
Free SCC test removed 808 places
Drop transitions removed 986 transitions
Reduce isomorphic transitions removed 986 transitions.
Graph (complete) has 2389 edges and 1777 vertex of which 1763 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.25 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 1178 transitions
Trivial Post-agglo rules discarded 1178 transitions
Performed 1178 trivial Post agglomeration. Transition count delta: 1178
Iterating post reduction 0 with 1187 rules applied. Total rules applied 1189 place count 1763 transition count 913
Reduce places removed 1178 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 1316 rules applied. Total rules applied 2505 place count 585 transition count 775
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 69 rules applied. Total rules applied 2574 place count 523 transition count 768
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 2579 place count 521 transition count 765
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 2583 place count 519 transition count 763
Reduce places removed 1 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 5 with 9 rules applied. Total rules applied 2592 place count 518 transition count 755
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2600 place count 510 transition count 755
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 2600 place count 510 transition count 733
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 2644 place count 488 transition count 733
Discarding 77 places :
Symmetric choice reduction at 7 with 77 rule applications. Total rules 2721 place count 411 transition count 656
Iterating global reduction 7 with 77 rules applied. Total rules applied 2798 place count 411 transition count 656
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 2798 place count 411 transition count 647
Deduced a syphon composed of 9 places in 11 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 2816 place count 402 transition count 647
Discarding 58 places :
Symmetric choice reduction at 7 with 58 rule applications. Total rules 2874 place count 344 transition count 589
Iterating global reduction 7 with 58 rules applied. Total rules applied 2932 place count 344 transition count 589
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 7 with 30 rules applied. Total rules applied 2962 place count 344 transition count 559
Reduce places removed 15 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 25 rules applied. Total rules applied 2987 place count 329 transition count 549
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 2992 place count 324 transition count 549
Discarding 18 places :
Symmetric choice reduction at 10 with 18 rule applications. Total rules 3010 place count 306 transition count 522
Iterating global reduction 10 with 18 rules applied. Total rules applied 3028 place count 306 transition count 522
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 3035 place count 306 transition count 515
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 3044 place count 297 transition count 497
Iterating global reduction 11 with 9 rules applied. Total rules applied 3053 place count 297 transition count 497
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 3056 place count 294 transition count 491
Iterating global reduction 11 with 3 rules applied. Total rules applied 3059 place count 294 transition count 491
Performed 158 Post agglomeration using F-continuation condition with reduction of 86 identical transitions.
Deduced a syphon composed of 158 places in 0 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 11 with 316 rules applied. Total rules applied 3375 place count 136 transition count 247
Drop transitions removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 3379 place count 136 transition count 243
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 3385 place count 133 transition count 240
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3391 place count 133 transition count 234
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 3395 place count 131 transition count 232
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 3399 place count 131 transition count 228
Performed 33 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 14 with 66 rules applied. Total rules applied 3465 place count 98 transition count 260
Drop transitions removed 10 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 14 with 35 rules applied. Total rules applied 3500 place count 98 transition count 225
Discarding 21 places :
Symmetric choice reduction at 15 with 21 rule applications. Total rules 3521 place count 77 transition count 190
Iterating global reduction 15 with 21 rules applied. Total rules applied 3542 place count 77 transition count 190
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 15 with 9 rules applied. Total rules applied 3551 place count 77 transition count 181
Discarding 5 places :
Symmetric choice reduction at 16 with 5 rule applications. Total rules 3556 place count 72 transition count 171
Iterating global reduction 16 with 5 rules applied. Total rules applied 3561 place count 72 transition count 171
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 16 with 5 rules applied. Total rules applied 3566 place count 72 transition count 166
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 17 with 13 rules applied. Total rules applied 3579 place count 72 transition count 153
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 3580 place count 71 transition count 150
Iterating global reduction 17 with 1 rules applied. Total rules applied 3581 place count 71 transition count 150
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 3582 place count 70 transition count 149
Iterating global reduction 17 with 1 rules applied. Total rules applied 3583 place count 70 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 3584 place count 70 transition count 148
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 18 with 2 rules applied. Total rules applied 3586 place count 69 transition count 147
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 3587 place count 69 transition count 146
Free-agglomeration rule applied 4 times.
Iterating global reduction 18 with 4 rules applied. Total rules applied 3591 place count 69 transition count 142
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 3597 place count 65 transition count 140
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 3598 place count 65 transition count 139
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 3599 place count 64 transition count 138
Iterating global reduction 19 with 1 rules applied. Total rules applied 3600 place count 64 transition count 138
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 3602 place count 64 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 3603 place count 63 transition count 137
Applied a total of 3603 rules in 728 ms. Remains 63 /2585 variables (removed 2522) and now considering 137/3095 (removed 2958) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/2585 places, 137/3095 transitions.
Normalized transition count is 129 out of 137 initially.
// Phase 1: matrix 129 rows 63 cols
[2022-05-16 01:07:29] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 12743 resets, run finished after 1515 ms. (steps per millisecond=660 ) properties (out of 12) seen :12
FORMULA CloudReconfiguration-PT-310-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-310-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-310-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-310-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-310-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-310-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-310-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-310-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-310-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-310-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-310-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-310-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 110235 ms.

BK_STOP 1652663250926

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

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