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-171683789700620.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 ShieldRVt-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789700620
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 21:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 11 21:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 21:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 21:18 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 239K 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 ShieldRVt-PT-020B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717014909325

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=ShieldRVt-PT-020B
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-29 20:35:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 20:35:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:35:11] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-05-29 20:35:11] [INFO ] Transformed 1003 places.
[2024-05-29 20:35:11] [INFO ] Transformed 1003 transitions.
[2024-05-29 20:35:11] [INFO ] Found NUPN structural information;
[2024-05-29 20:35:11] [INFO ] Parsed PT model containing 1003 places and 1003 transitions and 2366 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 16) seen :10
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) 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 6) 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 6) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1003 rows 1003 cols
[2024-05-29 20:35:12] [INFO ] Computed 81 invariants in 21 ms
[2024-05-29 20:35:13] [INFO ] After 800ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 20:35:13] [INFO ] [Nat]Absence check using 81 positive place invariants in 86 ms returned sat
[2024-05-29 20:35:17] [INFO ] After 3148ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2024-05-29 20:35:17] [INFO ] Deduced a trap composed of 49 places in 220 ms of which 7 ms to minimize.
[2024-05-29 20:35:17] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 1 ms to minimize.
[2024-05-29 20:35:17] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 1 ms to minimize.
[2024-05-29 20:35:18] [INFO ] Deduced a trap composed of 51 places in 266 ms of which 7 ms to minimize.
[2024-05-29 20:35:18] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 1 ms to minimize.
[2024-05-29 20:35:19] [INFO ] Deduced a trap composed of 55 places in 193 ms of which 1 ms to minimize.
[2024-05-29 20:35:19] [INFO ] Deduced a trap composed of 36 places in 193 ms of which 1 ms to minimize.
[2024-05-29 20:35:19] [INFO ] Deduced a trap composed of 48 places in 230 ms of which 1 ms to minimize.
[2024-05-29 20:35:19] [INFO ] Deduced a trap composed of 27 places in 195 ms of which 1 ms to minimize.
[2024-05-29 20:35:20] [INFO ] Deduced a trap composed of 24 places in 203 ms of which 0 ms to minimize.
[2024-05-29 20:35:20] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 0 ms to minimize.
[2024-05-29 20:35:20] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 0 ms to minimize.
[2024-05-29 20:35:20] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 1 ms to minimize.
[2024-05-29 20:35:20] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 0 ms to minimize.
[2024-05-29 20:35:21] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 1 ms to minimize.
[2024-05-29 20:35:21] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 0 ms to minimize.
[2024-05-29 20:35:21] [INFO ] Deduced a trap composed of 56 places in 164 ms of which 2 ms to minimize.
[2024-05-29 20:35:21] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 0 ms to minimize.
[2024-05-29 20:35:21] [INFO ] Deduced a trap composed of 26 places in 152 ms of which 0 ms to minimize.
[2024-05-29 20:35:22] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 1 ms to minimize.
[2024-05-29 20:35:22] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 1 ms to minimize.
[2024-05-29 20:35:22] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 1 ms to minimize.
[2024-05-29 20:35:22] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 2 ms to minimize.
[2024-05-29 20:35:22] [INFO ] Deduced a trap composed of 51 places in 121 ms of which 0 ms to minimize.
[2024-05-29 20:35:23] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 0 ms to minimize.
[2024-05-29 20:35:23] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 1 ms to minimize.
[2024-05-29 20:35:23] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 6013 ms
[2024-05-29 20:35:23] [INFO ] Deduced a trap composed of 31 places in 248 ms of which 1 ms to minimize.
[2024-05-29 20:35:24] [INFO ] Deduced a trap composed of 40 places in 237 ms of which 2 ms to minimize.
[2024-05-29 20:35:24] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 0 ms to minimize.
[2024-05-29 20:35:24] [INFO ] Deduced a trap composed of 29 places in 239 ms of which 1 ms to minimize.
[2024-05-29 20:35:24] [INFO ] Deduced a trap composed of 24 places in 233 ms of which 1 ms to minimize.
[2024-05-29 20:35:25] [INFO ] Deduced a trap composed of 37 places in 232 ms of which 1 ms to minimize.
[2024-05-29 20:35:25] [INFO ] Deduced a trap composed of 42 places in 222 ms of which 0 ms to minimize.
[2024-05-29 20:35:25] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 0 ms to minimize.
[2024-05-29 20:35:25] [INFO ] Deduced a trap composed of 45 places in 229 ms of which 1 ms to minimize.
[2024-05-29 20:35:26] [INFO ] Deduced a trap composed of 55 places in 225 ms of which 0 ms to minimize.
[2024-05-29 20:35:26] [INFO ] Deduced a trap composed of 28 places in 203 ms of which 1 ms to minimize.
[2024-05-29 20:35:26] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 0 ms to minimize.
[2024-05-29 20:35:27] [INFO ] Deduced a trap composed of 29 places in 239 ms of which 1 ms to minimize.
[2024-05-29 20:35:27] [INFO ] Deduced a trap composed of 39 places in 228 ms of which 2 ms to minimize.
[2024-05-29 20:35:27] [INFO ] Deduced a trap composed of 35 places in 216 ms of which 1 ms to minimize.
[2024-05-29 20:35:27] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 1 ms to minimize.
[2024-05-29 20:35:28] [INFO ] Deduced a trap composed of 33 places in 210 ms of which 2 ms to minimize.
[2024-05-29 20:35:28] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 0 ms to minimize.
[2024-05-29 20:35:28] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 1 ms to minimize.
[2024-05-29 20:35:28] [INFO ] Deduced a trap composed of 33 places in 212 ms of which 1 ms to minimize.
[2024-05-29 20:35:29] [INFO ] Deduced a trap composed of 28 places in 223 ms of which 0 ms to minimize.
[2024-05-29 20:35:29] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 0 ms to minimize.
[2024-05-29 20:35:29] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 0 ms to minimize.
[2024-05-29 20:35:29] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 0 ms to minimize.
[2024-05-29 20:35:30] [INFO ] Deduced a trap composed of 57 places in 192 ms of which 2 ms to minimize.
[2024-05-29 20:35:30] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 0 ms to minimize.
[2024-05-29 20:35:30] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 0 ms to minimize.
[2024-05-29 20:35:30] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 7156 ms
[2024-05-29 20:35:30] [INFO ] Deduced a trap composed of 22 places in 211 ms of which 0 ms to minimize.
[2024-05-29 20:35:31] [INFO ] Deduced a trap composed of 28 places in 209 ms of which 1 ms to minimize.
[2024-05-29 20:35:31] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 1 ms to minimize.
[2024-05-29 20:35:31] [INFO ] Deduced a trap composed of 43 places in 195 ms of which 0 ms to minimize.
[2024-05-29 20:35:31] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 1 ms to minimize.
[2024-05-29 20:35:32] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 0 ms to minimize.
[2024-05-29 20:35:32] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 1 ms to minimize.
[2024-05-29 20:35:32] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 1 ms to minimize.
[2024-05-29 20:35:32] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 0 ms to minimize.
[2024-05-29 20:35:32] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 0 ms to minimize.
[2024-05-29 20:35:33] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 1 ms to minimize.
[2024-05-29 20:35:33] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 2 ms to minimize.
[2024-05-29 20:35:33] [INFO ] Deduced a trap composed of 46 places in 211 ms of which 1 ms to minimize.
[2024-05-29 20:35:33] [INFO ] Deduced a trap composed of 47 places in 209 ms of which 2 ms to minimize.
[2024-05-29 20:35:34] [INFO ] Deduced a trap composed of 29 places in 207 ms of which 1 ms to minimize.
[2024-05-29 20:35:34] [INFO ] Deduced a trap composed of 52 places in 206 ms of which 1 ms to minimize.
[2024-05-29 20:35:34] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 1 ms to minimize.
[2024-05-29 20:35:34] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 1 ms to minimize.
[2024-05-29 20:35:35] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 1 ms to minimize.
[2024-05-29 20:35:35] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 0 ms to minimize.
[2024-05-29 20:35:35] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 1 ms to minimize.
[2024-05-29 20:35:35] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 1 ms to minimize.
[2024-05-29 20:35:35] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 0 ms to minimize.
[2024-05-29 20:35:36] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 1 ms to minimize.
[2024-05-29 20:35:36] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 1 ms to minimize.
[2024-05-29 20:35:36] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 1 ms to minimize.
[2024-05-29 20:35:36] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 1 ms to minimize.
[2024-05-29 20:35:36] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 1 ms to minimize.
[2024-05-29 20:35:37] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 0 ms to minimize.
[2024-05-29 20:35:37] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 0 ms to minimize.
[2024-05-29 20:35:37] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 0 ms to minimize.
[2024-05-29 20:35:37] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 6756 ms
[2024-05-29 20:35:38] [INFO ] Deduced a trap composed of 28 places in 207 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: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 20:35:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 20:35:38] [INFO ] After 25075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2024-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 141 ms.
Support contains 107 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Drop transitions removed 223 transitions
Trivial Post-agglo rules discarded 223 transitions
Performed 223 trivial Post agglomeration. Transition count delta: 223
Iterating post reduction 0 with 223 rules applied. Total rules applied 223 place count 1003 transition count 780
Reduce places removed 223 places and 0 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Iterating post reduction 1 with 257 rules applied. Total rules applied 480 place count 780 transition count 746
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 514 place count 746 transition count 746
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 514 place count 746 transition count 658
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 690 place count 658 transition count 658
Discarding 112 places :
Symmetric choice reduction at 3 with 112 rule applications. Total rules 802 place count 546 transition count 546
Iterating global reduction 3 with 112 rules applied. Total rules applied 914 place count 546 transition count 546
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 914 place count 546 transition count 515
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 976 place count 515 transition count 515
Performed 154 Post agglomeration using F-continuation condition.Transition count delta: 154
Deduced a syphon composed of 154 places in 2 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 1284 place count 361 transition count 361
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 1348 place count 329 transition count 376
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1349 place count 329 transition count 375
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1353 place count 329 transition count 371
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1357 place count 325 transition count 371
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1358 place count 325 transition count 371
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1359 place count 324 transition count 370
Applied a total of 1359 rules in 207 ms. Remains 324 /1003 variables (removed 679) and now considering 370/1003 (removed 633) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 324/1003 places, 370/1003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 5) seen :1
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 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 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :1
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 370 rows 324 cols
[2024-05-29 20:35:38] [INFO ] Computed 81 invariants in 2 ms
[2024-05-29 20:35:38] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 20:35:38] [INFO ] [Nat]Absence check using 81 positive place invariants in 14 ms returned sat
[2024-05-29 20:35:39] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 20:35:39] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-29 20:35:39] [INFO ] After 174ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 20:35:39] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 20:35:39] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-29 20:35:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 148 ms
[2024-05-29 20:35:39] [INFO ] After 503ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 131 ms.
[2024-05-29 20:35:39] [INFO ] After 946ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 24 ms.
Support contains 42 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 370/370 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 324 transition count 352
Reduce places removed 18 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 21 rules applied. Total rules applied 39 place count 306 transition count 349
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 42 place count 303 transition count 349
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 42 place count 303 transition count 336
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 68 place count 290 transition count 336
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 71 place count 287 transition count 332
Iterating global reduction 3 with 3 rules applied. Total rules applied 74 place count 287 transition count 332
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 74 place count 287 transition count 331
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 286 transition count 331
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 79 rules applied. Total rules applied 155 place count 246 transition count 292
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 183 place count 232 transition count 303
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 184 place count 232 transition count 302
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 187 place count 232 transition count 299
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 190 place count 229 transition count 299
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 192 place count 229 transition count 297
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 197 place count 224 transition count 292
Applied a total of 197 rules in 78 ms. Remains 224 /324 variables (removed 100) and now considering 292/370 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 224/324 places, 292/370 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 3) seen :2
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 292 rows 224 cols
[2024-05-29 20:35:40] [INFO ] Computed 80 invariants in 2 ms
[2024-05-29 20:35:40] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:35:40] [INFO ] [Nat]Absence check using 80 positive place invariants in 11 ms returned sat
[2024-05-29 20:35:40] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:35:40] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-29 20:35:40] [INFO ] After 84ms SMT Verify possible using 80 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 20:35:40] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-29 20:35:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-29 20:35:40] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2024-05-29 20:35:40] [INFO ] After 471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 41 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 292/292 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 291
Applied a total of 2 rules in 20 ms. Remains 223 /224 variables (removed 1) and now considering 291/292 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 223/224 places, 291/292 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 938631 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :{}
Probabilistic random walk after 938631 steps, saw 203622 distinct states, run finished after 3002 ms. (steps per millisecond=312 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 291 rows 223 cols
[2024-05-29 20:35:43] [INFO ] Computed 80 invariants in 3 ms
[2024-05-29 20:35:43] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:35:43] [INFO ] [Nat]Absence check using 80 positive place invariants in 17 ms returned sat
[2024-05-29 20:35:43] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:35:44] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-29 20:35:44] [INFO ] After 87ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 20:35:44] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-29 20:35:44] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-29 20:35:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 144 ms
[2024-05-29 20:35:44] [INFO ] After 304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2024-05-29 20:35:44] [INFO ] After 549ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 41 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 291/291 transitions.
Applied a total of 0 rules in 7 ms. Remains 223 /223 variables (removed 0) and now considering 291/291 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 223/223 places, 291/291 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 291/291 transitions.
Applied a total of 0 rules in 7 ms. Remains 223 /223 variables (removed 0) and now considering 291/291 (removed 0) transitions.
[2024-05-29 20:35:44] [INFO ] Invariant cache hit.
[2024-05-29 20:35:44] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-29 20:35:44] [INFO ] Invariant cache hit.
[2024-05-29 20:35:44] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-29 20:35:44] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2024-05-29 20:35:44] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-29 20:35:44] [INFO ] Invariant cache hit.
[2024-05-29 20:35:45] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 643 ms. Remains : 223/223 places, 291/291 transitions.
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 223 transition count 279
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 20 place count 223 transition count 279
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 25 place count 223 transition count 274
Applied a total of 25 rules in 19 ms. Remains 223 /223 variables (removed 0) and now considering 274/291 (removed 17) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 274 rows 223 cols
[2024-05-29 20:35:45] [INFO ] Computed 80 invariants in 1 ms
[2024-05-29 20:35:45] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:35:45] [INFO ] [Nat]Absence check using 80 positive place invariants in 11 ms returned sat
[2024-05-29 20:35:45] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:35:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 20:35:45] [INFO ] After 43ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 20:35:45] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2024-05-29 20:35:45] [INFO ] After 333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-29 20:35:45] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-05-29 20:35:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 223 places, 291 transitions and 1366 arcs took 2 ms.
[2024-05-29 20:35:45] [INFO ] Flatten gal took : 57 ms
Total runtime 34358 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVt-PT-020B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
ReachabilityFireability

FORMULA ShieldRVt-PT-020B-ReachabilityFireability-2024-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1717014946796

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/ReachabilityFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
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: LAUNCH task # 7 (type EXCL) for 0 ShieldRVt-PT-020B-ReachabilityFireability-2024-01
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 ShieldRVt-PT-020B-ReachabilityFireability-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 ShieldRVt-PT-020B-ReachabilityFireability-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 6 (type SRCH) for 0 ShieldRVt-PT-020B-ReachabilityFireability-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 6 (type SRCH) for ShieldRVt-PT-020B-ReachabilityFireability-2024-01
lola: result : true
lola: markings : 52
lola: fired transitions : 51
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 3 (type FNDP) for ShieldRVt-PT-020B-ReachabilityFireability-2024-01 (obsolete)
lola: CANCELED task # 4 (type EQUN) for ShieldRVt-PT-020B-ReachabilityFireability-2024-01 (obsolete)
lola: CANCELED task # 7 (type EXCL) for ShieldRVt-PT-020B-ReachabilityFireability-2024-01 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-020B-ReachabilityFireability-2024-01: 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="ShieldRVt-PT-020B"
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 ShieldRVt-PT-020B, 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-171683789700620"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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