Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r427-tajo-167905979500302.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldRVt-PT-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r427-tajo-167905979500302
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 8.4K Feb 25 23:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 23:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 23:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 23:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 23:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 23:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 25 23:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 364K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679383822544

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-030B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 07:30:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 07:30:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 07:30:24] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2023-03-21 07:30:24] [INFO ] Transformed 1503 places.
[2023-03-21 07:30:24] [INFO ] Transformed 1503 transitions.
[2023-03-21 07:30:24] [INFO ] Found NUPN structural information;
[2023-03-21 07:30:24] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 227 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 549 ms. (steps per millisecond=18 ) properties (out of 15) seen :8
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1503 rows 1503 cols
[2023-03-21 07:30:25] [INFO ] Computed 121 place invariants in 20 ms
[2023-03-21 07:30:25] [INFO ] After 573ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 07:30:26] [INFO ] [Nat]Absence check using 121 positive place invariants in 41 ms returned sat
[2023-03-21 07:30:28] [INFO ] After 2287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 07:30:29] [INFO ] Deduced a trap composed of 34 places in 522 ms of which 10 ms to minimize.
[2023-03-21 07:30:30] [INFO ] Deduced a trap composed of 31 places in 492 ms of which 2 ms to minimize.
[2023-03-21 07:30:30] [INFO ] Deduced a trap composed of 32 places in 495 ms of which 2 ms to minimize.
[2023-03-21 07:30:31] [INFO ] Deduced a trap composed of 36 places in 442 ms of which 2 ms to minimize.
[2023-03-21 07:30:31] [INFO ] Deduced a trap composed of 35 places in 449 ms of which 3 ms to minimize.
[2023-03-21 07:30:32] [INFO ] Deduced a trap composed of 20 places in 405 ms of which 2 ms to minimize.
[2023-03-21 07:30:32] [INFO ] Deduced a trap composed of 50 places in 411 ms of which 1 ms to minimize.
[2023-03-21 07:30:33] [INFO ] Deduced a trap composed of 33 places in 397 ms of which 1 ms to minimize.
[2023-03-21 07:30:33] [INFO ] Deduced a trap composed of 51 places in 367 ms of which 1 ms to minimize.
[2023-03-21 07:30:33] [INFO ] Deduced a trap composed of 39 places in 395 ms of which 1 ms to minimize.
[2023-03-21 07:30:34] [INFO ] Deduced a trap composed of 51 places in 316 ms of which 1 ms to minimize.
[2023-03-21 07:30:34] [INFO ] Deduced a trap composed of 44 places in 338 ms of which 1 ms to minimize.
[2023-03-21 07:30:35] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 1 ms to minimize.
[2023-03-21 07:30:35] [INFO ] Deduced a trap composed of 30 places in 286 ms of which 1 ms to minimize.
[2023-03-21 07:30:35] [INFO ] Deduced a trap composed of 46 places in 300 ms of which 2 ms to minimize.
[2023-03-21 07:30:36] [INFO ] Deduced a trap composed of 54 places in 271 ms of which 1 ms to minimize.
[2023-03-21 07:30:36] [INFO ] Deduced a trap composed of 56 places in 300 ms of which 1 ms to minimize.
[2023-03-21 07:30:36] [INFO ] Deduced a trap composed of 37 places in 247 ms of which 1 ms to minimize.
[2023-03-21 07:30:37] [INFO ] Deduced a trap composed of 59 places in 289 ms of which 1 ms to minimize.
[2023-03-21 07:30:37] [INFO ] Deduced a trap composed of 47 places in 317 ms of which 1 ms to minimize.
[2023-03-21 07:30:37] [INFO ] Deduced a trap composed of 51 places in 309 ms of which 1 ms to minimize.
[2023-03-21 07:30:38] [INFO ] Deduced a trap composed of 68 places in 297 ms of which 2 ms to minimize.
[2023-03-21 07:30:38] [INFO ] Deduced a trap composed of 49 places in 500 ms of which 1 ms to minimize.
[2023-03-21 07:30:39] [INFO ] Deduced a trap composed of 45 places in 298 ms of which 2 ms to minimize.
[2023-03-21 07:30:39] [INFO ] Deduced a trap composed of 45 places in 270 ms of which 1 ms to minimize.
[2023-03-21 07:30:39] [INFO ] Deduced a trap composed of 31 places in 272 ms of which 0 ms to minimize.
[2023-03-21 07:30:40] [INFO ] Deduced a trap composed of 42 places in 263 ms of which 1 ms to minimize.
[2023-03-21 07:30:40] [INFO ] Deduced a trap composed of 45 places in 261 ms of which 1 ms to minimize.
[2023-03-21 07:30:40] [INFO ] Deduced a trap composed of 45 places in 257 ms of which 1 ms to minimize.
[2023-03-21 07:30:41] [INFO ] Deduced a trap composed of 35 places in 260 ms of which 1 ms to minimize.
[2023-03-21 07:30:41] [INFO ] Deduced a trap composed of 33 places in 251 ms of which 1 ms to minimize.
[2023-03-21 07:30:41] [INFO ] Deduced a trap composed of 25 places in 254 ms of which 1 ms to minimize.
[2023-03-21 07:30:41] [INFO ] Deduced a trap composed of 56 places in 196 ms of which 1 ms to minimize.
[2023-03-21 07:30:42] [INFO ] Deduced a trap composed of 43 places in 204 ms of which 1 ms to minimize.
[2023-03-21 07:30:42] [INFO ] Deduced a trap composed of 43 places in 225 ms of which 1 ms to minimize.
[2023-03-21 07:30:42] [INFO ] Deduced a trap composed of 39 places in 247 ms of which 0 ms to minimize.
[2023-03-21 07:30:43] [INFO ] Deduced a trap composed of 42 places in 251 ms of which 1 ms to minimize.
[2023-03-21 07:30:43] [INFO ] Deduced a trap composed of 48 places in 232 ms of which 1 ms to minimize.
[2023-03-21 07:30:43] [INFO ] Deduced a trap composed of 50 places in 216 ms of which 1 ms to minimize.
[2023-03-21 07:30:44] [INFO ] Deduced a trap composed of 44 places in 314 ms of which 1 ms to minimize.
[2023-03-21 07:30:44] [INFO ] Deduced a trap composed of 58 places in 270 ms of which 1 ms to minimize.
[2023-03-21 07:30:44] [INFO ] Deduced a trap composed of 51 places in 230 ms of which 1 ms to minimize.
[2023-03-21 07:30:44] [INFO ] Deduced a trap composed of 55 places in 263 ms of which 1 ms to minimize.
[2023-03-21 07:30:45] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 0 ms to minimize.
[2023-03-21 07:30:45] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 1 ms to minimize.
[2023-03-21 07:30:45] [INFO ] Deduced a trap composed of 59 places in 177 ms of which 1 ms to minimize.
[2023-03-21 07:30:46] [INFO ] Deduced a trap composed of 55 places in 189 ms of which 0 ms to minimize.
[2023-03-21 07:30:46] [INFO ] Deduced a trap composed of 53 places in 178 ms of which 1 ms to minimize.
[2023-03-21 07:30:46] [INFO ] Deduced a trap composed of 51 places in 183 ms of which 1 ms to minimize.
[2023-03-21 07:30:46] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 17730 ms
[2023-03-21 07:30:47] [INFO ] Deduced a trap composed of 45 places in 158 ms of which 0 ms to minimize.
[2023-03-21 07:30:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
[2023-03-21 07:30:47] [INFO ] Deduced a trap composed of 29 places in 230 ms of which 1 ms to minimize.
[2023-03-21 07:30:47] [INFO ] Deduced a trap composed of 40 places in 220 ms of which 1 ms to minimize.
[2023-03-21 07:30:48] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 0 ms to minimize.
[2023-03-21 07:30:48] [INFO ] Deduced a trap composed of 52 places in 209 ms of which 1 ms to minimize.
[2023-03-21 07:30:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1253 ms
[2023-03-21 07:30:49] [INFO ] Deduced a trap composed of 42 places in 402 ms of which 1 ms to minimize.
[2023-03-21 07:30:49] [INFO ] Deduced a trap composed of 45 places in 321 ms of which 12 ms to minimize.
[2023-03-21 07:30:49] [INFO ] Deduced a trap composed of 40 places in 224 ms of which 0 ms to minimize.
[2023-03-21 07:30:50] [INFO ] Deduced a trap composed of 28 places in 244 ms of which 0 ms to minimize.
[2023-03-21 07:30:50] [INFO ] Deduced a trap composed of 43 places in 229 ms of which 0 ms to minimize.
[2023-03-21 07:30:50] [INFO ] Deduced a trap composed of 46 places in 211 ms of which 1 ms to minimize.
[2023-03-21 07:30:51] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
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-21 07:30:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 07:30:51] [INFO ] After 25110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 274 ms.
Support contains 43 out of 1503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Drop transitions removed 450 transitions
Trivial Post-agglo rules discarded 450 transitions
Performed 450 trivial Post agglomeration. Transition count delta: 450
Iterating post reduction 0 with 450 rules applied. Total rules applied 450 place count 1503 transition count 1053
Reduce places removed 450 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 452 rules applied. Total rules applied 902 place count 1053 transition count 1051
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 7 rules applied. Total rules applied 909 place count 1052 transition count 1045
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 915 place count 1046 transition count 1045
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 121 Pre rules applied. Total rules applied 915 place count 1046 transition count 924
Deduced a syphon composed of 121 places in 2 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 4 with 242 rules applied. Total rules applied 1157 place count 925 transition count 924
Discarding 197 places :
Symmetric choice reduction at 4 with 197 rule applications. Total rules 1354 place count 728 transition count 727
Iterating global reduction 4 with 197 rules applied. Total rules applied 1551 place count 728 transition count 727
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 80 Pre rules applied. Total rules applied 1551 place count 728 transition count 647
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 4 with 160 rules applied. Total rules applied 1711 place count 648 transition count 647
Performed 258 Post agglomeration using F-continuation condition.Transition count delta: 258
Deduced a syphon composed of 258 places in 1 ms
Reduce places removed 258 places and 0 transitions.
Iterating global reduction 4 with 516 rules applied. Total rules applied 2227 place count 390 transition count 389
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: -71
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 2393 place count 307 transition count 460
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2394 place count 307 transition count 459
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 2399 place count 307 transition count 454
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 2404 place count 302 transition count 454
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 2408 place count 302 transition count 450
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2409 place count 302 transition count 450
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2410 place count 301 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2411 place count 300 transition count 449
Applied a total of 2411 rules in 388 ms. Remains 300 /1503 variables (removed 1203) and now considering 449/1503 (removed 1054) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 388 ms. Remains : 300/1503 places, 449/1503 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 7) seen :3
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 449 rows 300 cols
[2023-03-21 07:30:52] [INFO ] Computed 120 place invariants in 9 ms
[2023-03-21 07:30:52] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 07:30:52] [INFO ] [Nat]Absence check using 120 positive place invariants in 33 ms returned sat
[2023-03-21 07:30:52] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 07:30:52] [INFO ] State equation strengthened by 167 read => feed constraints.
[2023-03-21 07:30:52] [INFO ] After 310ms SMT Verify possible using 167 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 07:30:53] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2023-03-21 07:30:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-03-21 07:30:53] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2023-03-21 07:30:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-21 07:30:53] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
[2023-03-21 07:30:53] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2023-03-21 07:30:53] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2023-03-21 07:30:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 253 ms
[2023-03-21 07:30:53] [INFO ] After 1026ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 231 ms.
[2023-03-21 07:30:53] [INFO ] After 1595ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 59 ms.
Support contains 26 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 449/449 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 0 with 5 rules applied. Total rules applied 5 place count 300 transition count 444
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 295 transition count 444
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 10 place count 295 transition count 438
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 22 place count 289 transition count 438
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 36 place count 282 transition count 431
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 48 place count 276 transition count 435
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 276 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 275 transition count 434
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 275 transition count 434
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 274 transition count 433
Applied a total of 52 rules in 109 ms. Remains 274 /300 variables (removed 26) and now considering 433/449 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 274/300 places, 433/449 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 205503 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 205503 steps, saw 145342 distinct states, run finished after 3002 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 433 rows 274 cols
[2023-03-21 07:30:57] [INFO ] Computed 120 place invariants in 2 ms
[2023-03-21 07:30:57] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 07:30:57] [INFO ] [Nat]Absence check using 120 positive place invariants in 14 ms returned sat
[2023-03-21 07:30:57] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 07:30:57] [INFO ] State equation strengthened by 163 read => feed constraints.
[2023-03-21 07:30:58] [INFO ] After 233ms SMT Verify possible using 163 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 07:30:58] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 14 ms to minimize.
[2023-03-21 07:30:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-03-21 07:30:58] [INFO ] After 566ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 232 ms.
[2023-03-21 07:30:58] [INFO ] After 1059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 44 ms.
Support contains 26 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 433/433 transitions.
Applied a total of 0 rules in 13 ms. Remains 274 /274 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 274/274 places, 433/433 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 433/433 transitions.
Applied a total of 0 rules in 13 ms. Remains 274 /274 variables (removed 0) and now considering 433/433 (removed 0) transitions.
[2023-03-21 07:30:58] [INFO ] Invariant cache hit.
[2023-03-21 07:30:59] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-03-21 07:30:59] [INFO ] Invariant cache hit.
[2023-03-21 07:30:59] [INFO ] State equation strengthened by 163 read => feed constraints.
[2023-03-21 07:30:59] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 924 ms to find 0 implicit places.
[2023-03-21 07:30:59] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-21 07:30:59] [INFO ] Invariant cache hit.
[2023-03-21 07:31:00] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1163 ms. Remains : 274/274 places, 433/433 transitions.
Graph (trivial) has 97 edges and 274 vertex of which 4 / 274 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 948 edges and 272 vertex of which 270 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 94 edges and 268 vertex of which 4 / 268 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 266 transition count 424
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 93 edges and 264 vertex of which 6 / 264 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 261 transition count 415
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 91 edges and 258 vertex of which 8 / 258 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 254 transition count 404
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 87 edges and 250 vertex of which 8 / 250 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 246 transition count 390
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 83 edges and 242 vertex of which 6 / 242 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 239 transition count 376
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 80 edges and 236 vertex of which 6 / 236 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 5 with 16 rules applied. Total rules applied 89 place count 233 transition count 364
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 78 edges and 230 vertex of which 6 / 230 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 6 with 15 rules applied. Total rules applied 104 place count 227 transition count 353
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 74 edges and 225 vertex of which 2 / 225 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 7 with 13 rules applied. Total rules applied 117 place count 224 transition count 343
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 73 edges and 223 vertex of which 2 / 223 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 8 with 5 rules applied. Total rules applied 122 place count 222 transition count 340
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 760 edges and 221 vertex of which 218 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 9 with 6 rules applied. Total rules applied 128 place count 218 transition count 333
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 128 place count 218 transition count 331
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 5 rules applied. Total rules applied 133 place count 215 transition count 331
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 136 place count 213 transition count 330
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 139 place count 213 transition count 327
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 11 with 9 rules applied. Total rules applied 148 place count 213 transition count 318
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 11 with 17 rules applied. Total rules applied 165 place count 213 transition count 318
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 11 with 13 rules applied. Total rules applied 178 place count 213 transition count 305
Applied a total of 178 rules in 54 ms. Remains 213 /274 variables (removed 61) and now considering 305/433 (removed 128) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 305 rows 213 cols
[2023-03-21 07:31:00] [INFO ] Computed 90 place invariants in 2 ms
[2023-03-21 07:31:00] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 07:31:00] [INFO ] [Nat]Absence check using 90 positive place invariants in 11 ms returned sat
[2023-03-21 07:31:00] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 07:31:00] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2023-03-21 07:31:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-21 07:31:00] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2023-03-21 07:31:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-21 07:31:00] [INFO ] After 320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-21 07:31:00] [INFO ] After 480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-21 07:31:00] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-21 07:31:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 274 places, 433 transitions and 2367 arcs took 5 ms.
[2023-03-21 07:31:00] [INFO ] Flatten gal took : 113 ms
Total runtime 36730 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldRVt (PT), instance 030B
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 274 places, 433 transitions, 2367 arcs.
Final Score: 6425.486
Took : 22 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldRVt-PT-030B-ReachabilityCardinality-05 (reachable &!potential( ( ( (tk(P28)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P28)) ) )))
PROPERTY: ShieldRVt-PT-030B-ReachabilityCardinality-06 (reachable & potential(( ( ( (tk(P6)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P6)) ) ) & ( ( ( ( (tk(P46)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P46)) ) ) | ( ( ( (tk(P203)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P203)) ) ) | ( ( (tk(P58)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P58)) ) ) ) ) | ( ( ( ( (tk(P75)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P75)) ) ) | ( ( ( (tk(P163)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P163)) ) ) & ( ( (tk(P131)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P131)) ) ) ) ) | ( ( ( ( (tk(P235)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P235)) ) ) & ( ( ( (tk(P73)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P73)) ) ) | ( ( (tk(P222)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P222)) ) ) ) ) | ( ( ( ( ( (tk(P17)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P17)) ) ) & ( ( (tk(P187)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P187)) ) ) ) & ( ( ( (tk(P89)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P89)) ) ) & ( ( (tk(P182)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P182)) ) ) ) ) & ( ( ( ( (tk(P189)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P189)) ) ) & ( ( (tk(P161)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P161)) ) ) ) & ( ( ( (tk(P151)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P151)) ) ) & ( ( (tk(P83)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P83)) ) ) ) ) ) ) ) ) )))
PROPERTY: ShieldRVt-PT-030B-ReachabilityCardinality-07 (reachable & potential(( ( ( (tk(P207)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P207)) ) ) & ( ( ( (tk(P62)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P62)) ) ) & ( ( (tk(P59)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P59)) ) ) ) )))
PROPERTY: ShieldRVt-PT-030B-ReachabilityCardinality-14 (reachable & potential(( ( ( ( (tk(P238)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P238)) ) ) & ( ( (tk(P110)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P110)) ) ) ) & ( ( ( (tk(P2)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2)) ) ) & ( ( (tk(P8)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P8)) ) ) ) )))

BK_STOP 1679386653020

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 760 Killed ${SMART}/smart ${INPUT_SM}

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="ShieldRVt-PT-030B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is ShieldRVt-PT-030B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r427-tajo-167905979500302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-030B.tgz
mv ShieldRVt-PT-030B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;