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.r373-tall-171683789500520.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 gold2023
Input is ShieldRVs-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789500520
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 17:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 12 17:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 17:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 12 17:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 370K May 18 16:43 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 ShieldRVs-PT-030B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVs-PT-030B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717004694279

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=gold2023
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-030B
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-29 17:44:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 17:44:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 17:45:00] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2024-05-29 17:45:00] [INFO ] Transformed 1203 places.
[2024-05-29 17:45:00] [INFO ] Transformed 1353 transitions.
[2024-05-29 17:45:00] [INFO ] Found NUPN structural information;
[2024-05-29 17:45:00] [INFO ] Parsed PT model containing 1203 places and 1353 transitions and 4320 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 16) seen :11
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1353 rows 1203 cols
[2024-05-29 17:45:00] [INFO ] Computed 121 invariants in 41 ms
[2024-05-29 17:45:01] [INFO ] After 513ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 17:45:01] [INFO ] [Nat]Absence check using 121 positive place invariants in 52 ms returned sat
[2024-05-29 17:45:03] [INFO ] After 1418ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 17:45:03] [INFO ] Deduced a trap composed of 19 places in 339 ms of which 7 ms to minimize.
[2024-05-29 17:45:04] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 1 ms to minimize.
[2024-05-29 17:45:04] [INFO ] Deduced a trap composed of 41 places in 302 ms of which 2 ms to minimize.
[2024-05-29 17:45:04] [INFO ] Deduced a trap composed of 29 places in 269 ms of which 2 ms to minimize.
[2024-05-29 17:45:05] [INFO ] Deduced a trap composed of 27 places in 266 ms of which 1 ms to minimize.
[2024-05-29 17:45:05] [INFO ] Deduced a trap composed of 46 places in 246 ms of which 1 ms to minimize.
[2024-05-29 17:45:05] [INFO ] Deduced a trap composed of 24 places in 267 ms of which 0 ms to minimize.
[2024-05-29 17:45:06] [INFO ] Deduced a trap composed of 45 places in 247 ms of which 0 ms to minimize.
[2024-05-29 17:45:06] [INFO ] Deduced a trap composed of 30 places in 249 ms of which 0 ms to minimize.
[2024-05-29 17:45:06] [INFO ] Deduced a trap composed of 42 places in 244 ms of which 2 ms to minimize.
[2024-05-29 17:45:07] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 1 ms to minimize.
[2024-05-29 17:45:07] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 1 ms to minimize.
[2024-05-29 17:45:07] [INFO ] Deduced a trap composed of 42 places in 214 ms of which 0 ms to minimize.
[2024-05-29 17:45:07] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 1 ms to minimize.
[2024-05-29 17:45:08] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 1 ms to minimize.
[2024-05-29 17:45:08] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 1 ms to minimize.
[2024-05-29 17:45:08] [INFO ] Deduced a trap composed of 43 places in 211 ms of which 1 ms to minimize.
[2024-05-29 17:45:09] [INFO ] Deduced a trap composed of 65 places in 208 ms of which 1 ms to minimize.
[2024-05-29 17:45:09] [INFO ] Deduced a trap composed of 72 places in 209 ms of which 1 ms to minimize.
[2024-05-29 17:45:09] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 0 ms to minimize.
[2024-05-29 17:45:09] [INFO ] Deduced a trap composed of 44 places in 206 ms of which 1 ms to minimize.
[2024-05-29 17:45:10] [INFO ] Deduced a trap composed of 28 places in 289 ms of which 1 ms to minimize.
[2024-05-29 17:45:10] [INFO ] Deduced a trap composed of 37 places in 267 ms of which 1 ms to minimize.
[2024-05-29 17:45:10] [INFO ] Deduced a trap composed of 24 places in 273 ms of which 1 ms to minimize.
[2024-05-29 17:45:11] [INFO ] Deduced a trap composed of 40 places in 254 ms of which 0 ms to minimize.
[2024-05-29 17:45:11] [INFO ] Deduced a trap composed of 43 places in 242 ms of which 1 ms to minimize.
[2024-05-29 17:45:12] [INFO ] Deduced a trap composed of 30 places in 243 ms of which 0 ms to minimize.
[2024-05-29 17:45:12] [INFO ] Deduced a trap composed of 27 places in 246 ms of which 0 ms to minimize.
[2024-05-29 17:45:12] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 0 ms to minimize.
[2024-05-29 17:45:12] [INFO ] Deduced a trap composed of 53 places in 217 ms of which 1 ms to minimize.
[2024-05-29 17:45:13] [INFO ] Deduced a trap composed of 31 places in 203 ms of which 1 ms to minimize.
[2024-05-29 17:45:13] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 0 ms to minimize.
[2024-05-29 17:45:13] [INFO ] Deduced a trap composed of 58 places in 174 ms of which 1 ms to minimize.
[2024-05-29 17:45:13] [INFO ] Deduced a trap composed of 30 places in 158 ms of which 1 ms to minimize.
[2024-05-29 17:45:14] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 0 ms to minimize.
[2024-05-29 17:45:14] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 1 ms to minimize.
[2024-05-29 17:45:14] [INFO ] Deduced a trap composed of 45 places in 160 ms of which 1 ms to minimize.
[2024-05-29 17:45:14] [INFO ] Deduced a trap composed of 29 places in 258 ms of which 1 ms to minimize.
[2024-05-29 17:45:15] [INFO ] Deduced a trap composed of 39 places in 252 ms of which 1 ms to minimize.
[2024-05-29 17:45:15] [INFO ] Deduced a trap composed of 25 places in 256 ms of which 1 ms to minimize.
[2024-05-29 17:45:15] [INFO ] Deduced a trap composed of 33 places in 264 ms of which 1 ms to minimize.
[2024-05-29 17:45:16] [INFO ] Deduced a trap composed of 26 places in 273 ms of which 1 ms to minimize.
[2024-05-29 17:45:16] [INFO ] Deduced a trap composed of 30 places in 268 ms of which 2 ms to minimize.
[2024-05-29 17:45:16] [INFO ] Deduced a trap composed of 18 places in 258 ms of which 1 ms to minimize.
[2024-05-29 17:45:17] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 1 ms to minimize.
[2024-05-29 17:45:17] [INFO ] Deduced a trap composed of 17 places in 255 ms of which 0 ms to minimize.
[2024-05-29 17:45:17] [INFO ] Deduced a trap composed of 62 places in 254 ms of which 1 ms to minimize.
[2024-05-29 17:45:18] [INFO ] Deduced a trap composed of 30 places in 243 ms of which 1 ms to minimize.
[2024-05-29 17:45:18] [INFO ] Deduced a trap composed of 39 places in 246 ms of which 0 ms to minimize.
[2024-05-29 17:45:18] [INFO ] Deduced a trap composed of 21 places in 244 ms of which 1 ms to minimize.
[2024-05-29 17:45:19] [INFO ] Deduced a trap composed of 39 places in 243 ms of which 1 ms to minimize.
[2024-05-29 17:45:19] [INFO ] Deduced a trap composed of 26 places in 329 ms of which 1 ms to minimize.
[2024-05-29 17:45:20] [INFO ] Deduced a trap composed of 38 places in 305 ms of which 1 ms to minimize.
[2024-05-29 17:45:20] [INFO ] Deduced a trap composed of 46 places in 322 ms of which 1 ms to minimize.
[2024-05-29 17:45:20] [INFO ] Deduced a trap composed of 38 places in 301 ms of which 1 ms to minimize.
[2024-05-29 17:45:21] [INFO ] Deduced a trap composed of 30 places in 308 ms of which 5 ms to minimize.
[2024-05-29 17:45:21] [INFO ] Deduced a trap composed of 36 places in 287 ms of which 1 ms to minimize.
[2024-05-29 17:45:21] [INFO ] Deduced a trap composed of 24 places in 293 ms of which 1 ms to minimize.
[2024-05-29 17:45:22] [INFO ] Deduced a trap composed of 36 places in 343 ms of which 1 ms to minimize.
[2024-05-29 17:45:22] [INFO ] Deduced a trap composed of 31 places in 261 ms of which 0 ms to minimize.
[2024-05-29 17:45:22] [INFO ] Deduced a trap composed of 42 places in 261 ms of which 1 ms to minimize.
[2024-05-29 17:45:23] [INFO ] Deduced a trap composed of 31 places in 249 ms of which 0 ms to minimize.
[2024-05-29 17:45:23] [INFO ] Deduced a trap composed of 27 places in 261 ms of which 1 ms to minimize.
[2024-05-29 17:45:23] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 2 ms to minimize.
[2024-05-29 17:45:24] [INFO ] Deduced a trap composed of 54 places in 261 ms of which 1 ms to minimize.
[2024-05-29 17:45:24] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 1 ms to minimize.
[2024-05-29 17:45:24] [INFO ] Deduced a trap composed of 19 places in 262 ms of which 2 ms to minimize.
[2024-05-29 17:45:25] [INFO ] Deduced a trap composed of 24 places in 251 ms of which 3 ms to minimize.
[2024-05-29 17:45:25] [INFO ] Deduced a trap composed of 27 places in 234 ms of which 1 ms to minimize.
[2024-05-29 17:45:25] [INFO ] Deduced a trap composed of 39 places in 218 ms of which 1 ms to minimize.
[2024-05-29 17:45:25] [INFO ] Deduced a trap composed of 43 places in 233 ms of which 0 ms to minimize.
[2024-05-29 17:45:26] [INFO ] Deduced a trap composed of 43 places in 225 ms of which 1 ms to minimize.
[2024-05-29 17:45:26] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 0 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 17:45:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 17:45:26] [INFO ] After 25181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 189 ms.
Support contains 135 out of 1203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1203/1203 places, 1353/1353 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 1203 transition count 1256
Reduce places removed 97 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 100 rules applied. Total rules applied 197 place count 1106 transition count 1253
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 200 place count 1103 transition count 1253
Performed 137 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 137 Pre rules applied. Total rules applied 200 place count 1103 transition count 1116
Deduced a syphon composed of 137 places in 2 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 274 rules applied. Total rules applied 474 place count 966 transition count 1116
Discarding 183 places :
Symmetric choice reduction at 3 with 183 rule applications. Total rules 657 place count 783 transition count 933
Iterating global reduction 3 with 183 rules applied. Total rules applied 840 place count 783 transition count 933
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 840 place count 783 transition count 883
Deduced a syphon composed of 50 places in 3 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 940 place count 733 transition count 883
Performed 189 Post agglomeration using F-continuation condition.Transition count delta: 189
Deduced a syphon composed of 189 places in 3 ms
Reduce places removed 189 places and 0 transitions.
Iterating global reduction 3 with 378 rules applied. Total rules applied 1318 place count 544 transition count 694
Partial Free-agglomeration rule applied 46 times.
Drop transitions removed 46 transitions
Iterating global reduction 3 with 46 rules applied. Total rules applied 1364 place count 544 transition count 694
Applied a total of 1364 rules in 300 ms. Remains 544 /1203 variables (removed 659) and now considering 694/1353 (removed 659) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 300 ms. Remains : 544/1203 places, 694/1353 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 4) seen :2
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 694 rows 544 cols
[2024-05-29 17:45:27] [INFO ] Computed 121 invariants in 5 ms
[2024-05-29 17:45:27] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 17:45:27] [INFO ] [Nat]Absence check using 121 positive place invariants in 23 ms returned sat
[2024-05-29 17:45:28] [INFO ] After 507ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 17:45:28] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2024-05-29 17:45:28] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-05-29 17:45:28] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-29 17:45:28] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-29 17:45:28] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-29 17:45:28] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-29 17:45:28] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2024-05-29 17:45:28] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2024-05-29 17:45:29] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-29 17:45:29] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-29 17:45:29] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 0 ms to minimize.
[2024-05-29 17:45:29] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 0 ms to minimize.
[2024-05-29 17:45:29] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2024-05-29 17:45:29] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-29 17:45:29] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1488 ms
[2024-05-29 17:45:29] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2024-05-29 17:45:29] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 0 ms to minimize.
[2024-05-29 17:45:29] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2024-05-29 17:45:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 258 ms
[2024-05-29 17:45:30] [INFO ] After 2475ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 258 ms.
[2024-05-29 17:45:30] [INFO ] After 2861ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 20 ms.
Support contains 87 out of 544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 544/544 places, 694/694 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 544 transition count 689
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 539 transition count 689
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 10 place count 539 transition count 675
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 38 place count 525 transition count 675
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 82 place count 503 transition count 653
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 89 place count 503 transition count 653
Applied a total of 89 rules in 83 ms. Remains 503 /544 variables (removed 41) and now considering 653/694 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 503/544 places, 653/694 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 303694 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :{}
Probabilistic random walk after 303694 steps, saw 64479 distinct states, run finished after 3002 ms. (steps per millisecond=101 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 653 rows 503 cols
[2024-05-29 17:45:33] [INFO ] Computed 121 invariants in 7 ms
[2024-05-29 17:45:33] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 17:45:33] [INFO ] [Nat]Absence check using 121 positive place invariants in 21 ms returned sat
[2024-05-29 17:45:34] [INFO ] After 452ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 11 places in 901 ms of which 0 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 0 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2024-05-29 17:45:35] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1863 ms
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-29 17:45:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 274 ms
[2024-05-29 17:45:36] [INFO ] After 2908ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 316 ms.
[2024-05-29 17:45:37] [INFO ] After 3346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 24 ms.
Support contains 87 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 653/653 transitions.
Applied a total of 0 rules in 16 ms. Remains 503 /503 variables (removed 0) and now considering 653/653 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 503/503 places, 653/653 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 653/653 transitions.
Applied a total of 0 rules in 21 ms. Remains 503 /503 variables (removed 0) and now considering 653/653 (removed 0) transitions.
[2024-05-29 17:45:37] [INFO ] Invariant cache hit.
[2024-05-29 17:45:37] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-29 17:45:37] [INFO ] Invariant cache hit.
[2024-05-29 17:45:37] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
[2024-05-29 17:45:37] [INFO ] Redundant transitions in 79 ms returned []
[2024-05-29 17:45:37] [INFO ] Invariant cache hit.
[2024-05-29 17:45:38] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1133 ms. Remains : 503/503 places, 653/653 transitions.
Applied a total of 0 rules in 14 ms. Remains 503 /503 variables (removed 0) and now considering 653/653 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-29 17:45:38] [INFO ] Invariant cache hit.
[2024-05-29 17:45:38] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 17:45:38] [INFO ] [Nat]Absence check using 121 positive place invariants in 20 ms returned sat
[2024-05-29 17:45:38] [INFO ] After 453ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 17:45:39] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-29 17:45:39] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 0 ms to minimize.
[2024-05-29 17:45:39] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-29 17:45:39] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2024-05-29 17:45:39] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-29 17:45:39] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-05-29 17:45:39] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-29 17:45:39] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 0 ms to minimize.
[2024-05-29 17:45:39] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-29 17:45:39] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-29 17:45:40] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-29 17:45:40] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 0 ms to minimize.
[2024-05-29 17:45:40] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-29 17:45:40] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2024-05-29 17:45:40] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-29 17:45:40] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-29 17:45:40] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-29 17:45:40] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-29 17:45:40] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-29 17:45:40] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-29 17:45:40] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-29 17:45:41] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2025 ms
[2024-05-29 17:45:41] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
[2024-05-29 17:45:41] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-29 17:45:41] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-29 17:45:41] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 17:45:41] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2024-05-29 17:45:41] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-29 17:45:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 661 ms
[2024-05-29 17:45:41] [INFO ] After 3404ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 306 ms.
[2024-05-29 17:45:42] [INFO ] After 3821ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-29 17:45:42] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-05-29 17:45:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 503 places, 653 transitions and 3016 arcs took 5 ms.
[2024-05-29 17:45:42] [INFO ] Flatten gal took : 97 ms
Total runtime 42598 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVs-PT-030B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/369
ReachabilityFireability

FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-030B-ReachabilityFireability-2024-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1717004748517

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/369/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/369/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/369/ReachabilityFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 11 (type EXCL) for 0 ShieldRVs-PT-030B-ReachabilityFireability-2024-02
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 7 (type FNDP) for 0 ShieldRVs-PT-030B-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type EQUN) for 0 ShieldRVs-PT-030B-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 10 (type SRCH) for 0 ShieldRVs-PT-030B-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 7 (type FNDP) for ShieldRVs-PT-030B-ReachabilityFireability-2024-02
lola: result : true
lola: fired transitions : 102
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 8 (type EQUN) for ShieldRVs-PT-030B-ReachabilityFireability-2024-02 (obsolete)
lola: CANCELED task # 10 (type SRCH) for ShieldRVs-PT-030B-ReachabilityFireability-2024-02 (obsolete)
lola: CANCELED task # 11 (type EXCL) for ShieldRVs-PT-030B-ReachabilityFireability-2024-02 (obsolete)
lola: LAUNCH task # 17 (type EXCL) for 3 ShieldRVs-PT-030B-ReachabilityFireability-2024-13
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 3 ShieldRVs-PT-030B-ReachabilityFireability-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 3 ShieldRVs-PT-030B-ReachabilityFireability-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type SRCH) for 3 ShieldRVs-PT-030B-ReachabilityFireability-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 10 (type SRCH) for ShieldRVs-PT-030B-ReachabilityFireability-2024-02
lola: result : true
lola: markings : 104
lola: fired transitions : 103
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 16 (type SRCH) for ShieldRVs-PT-030B-ReachabilityFireability-2024-13
lola: result : true
lola: markings : 106
lola: fired transitions : 105
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 13 (type FNDP) for ShieldRVs-PT-030B-ReachabilityFireability-2024-13 (obsolete)
lola: CANCELED task # 14 (type EQUN) for ShieldRVs-PT-030B-ReachabilityFireability-2024-13 (obsolete)
lola: CANCELED task # 17 (type EXCL) for ShieldRVs-PT-030B-ReachabilityFireability-2024-13 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-030B-ReachabilityFireability-2024-02: AG false findpath
ShieldRVs-PT-030B-ReachabilityFireability-2024-13: EF true tandem / insertion


Time elapsed: 0 secs. Pages in use: 2

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="ShieldRVs-PT-030B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is ShieldRVs-PT-030B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683789500520"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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