Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 952K
-rw-r--r-- 1 mcc users 9.3K Feb 25 23:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 23:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 23:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 23:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 23:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 23:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 25 23:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 489K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679349555972

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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-040B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 21:59:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 21:59:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:59:17] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2023-03-20 21:59:17] [INFO ] Transformed 2003 places.
[2023-03-20 21:59:17] [INFO ] Transformed 2003 transitions.
[2023-03-20 21:59:17] [INFO ] Found NUPN structural information;
[2023-03-20 21:59:17] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 16) seen :7
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2003 rows 2003 cols
[2023-03-20 21:59:18] [INFO ] Computed 161 place invariants in 33 ms
[2023-03-20 21:59:19] [INFO ] After 692ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 21:59:20] [INFO ] [Nat]Absence check using 161 positive place invariants in 53 ms returned sat
[2023-03-20 21:59:27] [INFO ] After 7294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 21:59:28] [INFO ] Deduced a trap composed of 35 places in 639 ms of which 8 ms to minimize.
[2023-03-20 21:59:29] [INFO ] Deduced a trap composed of 19 places in 480 ms of which 2 ms to minimize.
[2023-03-20 21:59:30] [INFO ] Deduced a trap composed of 27 places in 545 ms of which 2 ms to minimize.
[2023-03-20 21:59:31] [INFO ] Deduced a trap composed of 35 places in 579 ms of which 3 ms to minimize.
[2023-03-20 21:59:31] [INFO ] Deduced a trap composed of 38 places in 373 ms of which 6 ms to minimize.
[2023-03-20 21:59:32] [INFO ] Deduced a trap composed of 72 places in 273 ms of which 0 ms to minimize.
[2023-03-20 21:59:32] [INFO ] Deduced a trap composed of 39 places in 304 ms of which 1 ms to minimize.
[2023-03-20 21:59:32] [INFO ] Deduced a trap composed of 23 places in 270 ms of which 1 ms to minimize.
[2023-03-20 21:59:32] [INFO ] Deduced a trap composed of 43 places in 234 ms of which 1 ms to minimize.
[2023-03-20 21:59:33] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 1 ms to minimize.
[2023-03-20 21:59:33] [INFO ] Deduced a trap composed of 38 places in 307 ms of which 1 ms to minimize.
[2023-03-20 21:59:33] [INFO ] Deduced a trap composed of 45 places in 247 ms of which 1 ms to minimize.
[2023-03-20 21:59:34] [INFO ] Deduced a trap composed of 29 places in 259 ms of which 1 ms to minimize.
[2023-03-20 21:59:34] [INFO ] Deduced a trap composed of 34 places in 248 ms of which 1 ms to minimize.
[2023-03-20 21:59:34] [INFO ] Deduced a trap composed of 32 places in 311 ms of which 1 ms to minimize.
[2023-03-20 21:59:35] [INFO ] Deduced a trap composed of 46 places in 241 ms of which 1 ms to minimize.
[2023-03-20 21:59:35] [INFO ] Deduced a trap composed of 38 places in 304 ms of which 1 ms to minimize.
[2023-03-20 21:59:35] [INFO ] Deduced a trap composed of 45 places in 232 ms of which 1 ms to minimize.
[2023-03-20 21:59:36] [INFO ] Deduced a trap composed of 48 places in 270 ms of which 1 ms to minimize.
[2023-03-20 21:59:36] [INFO ] Deduced a trap composed of 41 places in 240 ms of which 1 ms to minimize.
[2023-03-20 21:59:36] [INFO ] Deduced a trap composed of 55 places in 254 ms of which 1 ms to minimize.
[2023-03-20 21:59:37] [INFO ] Deduced a trap composed of 47 places in 238 ms of which 1 ms to minimize.
[2023-03-20 21:59:37] [INFO ] Deduced a trap composed of 55 places in 232 ms of which 0 ms to minimize.
[2023-03-20 21:59:37] [INFO ] Deduced a trap composed of 43 places in 211 ms of which 1 ms to minimize.
[2023-03-20 21:59:38] [INFO ] Deduced a trap composed of 34 places in 260 ms of which 1 ms to minimize.
[2023-03-20 21:59:38] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 1 ms to minimize.
[2023-03-20 21:59:38] [INFO ] Deduced a trap composed of 46 places in 202 ms of which 1 ms to minimize.
[2023-03-20 21:59:39] [INFO ] Deduced a trap composed of 48 places in 227 ms of which 1 ms to minimize.
[2023-03-20 21:59:39] [INFO ] Deduced a trap composed of 52 places in 236 ms of which 1 ms to minimize.
[2023-03-20 21:59:39] [INFO ] Deduced a trap composed of 51 places in 238 ms of which 1 ms to minimize.
[2023-03-20 21:59:39] [INFO ] Deduced a trap composed of 54 places in 177 ms of which 1 ms to minimize.
[2023-03-20 21:59:40] [INFO ] Deduced a trap composed of 62 places in 217 ms of which 1 ms to minimize.
[2023-03-20 21:59:40] [INFO ] Deduced a trap composed of 52 places in 240 ms of which 0 ms to minimize.
[2023-03-20 21:59:40] [INFO ] Deduced a trap composed of 54 places in 221 ms of which 3 ms to minimize.
[2023-03-20 21:59:41] [INFO ] Deduced a trap composed of 65 places in 202 ms of which 1 ms to minimize.
[2023-03-20 21:59:41] [INFO ] Deduced a trap composed of 56 places in 173 ms of which 1 ms to minimize.
[2023-03-20 21:59:41] [INFO ] Deduced a trap composed of 70 places in 201 ms of which 1 ms to minimize.
[2023-03-20 21:59:41] [INFO ] Deduced a trap composed of 63 places in 190 ms of which 0 ms to minimize.
[2023-03-20 21:59:42] [INFO ] Deduced a trap composed of 69 places in 194 ms of which 1 ms to minimize.
[2023-03-20 21:59:42] [INFO ] Deduced a trap composed of 61 places in 157 ms of which 2 ms to minimize.
[2023-03-20 21:59:42] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 14417 ms
[2023-03-20 21:59:43] [INFO ] Deduced a trap composed of 37 places in 504 ms of which 2 ms to minimize.
[2023-03-20 21:59:44] [INFO ] Deduced a trap composed of 35 places in 502 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 21:59:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 21:59:44] [INFO ] After 25169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 717 ms.
Support contains 116 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Drop transitions removed 520 transitions
Trivial Post-agglo rules discarded 520 transitions
Performed 520 trivial Post agglomeration. Transition count delta: 520
Iterating post reduction 0 with 520 rules applied. Total rules applied 520 place count 2003 transition count 1483
Reduce places removed 520 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 522 rules applied. Total rules applied 1042 place count 1483 transition count 1481
Reduce places removed 1 places and 0 transitions.
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Iterating post reduction 2 with 56 rules applied. Total rules applied 1098 place count 1482 transition count 1426
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 3 with 55 rules applied. Total rules applied 1153 place count 1427 transition count 1426
Performed 163 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 163 Pre rules applied. Total rules applied 1153 place count 1427 transition count 1263
Deduced a syphon composed of 163 places in 4 ms
Reduce places removed 163 places and 0 transitions.
Iterating global reduction 4 with 326 rules applied. Total rules applied 1479 place count 1264 transition count 1263
Discarding 251 places :
Symmetric choice reduction at 4 with 251 rule applications. Total rules 1730 place count 1013 transition count 1012
Iterating global reduction 4 with 251 rules applied. Total rules applied 1981 place count 1013 transition count 1012
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 92 Pre rules applied. Total rules applied 1981 place count 1013 transition count 920
Deduced a syphon composed of 92 places in 4 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 4 with 184 rules applied. Total rules applied 2165 place count 921 transition count 920
Performed 322 Post agglomeration using F-continuation condition.Transition count delta: 322
Deduced a syphon composed of 322 places in 2 ms
Reduce places removed 322 places and 0 transitions.
Iterating global reduction 4 with 644 rules applied. Total rules applied 2809 place count 599 transition count 598
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 4 with 180 rules applied. Total rules applied 2989 place count 509 transition count 657
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2990 place count 509 transition count 656
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 2997 place count 509 transition count 649
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 3004 place count 502 transition count 649
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 3008 place count 502 transition count 645
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 3010 place count 502 transition count 645
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3011 place count 501 transition count 644
Applied a total of 3011 rules in 428 ms. Remains 501 /2003 variables (removed 1502) and now considering 644/2003 (removed 1359) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 429 ms. Remains : 501/2003 places, 644/2003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 169706 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 169706 steps, saw 102371 distinct states, run finished after 3002 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 644 rows 501 cols
[2023-03-20 21:59:49] [INFO ] Computed 161 place invariants in 2 ms
[2023-03-20 21:59:49] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 21:59:49] [INFO ] [Nat]Absence check using 161 positive place invariants in 20 ms returned sat
[2023-03-20 21:59:49] [INFO ] After 419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 21:59:49] [INFO ] State equation strengthened by 232 read => feed constraints.
[2023-03-20 21:59:51] [INFO ] After 1020ms SMT Verify possible using 232 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-20 21:59:51] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2023-03-20 21:59:51] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2023-03-20 21:59:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 282 ms
[2023-03-20 21:59:51] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 0 ms to minimize.
[2023-03-20 21:59:51] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2023-03-20 21:59:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2023-03-20 21:59:52] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2023-03-20 21:59:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-03-20 21:59:52] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2023-03-20 21:59:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 706 ms
[2023-03-20 21:59:53] [INFO ] After 3192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1307 ms.
[2023-03-20 21:59:54] [INFO ] After 5089ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 161 ms.
Support contains 116 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 644/644 transitions.
Applied a total of 0 rules in 20 ms. Remains 501 /501 variables (removed 0) and now considering 644/644 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 501/501 places, 644/644 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 644/644 transitions.
Applied a total of 0 rules in 15 ms. Remains 501 /501 variables (removed 0) and now considering 644/644 (removed 0) transitions.
[2023-03-20 21:59:54] [INFO ] Invariant cache hit.
[2023-03-20 21:59:54] [INFO ] Implicit Places using invariants in 234 ms returned [491]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 237 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 500/501 places, 644/644 transitions.
Applied a total of 0 rules in 14 ms. Remains 500 /500 variables (removed 0) and now considering 644/644 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 267 ms. Remains : 500/501 places, 644/644 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) 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 9) 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 9) 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 9) seen :1
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) 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 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 644 rows 500 cols
[2023-03-20 21:59:55] [INFO ] Computed 160 place invariants in 2 ms
[2023-03-20 21:59:55] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 21:59:55] [INFO ] [Nat]Absence check using 160 positive place invariants in 21 ms returned sat
[2023-03-20 21:59:56] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 21:59:56] [INFO ] State equation strengthened by 230 read => feed constraints.
[2023-03-20 21:59:57] [INFO ] After 792ms SMT Verify possible using 230 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-20 21:59:57] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2023-03-20 21:59:57] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2023-03-20 21:59:57] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2023-03-20 21:59:57] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2023-03-20 21:59:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 447 ms
[2023-03-20 21:59:57] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2023-03-20 21:59:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-03-20 21:59:58] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2023-03-20 21:59:58] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 9 ms to minimize.
[2023-03-20 21:59:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 246 ms
[2023-03-20 21:59:58] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2023-03-20 21:59:58] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 0 ms to minimize.
[2023-03-20 21:59:58] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2023-03-20 21:59:58] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 13 ms to minimize.
[2023-03-20 21:59:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 496 ms
[2023-03-20 21:59:59] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 0 ms to minimize.
[2023-03-20 21:59:59] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2023-03-20 21:59:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 264 ms
[2023-03-20 21:59:59] [INFO ] After 2857ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 528 ms.
[2023-03-20 21:59:59] [INFO ] After 3945ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 175 ms.
Support contains 99 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 644/644 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 500 transition count 640
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 496 transition count 639
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 495 transition count 639
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 10 place count 495 transition count 631
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 26 place count 487 transition count 631
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 42 place count 479 transition count 623
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 46 place count 477 transition count 625
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 477 transition count 623
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 50 place count 475 transition count 623
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 475 transition count 622
Applied a total of 51 rules in 73 ms. Remains 475 /500 variables (removed 25) and now considering 622/644 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 475/500 places, 622/644 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 220364 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 220364 steps, saw 130419 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 622 rows 475 cols
[2023-03-20 22:00:03] [INFO ] Computed 160 place invariants in 2 ms
[2023-03-20 22:00:03] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 22:00:03] [INFO ] [Nat]Absence check using 160 positive place invariants in 19 ms returned sat
[2023-03-20 22:00:03] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 22:00:03] [INFO ] State equation strengthened by 244 read => feed constraints.
[2023-03-20 22:00:04] [INFO ] After 605ms SMT Verify possible using 244 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-20 22:00:04] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2023-03-20 22:00:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-03-20 22:00:04] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2023-03-20 22:00:05] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 3 ms to minimize.
[2023-03-20 22:00:05] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 3 ms to minimize.
[2023-03-20 22:00:05] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 7 ms to minimize.
[2023-03-20 22:00:05] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2023-03-20 22:00:05] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2023-03-20 22:00:05] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2023-03-20 22:00:05] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 710 ms
[2023-03-20 22:00:05] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 0 ms to minimize.
[2023-03-20 22:00:05] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2023-03-20 22:00:05] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2023-03-20 22:00:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 345 ms
[2023-03-20 22:00:06] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2023-03-20 22:00:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-03-20 22:00:06] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2023-03-20 22:00:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-03-20 22:00:06] [INFO ] After 2718ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1031 ms.
[2023-03-20 22:00:07] [INFO ] After 4224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 53 ms.
Support contains 99 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 622/622 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 622/622 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 475/475 places, 622/622 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 622/622 transitions.
Applied a total of 0 rules in 8 ms. Remains 475 /475 variables (removed 0) and now considering 622/622 (removed 0) transitions.
[2023-03-20 22:00:07] [INFO ] Invariant cache hit.
[2023-03-20 22:00:08] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-20 22:00:08] [INFO ] Invariant cache hit.
[2023-03-20 22:00:08] [INFO ] State equation strengthened by 244 read => feed constraints.
[2023-03-20 22:00:08] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1140 ms to find 0 implicit places.
[2023-03-20 22:00:09] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-20 22:00:09] [INFO ] Invariant cache hit.
[2023-03-20 22:00:09] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1469 ms. Remains : 475/475 places, 622/622 transitions.
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 475 transition count 598
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 475 transition count 598
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 62 place count 475 transition count 584
Applied a total of 62 rules in 31 ms. Remains 475 /475 variables (removed 0) and now considering 584/622 (removed 38) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 584 rows 475 cols
[2023-03-20 22:00:09] [INFO ] Computed 160 place invariants in 2 ms
[2023-03-20 22:00:09] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 22:00:09] [INFO ] [Nat]Absence check using 160 positive place invariants in 20 ms returned sat
[2023-03-20 22:00:10] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 22:00:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 22:00:10] [INFO ] After 326ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-20 22:00:10] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 0 ms to minimize.
[2023-03-20 22:00:10] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2023-03-20 22:00:10] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2023-03-20 22:00:10] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2023-03-20 22:00:10] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2023-03-20 22:00:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 388 ms
[2023-03-20 22:00:10] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2023-03-20 22:00:10] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2023-03-20 22:00:11] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2023-03-20 22:00:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 243 ms
[2023-03-20 22:00:11] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2023-03-20 22:00:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-03-20 22:00:11] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2023-03-20 22:00:11] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2023-03-20 22:00:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 185 ms
[2023-03-20 22:00:11] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2023-03-20 22:00:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-20 22:00:11] [INFO ] After 1704ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 340 ms.
[2023-03-20 22:00:12] [INFO ] After 2572ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-03-20 22:00:12] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 16 ms.
[2023-03-20 22:00:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 475 places, 622 transitions and 2930 arcs took 6 ms.
[2023-03-20 22:00:12] [INFO ] Flatten gal took : 92 ms
Total runtime 54976 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldRVt_PT_040B
(NrP: 475 NrTr: 622 NrArc: 2930)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.032sec

net check time: 0m 0.000sec

init dd package: 0m 3.184sec


before gc: list nodes free: 2032782

after gc: idd nodes used:50913044, unused:13086956; list nodes free:57771318

RS generation: 20m59.157sec


-> last computed set: #nodes 50912570 (5.1e+07) #states 11,123,516,180 (10)


CANNOT_COMPUTE


BK_STOP 1679350904855

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.003sec

idd.cc:820: DD Exception: No free nodes

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-040B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is ShieldRVt-PT-040B, 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 r426-tajo-167905978800319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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