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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
604.039 88570.00 103326.00 2070.40 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.3K Feb 25 11:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 11:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 11:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 11:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 11:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 11:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 11:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 124K Feb 25 11:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 661K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678232632610

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-318
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-07 23:43:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-07 23:43:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 23:43:54] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2023-03-07 23:43:54] [INFO ] Transformed 2587 places.
[2023-03-07 23:43:54] [INFO ] Transformed 3099 transitions.
[2023-03-07 23:43:54] [INFO ] Found NUPN structural information;
[2023-03-07 23:43:54] [INFO ] Parsed PT model containing 2587 places and 3099 transitions and 6479 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 3099 rows 2587 cols
[2023-03-07 23:43:54] [INFO ] Computed 4 place invariants in 66 ms
Incomplete random walk after 10000 steps, including 79 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :3
FORMULA CloudReconfiguration-PT-318-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :1
FORMULA CloudReconfiguration-PT-318-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
[2023-03-07 23:43:54] [INFO ] Invariant cache hit.
[2023-03-07 23:43:55] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-07 23:43:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:43:56] [INFO ] [Real]Absence check using state equation in 1214 ms returned sat
[2023-03-07 23:43:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:43:57] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 49 ms returned sat
[2023-03-07 23:43:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:43:59] [INFO ] [Nat]Absence check using state equation in 1248 ms returned sat
[2023-03-07 23:43:59] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 163 ms.
[2023-03-07 23:44:01] [INFO ] Added : 85 causal constraints over 17 iterations in 2599 ms. Result :unknown
[2023-03-07 23:44:02] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 37 ms returned sat
[2023-03-07 23:44:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:44:03] [INFO ] [Real]Absence check using state equation in 1143 ms returned sat
[2023-03-07 23:44:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:44:03] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 23:44:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:44:05] [INFO ] [Nat]Absence check using state equation in 1112 ms returned sat
[2023-03-07 23:44:05] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 153 ms.
[2023-03-07 23:44: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 1
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-07 23:44:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 23:44:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:44:10] [INFO ] [Real]Absence check using state equation in 1343 ms returned sat
[2023-03-07 23:44:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:44:10] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 23:44:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:44:12] [INFO ] [Nat]Absence check using state equation in 1650 ms returned sat
[2023-03-07 23:44:12] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 167 ms.
[2023-03-07 23:44:15] [INFO ] Added : 110 causal constraints over 22 iterations in 2891 ms. Result :unknown
[2023-03-07 23:44:15] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 23:44:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:44:16] [INFO ] [Real]Absence check using state equation in 1122 ms returned sat
[2023-03-07 23:44:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:44:17] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 23:44:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:44:18] [INFO ] [Nat]Absence check using state equation in 1144 ms returned sat
[2023-03-07 23:44:18] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 149 ms.
[2023-03-07 23:44:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-07 23:44:22] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 23:44:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:44:23] [INFO ] [Real]Absence check using state equation in 1235 ms returned sat
[2023-03-07 23:44:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:44:24] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-07 23:44:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:44:25] [INFO ] [Nat]Absence check using state equation in 1219 ms returned sat
[2023-03-07 23:44:25] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 136 ms.
[2023-03-07 23:44:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-07 23:44:29] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 23:44:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:44:30] [INFO ] [Real]Absence check using state equation in 1086 ms returned sat
[2023-03-07 23:44:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:44:30] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 23:44:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:44:31] [INFO ] [Nat]Absence check using state equation in 1164 ms returned sat
[2023-03-07 23:44:32] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 151 ms.
[2023-03-07 23:44:35] [INFO ] Added : 127 causal constraints over 26 iterations in 3389 ms. Result :unknown
[2023-03-07 23:44:35] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 23:44:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:44:37] [INFO ] [Real]Absence check using state equation in 1318 ms returned sat
[2023-03-07 23:44:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:44:37] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-07 23:44:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:44:39] [INFO ] [Nat]Absence check using state equation in 1361 ms returned sat
[2023-03-07 23:44:39] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 134 ms.
[2023-03-07 23:44:42] [INFO ] Added : 120 causal constraints over 24 iterations in 3173 ms. Result :unknown
[2023-03-07 23:44:42] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-07 23:44:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:44:43] [INFO ] [Real]Absence check using state equation in 1158 ms returned sat
[2023-03-07 23:44:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:44:44] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 23:44:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:44:45] [INFO ] [Nat]Absence check using state equation in 1201 ms returned sat
[2023-03-07 23:44:45] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 134 ms.
[2023-03-07 23:44:49] [INFO ] Added : 130 causal constraints over 26 iterations in 3291 ms. Result :unknown
[2023-03-07 23:44:49] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 23:44:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:44:50] [INFO ] [Real]Absence check using state equation in 1126 ms returned sat
[2023-03-07 23:44:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:44:51] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 39 ms returned sat
[2023-03-07 23:44:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:44:52] [INFO ] [Nat]Absence check using state equation in 1092 ms returned sat
[2023-03-07 23:44:52] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 144 ms.
[2023-03-07 23:44:55] [INFO ] Added : 130 causal constraints over 26 iterations in 3471 ms. Result :unknown
[2023-03-07 23:44:56] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 46 ms returned sat
[2023-03-07 23:44:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:44:57] [INFO ] [Real]Absence check using state equation in 1151 ms returned sat
[2023-03-07 23:44:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:44:57] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 23:44:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:44:58] [INFO ] [Nat]Absence check using state equation in 1191 ms returned sat
[2023-03-07 23:44:59] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 135 ms.
[2023-03-07 23:45:02] [INFO ] Added : 135 causal constraints over 27 iterations in 3351 ms. Result :unknown
[2023-03-07 23:45:02] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 38 ms returned sat
[2023-03-07 23:45:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:45:03] [INFO ] [Real]Absence check using state equation in 1086 ms returned sat
[2023-03-07 23:45:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:45:04] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-07 23:45:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:45:05] [INFO ] [Nat]Absence check using state equation in 1084 ms returned sat
[2023-03-07 23:45:05] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 162 ms.
[2023-03-07 23:45:09] [INFO ] Added : 125 causal constraints over 25 iterations in 3490 ms. Result :unknown
[2023-03-07 23:45:09] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-07 23:45:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 23:45:10] [INFO ] [Real]Absence check using state equation in 1175 ms returned sat
[2023-03-07 23:45:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 23:45:11] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 45 ms returned sat
[2023-03-07 23:45:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 23:45:12] [INFO ] [Nat]Absence check using state equation in 1151 ms returned sat
[2023-03-07 23:45:12] [INFO ] Computed and/alt/rep : 3090/3829/3090 causal constraints (skipped 8 transitions) in 134 ms.
[2023-03-07 23:45:15] [INFO ] Added : 130 causal constraints over 26 iterations in 3430 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [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]
FORMULA CloudReconfiguration-PT-318-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 10 out of 2587 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2587/2587 places, 3099/3099 transitions.
Graph (trivial) has 2936 edges and 2587 vertex of which 845 / 2587 are part of one of the 61 SCC in 12 ms
Free SCC test removed 784 places
Drop transitions removed 954 transitions
Reduce isomorphic transitions removed 954 transitions.
Graph (complete) has 2431 edges and 1803 vertex of which 1789 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.4 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 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1207 rules applied. Total rules applied 1209 place count 1789 transition count 929
Reduce places removed 1198 places and 0 transitions.
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 1 with 1343 rules applied. Total rules applied 2552 place count 591 transition count 784
Reduce places removed 67 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 78 rules applied. Total rules applied 2630 place count 524 transition count 773
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 12 rules applied. Total rules applied 2642 place count 520 transition count 765
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 10 rules applied. Total rules applied 2652 place count 515 transition count 760
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 5 with 7 rules applied. Total rules applied 2659 place count 513 transition count 755
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 2664 place count 508 transition count 755
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 24 Pre rules applied. Total rules applied 2664 place count 508 transition count 731
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 7 with 48 rules applied. Total rules applied 2712 place count 484 transition count 731
Discarding 77 places :
Symmetric choice reduction at 7 with 77 rule applications. Total rules 2789 place count 407 transition count 654
Iterating global reduction 7 with 77 rules applied. Total rules applied 2866 place count 407 transition count 654
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2868 place count 407 transition count 652
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2869 place count 406 transition count 652
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 9 Pre rules applied. Total rules applied 2869 place count 406 transition count 643
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 2887 place count 397 transition count 643
Discarding 59 places :
Symmetric choice reduction at 9 with 59 rule applications. Total rules 2946 place count 338 transition count 584
Iterating global reduction 9 with 59 rules applied. Total rules applied 3005 place count 338 transition count 584
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 9 with 36 rules applied. Total rules applied 3041 place count 338 transition count 548
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 10 with 30 rules applied. Total rules applied 3071 place count 320 transition count 536
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 3077 place count 314 transition count 536
Discarding 20 places :
Symmetric choice reduction at 12 with 20 rule applications. Total rules 3097 place count 294 transition count 505
Iterating global reduction 12 with 20 rules applied. Total rules applied 3117 place count 294 transition count 505
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 3126 place count 294 transition count 496
Discarding 8 places :
Symmetric choice reduction at 13 with 8 rule applications. Total rules 3134 place count 286 transition count 480
Iterating global reduction 13 with 8 rules applied. Total rules applied 3142 place count 286 transition count 480
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 3145 place count 283 transition count 474
Iterating global reduction 13 with 3 rules applied. Total rules applied 3148 place count 283 transition count 474
Performed 147 Post agglomeration using F-continuation condition with reduction of 77 identical transitions.
Deduced a syphon composed of 147 places in 0 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 13 with 294 rules applied. Total rules applied 3442 place count 136 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 3443 place count 136 transition count 249
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 3447 place count 134 transition count 247
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 3451 place count 134 transition count 243
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 3455 place count 132 transition count 241
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 3459 place count 132 transition count 237
Performed 35 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 16 with 70 rules applied. Total rules applied 3529 place count 97 transition count 280
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 16 with 32 rules applied. Total rules applied 3561 place count 97 transition count 248
Discarding 19 places :
Symmetric choice reduction at 17 with 19 rule applications. Total rules 3580 place count 78 transition count 210
Iterating global reduction 17 with 19 rules applied. Total rules applied 3599 place count 78 transition count 210
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 17 with 9 rules applied. Total rules applied 3608 place count 78 transition count 201
Discarding 5 places :
Symmetric choice reduction at 18 with 5 rule applications. Total rules 3613 place count 73 transition count 191
Iterating global reduction 18 with 5 rules applied. Total rules applied 3618 place count 73 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 3621 place count 73 transition count 188
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 19 with 9 rules applied. Total rules applied 3630 place count 73 transition count 179
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 3631 place count 72 transition count 178
Iterating global reduction 19 with 1 rules applied. Total rules applied 3632 place count 72 transition count 178
Free-agglomeration rule applied 4 times.
Iterating global reduction 19 with 4 rules applied. Total rules applied 3636 place count 72 transition count 174
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 3642 place count 68 transition count 172
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 20 with 4 rules applied. Total rules applied 3646 place count 68 transition count 172
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 3648 place count 68 transition count 170
Discarding 2 places :
Symmetric choice reduction at 20 with 2 rule applications. Total rules 3650 place count 66 transition count 168
Iterating global reduction 20 with 2 rules applied. Total rules applied 3652 place count 66 transition count 168
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 20 with 1 rules applied. Total rules applied 3653 place count 65 transition count 167
Applied a total of 3653 rules in 256 ms. Remains 65 /2587 variables (removed 2522) and now considering 167/3099 (removed 2932) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 257 ms. Remains : 65/2587 places, 167/3099 transitions.
Normalized transition count is 153 out of 167 initially.
// Phase 1: matrix 153 rows 65 cols
[2023-03-07 23:45:16] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 8026 resets, run finished after 1088 ms. (steps per millisecond=919 ) properties (out of 10) seen :10
FORMULA CloudReconfiguration-PT-318-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-318-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 83266 ms.

BK_STOP 1678232721180

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-318"
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-5348"
echo " Executing tool itstools"
echo " Input is CloudReconfiguration-PT-318, 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 r101-tall-167814475000141"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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