About the Execution of LTSMin+red for CloudReconfiguration-PT-305
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
680.844 | 110886.00 | 128350.00 | 301.70 | 1 1 1 0 1 1 1 1 1 1 0 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/mcc2024-input.r480-tall-171624188700149.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CloudReconfiguration-PT-305, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624188700149
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Apr 11 19:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 11 19:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 19:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 19:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 660K May 18 16:42 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-305-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-305-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717179579955
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-305
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:19:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 18:19:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:19:41] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2024-05-31 18:19:41] [INFO ] Transformed 2585 places.
[2024-05-31 18:19:41] [INFO ] Transformed 3095 transitions.
[2024-05-31 18:19:41] [INFO ] Found NUPN structural information;
[2024-05-31 18:19:41] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 298 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 3095 rows 2585 cols
[2024-05-31 18:19:41] [INFO ] Computed 4 invariants in 55 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (83 resets) in 71 ms. (138 steps per ms)
FORMULA CloudReconfiguration-PT-305-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130011 steps (313 resets) in 256 ms. (505 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-31 18:19:42] [INFO ] Invariant cache hit.
[2024-05-31 18:19:43] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 51 ms returned sat
[2024-05-31 18:19:44] [INFO ] [Real]Absence check using state equation in 1360 ms returned sat
[2024-05-31 18:19:44] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 192 ms.
[2024-05-31 18:19:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:19:46] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 54 ms returned sat
[2024-05-31 18:19:47] [INFO ] [Nat]Absence check using state equation in 1334 ms returned sat
[2024-05-31 18:19:48] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 214 ms.
[2024-05-31 18:19:50] [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 0
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 18:19:51] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 62 ms returned sat
[2024-05-31 18:19:52] [INFO ] [Real]Absence check using state equation in 1225 ms returned sat
[2024-05-31 18:19:52] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 179 ms.
[2024-05-31 18:19:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:19:54] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 50 ms returned sat
[2024-05-31 18:19:55] [INFO ] [Nat]Absence check using state equation in 1404 ms returned sat
[2024-05-31 18:19:56] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 196 ms.
[2024-05-31 18:19:58] [INFO ] Added : 115 causal constraints over 23 iterations in 2995 ms. Result :unknown
[2024-05-31 18:19:59] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 49 ms returned sat
[2024-05-31 18:20:00] [INFO ] [Real]Absence check using state equation in 1136 ms returned sat
[2024-05-31 18:20:00] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 193 ms.
[2024-05-31 18:20:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:20:02] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 55 ms returned sat
[2024-05-31 18:20:03] [INFO ] [Nat]Absence check using state equation in 1128 ms returned sat
[2024-05-31 18:20:03] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 186 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2024-05-31 18:20:07] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 69 ms returned sat
[2024-05-31 18:20:08] [INFO ] [Real]Absence check using state equation in 1042 ms returned sat
[2024-05-31 18:20:08] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 181 ms.
[2024-05-31 18:20:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:20:09] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 53 ms returned sat
[2024-05-31 18:20:11] [INFO ] [Nat]Absence check using state equation in 1204 ms returned sat
[2024-05-31 18:20:11] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 197 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-31 18:20:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 48 ms returned sat
[2024-05-31 18:20:16] [INFO ] [Real]Absence check using state equation in 1344 ms returned sat
[2024-05-31 18:20:16] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 197 ms.
[2024-05-31 18:20:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:20:18] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 52 ms returned sat
[2024-05-31 18:20:19] [INFO ] [Nat]Absence check using state equation in 1353 ms returned sat
[2024-05-31 18:20:19] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 186 ms.
[2024-05-31 18:20: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 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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 18:20:23] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2024-05-31 18:20:24] [INFO ] [Real]Absence check using state equation in 1105 ms returned sat
[2024-05-31 18:20:24] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 180 ms.
[2024-05-31 18:20:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:20:25] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 51 ms returned sat
[2024-05-31 18:20:26] [INFO ] [Nat]Absence check using state equation in 1161 ms returned sat
[2024-05-31 18:20:27] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 191 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-31 18:20:30] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 48 ms returned sat
[2024-05-31 18:20:32] [INFO ] [Real]Absence check using state equation in 1226 ms returned sat
[2024-05-31 18:20:32] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 191 ms.
[2024-05-31 18:20:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:20:33] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 49 ms returned sat
[2024-05-31 18:20:34] [INFO ] [Nat]Absence check using state equation in 1135 ms returned sat
[2024-05-31 18:20:35] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 128 ms.
[2024-05-31 18:20:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 18:20:38] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 49 ms returned sat
[2024-05-31 18:20:39] [INFO ] [Real]Absence check using state equation in 1121 ms returned sat
[2024-05-31 18:20:40] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 179 ms.
[2024-05-31 18:20:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:20:41] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 49 ms returned sat
[2024-05-31 18:20:42] [INFO ] [Nat]Absence check using state equation in 1122 ms returned sat
[2024-05-31 18:20:43] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 180 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-31 18:20:46] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 48 ms returned sat
[2024-05-31 18:20:47] [INFO ] [Real]Absence check using state equation in 1314 ms returned sat
[2024-05-31 18:20:48] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 176 ms.
[2024-05-31 18:20:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:20:49] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 49 ms returned sat
[2024-05-31 18:20:50] [INFO ] [Nat]Absence check using state equation in 1294 ms returned sat
[2024-05-31 18:20:51] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 135 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-31 18:20:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 48 ms returned sat
[2024-05-31 18:20:55] [INFO ] [Real]Absence check using state equation in 1100 ms returned sat
[2024-05-31 18:20:56] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 135 ms.
[2024-05-31 18:20:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:20:57] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 53 ms returned sat
[2024-05-31 18:20:58] [INFO ] [Nat]Absence check using state equation in 1123 ms returned sat
[2024-05-31 18:20:58] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 172 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-31 18:21:02] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2024-05-31 18:21:03] [INFO ] [Real]Absence check using state equation in 1156 ms returned sat
[2024-05-31 18:21:03] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 178 ms.
[2024-05-31 18:21:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:21:05] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 50 ms returned sat
[2024-05-31 18:21:06] [INFO ] [Nat]Absence check using state equation in 1147 ms returned sat
[2024-05-31 18:21:06] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 171 ms.
Maximisation of solution failed !
Minimization took 5 ms.
[2024-05-31 18:21:10] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 49 ms returned sat
[2024-05-31 18:21:11] [INFO ] [Real]Absence check using state equation in 1238 ms returned sat
[2024-05-31 18:21:11] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 189 ms.
[2024-05-31 18:21:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:21:13] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 54 ms returned sat
[2024-05-31 18:21:14] [INFO ] [Nat]Absence check using state equation in 1246 ms returned sat
[2024-05-31 18:21:14] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 177 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-31 18:21:18] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 49 ms returned sat
[2024-05-31 18:21:19] [INFO ] [Real]Absence check using state equation in 1312 ms returned sat
[2024-05-31 18:21:19] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 176 ms.
[2024-05-31 18:21:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:21:21] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 49 ms returned sat
[2024-05-31 18:21:22] [INFO ] [Nat]Absence check using state equation in 1266 ms returned sat
[2024-05-31 18:21:22] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 167 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 13 out of 2585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2928 edges and 2585 vertex of which 862 / 2585 are part of one of the 62 SCC in 12 ms
Free SCC test removed 800 places
Drop transitions (Empty/Sink Transition effects.) removed 976 transitions
Reduce isomorphic transitions removed 976 transitions.
Graph (complete) has 2399 edges and 1785 vertex of which 1771 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.5 ms
Discarding 14 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 1771 transition count 923
Reduce places removed 1178 places and 0 transitions.
Ensure Unique test removed 73 transitions
Reduce isomorphic transitions removed 73 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 1 with 1315 rules applied. Total rules applied 2504 place count 593 transition count 786
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 71 rules applied. Total rules applied 2575 place count 529 transition count 779
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 2580 place count 527 transition count 776
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 4 with 11 rules applied. Total rules applied 2591 place count 525 transition count 767
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 10 rules applied. Total rules applied 2601 place count 517 transition count 765
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2602 place count 516 transition count 765
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 23 Pre rules applied. Total rules applied 2602 place count 516 transition count 742
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 7 with 46 rules applied. Total rules applied 2648 place count 493 transition count 742
Discarding 79 places :
Symmetric choice reduction at 7 with 79 rule applications. Total rules 2727 place count 414 transition count 663
Iterating global reduction 7 with 79 rules applied. Total rules applied 2806 place count 414 transition count 663
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 2809 place count 414 transition count 660
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2810 place count 413 transition count 660
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 9 Pre rules applied. Total rules applied 2810 place count 413 transition count 651
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 2828 place count 404 transition count 651
Discarding 59 places :
Symmetric choice reduction at 9 with 59 rule applications. Total rules 2887 place count 345 transition count 592
Iterating global reduction 9 with 59 rules applied. Total rules applied 2946 place count 345 transition count 592
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 32 rules applied. Total rules applied 2978 place count 345 transition count 560
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 10 with 26 rules applied. Total rules applied 3004 place count 329 transition count 550
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 3009 place count 324 transition count 550
Discarding 21 places :
Symmetric choice reduction at 12 with 21 rule applications. Total rules 3030 place count 303 transition count 517
Iterating global reduction 12 with 21 rules applied. Total rules applied 3051 place count 303 transition count 517
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 3060 place count 303 transition count 508
Discarding 8 places :
Symmetric choice reduction at 13 with 8 rule applications. Total rules 3068 place count 295 transition count 492
Iterating global reduction 13 with 8 rules applied. Total rules applied 3076 place count 295 transition count 492
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 3079 place count 292 transition count 486
Iterating global reduction 13 with 3 rules applied. Total rules applied 3082 place count 292 transition count 486
Performed 152 Post agglomeration using F-continuation condition with reduction of 82 identical transitions.
Deduced a syphon composed of 152 places in 0 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 13 with 304 rules applied. Total rules applied 3386 place count 140 transition count 252
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 3388 place count 140 transition count 250
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 3394 place count 137 transition count 247
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 3400 place count 137 transition count 241
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 3404 place count 135 transition count 239
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 3408 place count 135 transition count 235
Performed 35 Post agglomeration using F-continuation condition with reduction of 14 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 3478 place count 100 transition count 263
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 16 with 30 rules applied. Total rules applied 3508 place count 100 transition count 233
Discarding 19 places :
Symmetric choice reduction at 17 with 19 rule applications. Total rules 3527 place count 81 transition count 195
Iterating global reduction 17 with 19 rules applied. Total rules applied 3546 place count 81 transition count 195
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 17 with 11 rules applied. Total rules applied 3557 place count 81 transition count 184
Discarding 5 places :
Symmetric choice reduction at 18 with 5 rule applications. Total rules 3562 place count 76 transition count 174
Iterating global reduction 18 with 5 rules applied. Total rules applied 3567 place count 76 transition count 174
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 18 with 5 rules applied. Total rules applied 3572 place count 76 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 3573 place count 76 transition count 168
Free-agglomeration rule applied 7 times.
Iterating global reduction 19 with 7 rules applied. Total rules applied 3580 place count 76 transition count 161
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 19 with 10 rules applied. Total rules applied 3590 place count 69 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 20 with 3 rules applied. Total rules applied 3593 place count 69 transition count 155
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 20 with 3 rules applied. Total rules applied 3596 place count 69 transition count 155
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 20 with 1 rules applied. Total rules applied 3597 place count 68 transition count 154
Applied a total of 3597 rules in 290 ms. Remains 68 /2585 variables (removed 2517) and now considering 154/3095 (removed 2941) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 301 ms. Remains : 68/2585 places, 154/3095 transitions.
[2024-05-31 18:21:26] [INFO ] Flow matrix only has 144 transitions (discarded 10 similar events)
// Phase 1: matrix 144 rows 68 cols
[2024-05-31 18:21:26] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA CloudReconfiguration-PT-305-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (14574 resets) in 2442 ms. (409 steps per ms)
FORMULA CloudReconfiguration-PT-305-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000002 steps (8636 resets) in 1615 ms. (1237 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-31 18:21:30] [INFO ] Flow matrix only has 144 transitions (discarded 10 similar events)
[2024-05-31 18:21:30] [INFO ] Invariant cache hit.
[2024-05-31 18:21:30] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-31 18:21:30] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-31 18:21:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 18:21:30] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-05-31 18:21:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:21:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 18:21:30] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-31 18:21:30] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-05-31 18:21:30] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 6 ms to minimize.
[2024-05-31 18:21:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2024-05-31 18:21:30] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-31 18:21:30] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 18:21:30] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2024-05-31 18:21:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 18:21:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-31 18:21:30] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 18:21:30] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2024-05-31 18:21:30] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 2 ms to minimize.
[2024-05-31 18:21:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[0, 0]
FORMULA CloudReconfiguration-PT-305-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CloudReconfiguration-PT-305-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 109455 ms.
ITS solved all properties within timeout
BK_STOP 1717179690841
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
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-305"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is CloudReconfiguration-PT-305, 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 r480-tall-171624188700149"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudReconfiguration-PT-305.tgz
mv CloudReconfiguration-PT-305 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 '
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 ;