Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r395-oct2-167903718400167.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldIIPs-PT-100A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718400167
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.3K Feb 25 16:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 16:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 15:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 15:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 16:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 868K 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 ShieldIIPs-PT-100A-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679557498185

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100A
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 07:45:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 07:45:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 07:45:01] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2023-03-23 07:45:01] [INFO ] Transformed 2503 places.
[2023-03-23 07:45:01] [INFO ] Transformed 2403 transitions.
[2023-03-23 07:45:01] [INFO ] Found NUPN structural information;
[2023-03-23 07:45:01] [INFO ] Parsed PT model containing 2503 places and 2403 transitions and 10806 arcs in 302 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 602 ms. (steps per millisecond=16 ) properties (out of 16) seen :10
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-23 07:45:03] [INFO ] Computed 901 place invariants in 22 ms
[2023-03-23 07:45:04] [INFO ] [Real]Absence check using 901 positive place invariants in 284 ms returned sat
[2023-03-23 07:45:05] [INFO ] After 1542ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 07:45:06] [INFO ] [Nat]Absence check using 901 positive place invariants in 308 ms returned sat
[2023-03-23 07:45:19] [INFO ] After 13197ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-23 07:45:20] [INFO ] Deduced a trap composed of 9 places in 277 ms of which 9 ms to minimize.
[2023-03-23 07:45:20] [INFO ] Deduced a trap composed of 9 places in 291 ms of which 1 ms to minimize.
[2023-03-23 07:45:21] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 0 ms to minimize.
[2023-03-23 07:45:21] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 1 ms to minimize.
[2023-03-23 07:45:21] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 14 ms to minimize.
[2023-03-23 07:45:21] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 0 ms to minimize.
[2023-03-23 07:45:22] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 26 ms to minimize.
[2023-03-23 07:45:22] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 1 ms to minimize.
[2023-03-23 07:45:22] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2588 ms
[2023-03-23 07:45:30] [INFO ] Deduced a trap composed of 9 places in 431 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 07:45:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 07:45:30] [INFO ] After 25099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 2094 ms.
Support contains 217 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 40 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 590 times.
Drop transitions removed 590 transitions
Iterating global reduction 0 with 590 rules applied. Total rules applied 594 place count 2501 transition count 2401
Applied a total of 594 rules in 653 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 654 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 61335 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61335 steps, saw 58120 distinct states, run finished after 3003 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-23 07:45:37] [INFO ] Computed 901 place invariants in 61 ms
[2023-03-23 07:45:38] [INFO ] [Real]Absence check using 873 positive place invariants in 249 ms returned sat
[2023-03-23 07:45:38] [INFO ] [Real]Absence check using 873 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-23 07:45:38] [INFO ] After 1092ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 07:45:39] [INFO ] [Nat]Absence check using 873 positive place invariants in 391 ms returned sat
[2023-03-23 07:45:39] [INFO ] [Nat]Absence check using 873 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-23 07:46:00] [INFO ] After 20916ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 07:46:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-23 07:46:03] [INFO ] After 2501ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 07:46:03] [INFO ] After 2505ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-23 07:46:03] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1477 ms.
Support contains 217 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 96 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 94 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-23 07:46:05] [INFO ] Invariant cache hit.
[2023-03-23 07:46:07] [INFO ] Implicit Places using invariants in 2029 ms returned []
[2023-03-23 07:46:07] [INFO ] Invariant cache hit.
[2023-03-23 07:46:08] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-23 07:46:11] [INFO ] Implicit Places using invariants and state equation in 4301 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6363 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 103 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6561 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 66371 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66371 steps, saw 63011 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-23 07:46:15] [INFO ] Computed 900 place invariants in 42 ms
[2023-03-23 07:46:16] [INFO ] [Real]Absence check using 872 positive place invariants in 257 ms returned sat
[2023-03-23 07:46:16] [INFO ] [Real]Absence check using 872 positive and 28 generalized place invariants in 12 ms returned sat
[2023-03-23 07:46:16] [INFO ] After 1026ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 07:46:17] [INFO ] [Nat]Absence check using 872 positive place invariants in 283 ms returned sat
[2023-03-23 07:46:17] [INFO ] [Nat]Absence check using 872 positive and 28 generalized place invariants in 24 ms returned sat
[2023-03-23 07:46:35] [INFO ] After 17695ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 07:46:37] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 1 ms to minimize.
[2023-03-23 07:46:37] [INFO ] Deduced a trap composed of 5 places in 347 ms of which 1 ms to minimize.
[2023-03-23 07:46:38] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 0 ms to minimize.
[2023-03-23 07:46:38] [INFO ] Deduced a trap composed of 5 places in 389 ms of which 1 ms to minimize.
[2023-03-23 07:46:39] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 0 ms to minimize.
[2023-03-23 07:46:40] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 1 ms to minimize.
[2023-03-23 07:46:40] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 1 ms to minimize.
[2023-03-23 07:46:41] [INFO ] Deduced a trap composed of 5 places in 555 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 07:46:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 07:46:41] [INFO ] After 25156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 1324 ms.
Support contains 217 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 83 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 87 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-23 07:46:43] [INFO ] Invariant cache hit.
[2023-03-23 07:46:45] [INFO ] Implicit Places using invariants in 2722 ms returned []
[2023-03-23 07:46:45] [INFO ] Invariant cache hit.
[2023-03-23 07:46:52] [INFO ] Implicit Places using invariants and state equation in 7032 ms returned []
Implicit Place search using SMT with State Equation took 9771 ms to find 0 implicit places.
[2023-03-23 07:46:53] [INFO ] Redundant transitions in 453 ms returned []
[2023-03-23 07:46:53] [INFO ] Invariant cache hit.
[2023-03-23 07:46:55] [INFO ] Dead Transitions using invariants and state equation in 1594 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11916 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 88 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-23 07:46:55] [INFO ] Invariant cache hit.
[2023-03-23 07:46:56] [INFO ] [Real]Absence check using 872 positive place invariants in 324 ms returned sat
[2023-03-23 07:46:56] [INFO ] [Real]Absence check using 872 positive and 28 generalized place invariants in 9 ms returned sat
[2023-03-23 07:46:56] [INFO ] After 916ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 07:46:57] [INFO ] [Nat]Absence check using 872 positive place invariants in 429 ms returned sat
[2023-03-23 07:46:57] [INFO ] [Nat]Absence check using 872 positive and 28 generalized place invariants in 6 ms returned sat
[2023-03-23 07:47:14] [INFO ] After 16879ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 07:47:14] [INFO ] Deduced a trap composed of 9 places in 421 ms of which 1 ms to minimize.
[2023-03-23 07:47:15] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 1 ms to minimize.
[2023-03-23 07:47:15] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 1 ms to minimize.
[2023-03-23 07:47:16] [INFO ] Deduced a trap composed of 9 places in 234 ms of which 1 ms to minimize.
[2023-03-23 07:47:16] [INFO ] Deduced a trap composed of 8 places in 221 ms of which 0 ms to minimize.
[2023-03-23 07:47:16] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 1 ms to minimize.
[2023-03-23 07:47:17] [INFO ] Deduced a trap composed of 9 places in 550 ms of which 2 ms to minimize.
[2023-03-23 07:47:17] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 13 ms to minimize.
[2023-03-23 07:47:18] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 0 ms to minimize.
[2023-03-23 07:47:18] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 0 ms to minimize.
[2023-03-23 07:47:18] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 1 ms to minimize.
[2023-03-23 07:47:18] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 0 ms to minimize.
[2023-03-23 07:47:19] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 1 ms to minimize.
[2023-03-23 07:47:19] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2023-03-23 07:47:19] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 0 ms to minimize.
[2023-03-23 07:47:20] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 0 ms to minimize.
[2023-03-23 07:47:23] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 1 ms to minimize.
[2023-03-23 07:47:24] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 1 ms to minimize.
[2023-03-23 07:47:24] [INFO ] Deduced a trap composed of 8 places in 295 ms of which 36 ms to minimize.
[2023-03-23 07:47:25] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 0 ms to minimize.
[2023-03-23 07:47:25] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 1 ms to minimize.
[2023-03-23 07:47:26] [INFO ] Deduced a trap composed of 5 places in 311 ms of which 0 ms to minimize.
[2023-03-23 07:47:26] [INFO ] Deduced a trap composed of 9 places in 269 ms of which 2 ms to minimize.
[2023-03-23 07:47:26] [INFO ] Deduced a trap composed of 5 places in 263 ms of which 1 ms to minimize.
[2023-03-23 07:47:28] [INFO ] Deduced a trap composed of 5 places in 1185 ms of which 1 ms to minimize.
[2023-03-23 07:47:28] [INFO ] Deduced a trap composed of 9 places in 229 ms of which 1 ms to minimize.
[2023-03-23 07:47:28] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 1 ms to minimize.
[2023-03-23 07:47:29] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 1 ms to minimize.
[2023-03-23 07:47:29] [INFO ] Deduced a trap composed of 6 places in 304 ms of which 1 ms to minimize.
[2023-03-23 07:47:30] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 1 ms to minimize.
[2023-03-23 07:47:30] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 1 ms to minimize.
[2023-03-23 07:47:30] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 2 ms to minimize.
[2023-03-23 07:47:31] [INFO ] Deduced a trap composed of 6 places in 472 ms of which 0 ms to minimize.
[2023-03-23 07:47:32] [INFO ] Deduced a trap composed of 5 places in 464 ms of which 1 ms to minimize.
[2023-03-23 07:47:32] [INFO ] Deduced a trap composed of 5 places in 319 ms of which 0 ms to minimize.
[2023-03-23 07:47:32] [INFO ] Deduced a trap composed of 5 places in 259 ms of which 0 ms to minimize.
[2023-03-23 07:47:33] [INFO ] Deduced a trap composed of 5 places in 301 ms of which 0 ms to minimize.
[2023-03-23 07:47:33] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 0 ms to minimize.
[2023-03-23 07:47:34] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 0 ms to minimize.
[2023-03-23 07:47:34] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 1 ms to minimize.
[2023-03-23 07:47:34] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 0 ms to minimize.
[2023-03-23 07:47:35] [INFO ] Deduced a trap composed of 9 places in 226 ms of which 1 ms to minimize.
[2023-03-23 07:47:35] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 1 ms to minimize.
[2023-03-23 07:47:35] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 1 ms to minimize.
[2023-03-23 07:47:36] [INFO ] Deduced a trap composed of 15 places in 372 ms of which 1 ms to minimize.
[2023-03-23 07:47:36] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 1 ms to minimize.
[2023-03-23 07:47:36] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 0 ms to minimize.
[2023-03-23 07:47:37] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 1 ms to minimize.
[2023-03-23 07:47:37] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 1 ms to minimize.
[2023-03-23 07:47:37] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 0 ms to minimize.
[2023-03-23 07:47:38] [INFO ] Deduced a trap composed of 6 places in 268 ms of which 25 ms to minimize.
[2023-03-23 07:47:38] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 33 ms to minimize.
[2023-03-23 07:47:42] [INFO ] Deduced a trap composed of 6 places in 248 ms of which 3 ms to minimize.
[2023-03-23 07:47:42] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 0 ms to minimize.
[2023-03-23 07:47:42] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 0 ms to minimize.
[2023-03-23 07:47:42] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 0 ms to minimize.
[2023-03-23 07:47:43] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2023-03-23 07:47:43] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 0 ms to minimize.
[2023-03-23 07:47:43] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 2 ms to minimize.
[2023-03-23 07:47:43] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 1 ms to minimize.
[2023-03-23 07:47:44] [INFO ] Deduced a trap composed of 8 places in 204 ms of which 1 ms to minimize.
[2023-03-23 07:47:44] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2023-03-23 07:47:44] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 1 ms to minimize.
[2023-03-23 07:47:45] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 0 ms to minimize.
[2023-03-23 07:47:45] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 1 ms to minimize.
[2023-03-23 07:47:45] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 0 ms to minimize.
[2023-03-23 07:47:45] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 0 ms to minimize.
[2023-03-23 07:47:46] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2023-03-23 07:47:46] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 0 ms to minimize.
[2023-03-23 07:47:46] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2023-03-23 07:47:46] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 0 ms to minimize.
[2023-03-23 07:47:46] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 1 ms to minimize.
[2023-03-23 07:47:47] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 1 ms to minimize.
[2023-03-23 07:47:47] [INFO ] Trap strengthening (SAT) tested/added 74/73 trap constraints in 32969 ms
[2023-03-23 07:47:54] [INFO ] Deduced a trap composed of 9 places in 373 ms of which 1 ms to minimize.
[2023-03-23 07:47:55] [INFO ] Deduced a trap composed of 9 places in 446 ms of which 1 ms to minimize.
[2023-03-23 07:47:55] [INFO ] Deduced a trap composed of 13 places in 320 ms of which 1 ms to minimize.
[2023-03-23 07:47:56] [INFO ] Deduced a trap composed of 9 places in 361 ms of which 1 ms to minimize.
[2023-03-23 07:47:57] [INFO ] Deduced a trap composed of 9 places in 321 ms of which 0 ms to minimize.
[2023-03-23 07:47:57] [INFO ] Deduced a trap composed of 9 places in 329 ms of which 1 ms to minimize.
[2023-03-23 07:47:58] [INFO ] Deduced a trap composed of 9 places in 376 ms of which 1 ms to minimize.
[2023-03-23 07:48:01] [INFO ] Deduced a trap composed of 14 places in 424 ms of which 1 ms to minimize.
[2023-03-23 07:48:01] [INFO ] Deduced a trap composed of 9 places in 404 ms of which 1 ms to minimize.
[2023-03-23 07:48:02] [INFO ] Deduced a trap composed of 8 places in 321 ms of which 1 ms to minimize.
[2023-03-23 07:48:02] [INFO ] Deduced a trap composed of 8 places in 331 ms of which 1 ms to minimize.
[2023-03-23 07:48:03] [INFO ] Deduced a trap composed of 21 places in 597 ms of which 1 ms to minimize.
[2023-03-23 07:48:04] [INFO ] Deduced a trap composed of 13 places in 385 ms of which 1 ms to minimize.
[2023-03-23 07:48:04] [INFO ] Deduced a trap composed of 9 places in 325 ms of which 1 ms to minimize.
[2023-03-23 07:48:05] [INFO ] Deduced a trap composed of 9 places in 331 ms of which 1 ms to minimize.
[2023-03-23 07:48:05] [INFO ] Deduced a trap composed of 15 places in 272 ms of which 0 ms to minimize.
[2023-03-23 07:48:06] [INFO ] Deduced a trap composed of 10 places in 223 ms of which 1 ms to minimize.
[2023-03-23 07:48:06] [INFO ] Deduced a trap composed of 9 places in 333 ms of which 0 ms to minimize.
[2023-03-23 07:48:07] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 0 ms to minimize.
[2023-03-23 07:48:07] [INFO ] Deduced a trap composed of 9 places in 338 ms of which 1 ms to minimize.
[2023-03-23 07:48:08] [INFO ] Deduced a trap composed of 14 places in 379 ms of which 1 ms to minimize.
[2023-03-23 07:48:08] [INFO ] Deduced a trap composed of 21 places in 189 ms of which 1 ms to minimize.
[2023-03-23 07:48:09] [INFO ] Deduced a trap composed of 17 places in 256 ms of which 1 ms to minimize.
[2023-03-23 07:48:09] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 1 ms to minimize.
[2023-03-23 07:48:10] [INFO ] Deduced a trap composed of 13 places in 270 ms of which 1 ms to minimize.
[2023-03-23 07:48:10] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 1 ms to minimize.
[2023-03-23 07:48:10] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 1 ms to minimize.
[2023-03-23 07:48:11] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 0 ms to minimize.
[2023-03-23 07:48:11] [INFO ] Deduced a trap composed of 25 places in 213 ms of which 1 ms to minimize.
[2023-03-23 07:48:11] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 1 ms to minimize.
[2023-03-23 07:48:12] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 0 ms to minimize.
[2023-03-23 07:48:12] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 1 ms to minimize.
[2023-03-23 07:48:13] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 13 ms to minimize.
[2023-03-23 07:48:13] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 0 ms to minimize.
[2023-03-23 07:48:13] [INFO ] Deduced a trap composed of 9 places in 278 ms of which 1 ms to minimize.
[2023-03-23 07:48:14] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 0 ms to minimize.
[2023-03-23 07:48:14] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 0 ms to minimize.
[2023-03-23 07:48:17] [INFO ] Deduced a trap composed of 9 places in 288 ms of which 1 ms to minimize.
[2023-03-23 07:48:17] [INFO ] Deduced a trap composed of 13 places in 243 ms of which 0 ms to minimize.
[2023-03-23 07:48:17] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 1 ms to minimize.
[2023-03-23 07:48:18] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 0 ms to minimize.
[2023-03-23 07:48:18] [INFO ] Deduced a trap composed of 9 places in 247 ms of which 1 ms to minimize.
[2023-03-23 07:48:19] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 1 ms to minimize.
[2023-03-23 07:48:19] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 0 ms to minimize.
[2023-03-23 07:48:20] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 0 ms to minimize.
[2023-03-23 07:48:20] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 1 ms to minimize.
[2023-03-23 07:48:20] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 0 ms to minimize.
[2023-03-23 07:48:21] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 1 ms to minimize.
[2023-03-23 07:48:21] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 1 ms to minimize.
[2023-03-23 07:48:21] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2023-03-23 07:48:22] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2023-03-23 07:48:22] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 28151 ms
[2023-03-23 07:48:27] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 3 ms to minimize.
[2023-03-23 07:48:28] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 1 ms to minimize.
[2023-03-23 07:48:28] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 1 ms to minimize.
[2023-03-23 07:48:28] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 0 ms to minimize.
[2023-03-23 07:48:29] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 1 ms to minimize.
[2023-03-23 07:48:29] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2023-03-23 07:48:29] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2023-03-23 07:48:30] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2023-03-23 07:48:30] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2976 ms
[2023-03-23 07:48:30] [INFO ] After 92941ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 8976 ms.
[2023-03-23 07:48:39] [INFO ] After 103278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-23 07:48:39] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-23 07:48:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2500 places, 2401 transitions and 12067 arcs took 23 ms.
[2023-03-23 07:48:40] [INFO ] Flatten gal took : 351 ms
Total runtime 219033 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPs (PT), instance 100A
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 2500 places, 2401 transitions, 12067 arcs.
Final Score: 2199477.886
Took : 26 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679557747376

--------------------
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
ERROR in file model.sm near line 16975:
syntax error

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="ShieldIIPs-PT-100A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is ShieldIIPs-PT-100A, 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 r395-oct2-167903718400167"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-100A.tgz
mv ShieldIIPs-PT-100A 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 ;