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.r043-tajo-167813697000567.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is BusinessProcesses-PT-15, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697000567
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Feb 25 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 157K Mar 5 18:22 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 BusinessProcesses-PT-15-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678794080299

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=BusinessProcesses-PT-15
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 11:41:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 11:41:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 11:41:21] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-03-14 11:41:21] [INFO ] Transformed 630 places.
[2023-03-14 11:41:21] [INFO ] Transformed 566 transitions.
[2023-03-14 11:41:21] [INFO ] Found NUPN structural information;
[2023-03-14 11:41:21] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 66 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 15) seen :6
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :1
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 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 10 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 562 rows 626 cols
[2023-03-14 11:41:22] [INFO ] Computed 102 place invariants in 32 ms
[2023-03-14 11:41:23] [INFO ] After 350ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-14 11:41:23] [INFO ] [Nat]Absence check using 61 positive place invariants in 25 ms returned sat
[2023-03-14 11:41:23] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 18 ms returned sat
[2023-03-14 11:41:24] [INFO ] After 1177ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-14 11:41:25] [INFO ] Deduced a trap composed of 11 places in 407 ms of which 6 ms to minimize.
[2023-03-14 11:41:25] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 2 ms to minimize.
[2023-03-14 11:41:26] [INFO ] Deduced a trap composed of 18 places in 856 ms of which 4 ms to minimize.
[2023-03-14 11:41:30] [INFO ] Deduced a trap composed of 39 places in 4172 ms of which 29 ms to minimize.
[2023-03-14 11:41:31] [INFO ] Deduced a trap composed of 31 places in 251 ms of which 2 ms to minimize.
[2023-03-14 11:41:31] [INFO ] Deduced a trap composed of 25 places in 236 ms of which 1 ms to minimize.
[2023-03-14 11:41:31] [INFO ] Deduced a trap composed of 29 places in 239 ms of which 1 ms to minimize.
[2023-03-14 11:41:31] [INFO ] Deduced a trap composed of 51 places in 184 ms of which 1 ms to minimize.
[2023-03-14 11:41:32] [INFO ] Deduced a trap composed of 36 places in 234 ms of which 1 ms to minimize.
[2023-03-14 11:41:36] [INFO ] Deduced a trap composed of 53 places in 4667 ms of which 1 ms to minimize.
[2023-03-14 11:41:37] [INFO ] Deduced a trap composed of 57 places in 236 ms of which 1 ms to minimize.
[2023-03-14 11:41:37] [INFO ] Deduced a trap composed of 136 places in 235 ms of which 1 ms to minimize.
[2023-03-14 11:41:37] [INFO ] Deduced a trap composed of 135 places in 204 ms of which 1 ms to minimize.
[2023-03-14 11:41:37] [INFO ] Deduced a trap composed of 142 places in 198 ms of which 1 ms to minimize.
[2023-03-14 11:41:38] [INFO ] Deduced a trap composed of 142 places in 176 ms of which 1 ms to minimize.
[2023-03-14 11:41:38] [INFO ] Deduced a trap composed of 142 places in 206 ms of which 0 ms to minimize.
[2023-03-14 11:41:38] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 1 ms to minimize.
[2023-03-14 11:41:38] [INFO ] Deduced a trap composed of 69 places in 143 ms of which 1 ms to minimize.
[2023-03-14 11:41:38] [INFO ] Deduced a trap composed of 59 places in 159 ms of which 0 ms to minimize.
[2023-03-14 11:41:39] [INFO ] Deduced a trap composed of 144 places in 155 ms of which 1 ms to minimize.
[2023-03-14 11:41:39] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 1 ms to minimize.
[2023-03-14 11:41:39] [INFO ] Deduced a trap composed of 142 places in 138 ms of which 1 ms to minimize.
[2023-03-14 11:41:39] [INFO ] Deduced a trap composed of 136 places in 185 ms of which 1 ms to minimize.
[2023-03-14 11:41:39] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 1 ms to minimize.
[2023-03-14 11:41:40] [INFO ] Deduced a trap composed of 139 places in 150 ms of which 0 ms to minimize.
[2023-03-14 11:41:40] [INFO ] Deduced a trap composed of 141 places in 134 ms of which 1 ms to minimize.
[2023-03-14 11:41:40] [INFO ] Deduced a trap composed of 132 places in 170 ms of which 1 ms to minimize.
[2023-03-14 11:41:40] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 0 ms to minimize.
[2023-03-14 11:41:40] [INFO ] Deduced a trap composed of 137 places in 142 ms of which 1 ms to minimize.
[2023-03-14 11:41:40] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 15888 ms
[2023-03-14 11:41:41] [INFO ] Deduced a trap composed of 27 places in 183 ms of which 0 ms to minimize.
[2023-03-14 11:41:41] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2023-03-14 11:41:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 384 ms
[2023-03-14 11:41:41] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2023-03-14 11:41:41] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 0 ms to minimize.
[2023-03-14 11:41:42] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 14 ms to minimize.
[2023-03-14 11:41:42] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 16 ms to minimize.
[2023-03-14 11:41:42] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 0 ms to minimize.
[2023-03-14 11:41:42] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 0 ms to minimize.
[2023-03-14 11:41:46] [INFO ] Deduced a trap composed of 16 places in 3840 ms of which 26 ms to minimize.
[2023-03-14 11:41:46] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 1 ms to minimize.
[2023-03-14 11:41:46] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 1 ms to minimize.
[2023-03-14 11:41:47] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 0 ms to minimize.
[2023-03-14 11:41:47] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 0 ms to minimize.
[2023-03-14 11:41:47] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 0 ms to minimize.
[2023-03-14 11:41:47] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 1 ms to minimize.
[2023-03-14 11:41:47] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5929 ms
[2023-03-14 11:41:47] [INFO ] Deduced a trap composed of 143 places in 116 ms of which 1 ms to minimize.
[2023-03-14 11:41:47] [INFO ] Deduced a trap composed of 148 places in 161 ms of which 0 ms to minimize.
[2023-03-14 11:41:47] [INFO ] Deduced a trap composed of 142 places in 162 ms of which 0 ms to minimize.
[2023-03-14 11:41:48] [INFO ] Deduced a trap composed of 144 places in 159 ms of which 1 ms to minimize.
[2023-03-14 11:41:48] [INFO ] Deduced a trap composed of 138 places in 176 ms of which 0 ms to minimize.
[2023-03-14 11:41:48] [INFO ] Deduced a trap composed of 145 places in 173 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java: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-14 11:41:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 11:41:48] [INFO ] After 25145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 99 ms.
Support contains 175 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 562/562 transitions.
Graph (complete) has 1275 edges and 626 vertex of which 623 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 623 transition count 518
Reduce places removed 44 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 63 rules applied. Total rules applied 108 place count 579 transition count 499
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 127 place count 560 transition count 499
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 127 place count 560 transition count 419
Deduced a syphon composed of 80 places in 2 ms
Ensure Unique test removed 9 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 169 rules applied. Total rules applied 296 place count 471 transition count 419
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 344 place count 423 transition count 371
Iterating global reduction 3 with 48 rules applied. Total rules applied 392 place count 423 transition count 371
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 392 place count 423 transition count 369
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 396 place count 421 transition count 369
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 492 place count 373 transition count 321
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 493 place count 373 transition count 320
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 494 place count 372 transition count 320
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 498 place count 372 transition count 320
Applied a total of 498 rules in 204 ms. Remains 372 /626 variables (removed 254) and now considering 320/562 (removed 242) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 372/626 places, 320/562 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 362261 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :{0=1, 1=1, 2=1, 3=1}
Probabilistic random walk after 362261 steps, saw 61098 distinct states, run finished after 3015 ms. (steps per millisecond=120 ) properties seen :4
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 320 rows 372 cols
[2023-03-14 11:41:52] [INFO ] Computed 90 place invariants in 15 ms
[2023-03-14 11:41:52] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 11:41:52] [INFO ] [Nat]Absence check using 58 positive place invariants in 17 ms returned sat
[2023-03-14 11:41:52] [INFO ] [Nat]Absence check using 58 positive and 32 generalized place invariants in 23 ms returned sat
[2023-03-14 11:41:53] [INFO ] After 653ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 11:41:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-14 11:41:53] [INFO ] After 431ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-14 11:41:54] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 1 ms to minimize.
[2023-03-14 11:41:54] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 1 ms to minimize.
[2023-03-14 11:41:54] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 0 ms to minimize.
[2023-03-14 11:41:54] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 1 ms to minimize.
[2023-03-14 11:41:54] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 1 ms to minimize.
[2023-03-14 11:41:55] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2023-03-14 11:41:55] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 2 ms to minimize.
[2023-03-14 11:41:55] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2023-03-14 11:41:55] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 0 ms to minimize.
[2023-03-14 11:41:55] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2023-03-14 11:41:55] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2023-03-14 11:41:55] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1636 ms
[2023-03-14 11:41:56] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 0 ms to minimize.
[2023-03-14 11:41:56] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 0 ms to minimize.
[2023-03-14 11:41:56] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 1 ms to minimize.
[2023-03-14 11:41:56] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 1 ms to minimize.
[2023-03-14 11:41:56] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 1 ms to minimize.
[2023-03-14 11:41:56] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
[2023-03-14 11:41:57] [INFO ] Deduced a trap composed of 63 places in 142 ms of which 1 ms to minimize.
[2023-03-14 11:41:57] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 1 ms to minimize.
[2023-03-14 11:41:57] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 0 ms to minimize.
[2023-03-14 11:41:57] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 0 ms to minimize.
[2023-03-14 11:41:57] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 1 ms to minimize.
[2023-03-14 11:41:57] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 0 ms to minimize.
[2023-03-14 11:41:58] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 0 ms to minimize.
[2023-03-14 11:41:58] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 1 ms to minimize.
[2023-03-14 11:41:58] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 0 ms to minimize.
[2023-03-14 11:41:58] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 0 ms to minimize.
[2023-03-14 11:41:58] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2820 ms
[2023-03-14 11:41:58] [INFO ] After 5289ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 354 ms.
[2023-03-14 11:41:59] [INFO ] After 6464ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 6 ms.
Support contains 35 out of 372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 372/372 places, 320/320 transitions.
Graph (complete) has 970 edges and 372 vertex of which 371 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 371 transition count 299
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 351 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 350 transition count 298
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 43 place count 350 transition count 252
Deduced a syphon composed of 46 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 143 place count 296 transition count 252
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 165 place count 274 transition count 230
Ensure Unique test removed 1 places
Iterating global reduction 3 with 23 rules applied. Total rules applied 188 place count 273 transition count 230
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 188 place count 273 transition count 229
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 190 place count 272 transition count 229
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 113 rules applied. Total rules applied 303 place count 215 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 304 place count 215 transition count 172
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 305 place count 215 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 306 place count 214 transition count 171
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 307 place count 214 transition count 171
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 308 place count 213 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 309 place count 212 transition count 170
Applied a total of 309 rules in 113 ms. Remains 212 /372 variables (removed 160) and now considering 170/320 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 212/372 places, 170/320 transitions.
Incomplete random walk after 10000 steps, including 358 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 956653 steps, run timeout after 3001 ms. (steps per millisecond=318 ) properties seen :{}
Probabilistic random walk after 956653 steps, saw 166613 distinct states, run finished after 3002 ms. (steps per millisecond=318 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 170 rows 212 cols
[2023-03-14 11:42:02] [INFO ] Computed 79 place invariants in 11 ms
[2023-03-14 11:42:02] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 11:42:02] [INFO ] [Nat]Absence check using 57 positive place invariants in 27 ms returned sat
[2023-03-14 11:42:02] [INFO ] [Nat]Absence check using 57 positive and 22 generalized place invariants in 6 ms returned sat
[2023-03-14 11:42:02] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 11:42:02] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-14 11:42:02] [INFO ] After 67ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 11:42:02] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2023-03-14 11:42:02] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 0 ms to minimize.
[2023-03-14 11:42:02] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2023-03-14 11:42:03] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2023-03-14 11:42:03] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 0 ms to minimize.
[2023-03-14 11:42:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 577 ms
[2023-03-14 11:42:03] [INFO ] After 713ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-14 11:42:03] [INFO ] After 990ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 35 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 170/170 transitions.
Applied a total of 0 rules in 14 ms. Remains 212 /212 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 212/212 places, 170/170 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 170/170 transitions.
Applied a total of 0 rules in 7 ms. Remains 212 /212 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2023-03-14 11:42:03] [INFO ] Invariant cache hit.
[2023-03-14 11:42:03] [INFO ] Implicit Places using invariants in 252 ms returned [23, 28, 30, 32, 34, 39, 41, 44, 58, 60, 63, 64, 72]
Discarding 13 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT only with invariants took 260 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 199/212 places, 169/170 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 194 transition count 155
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 194 transition count 155
Applied a total of 10 rules in 11 ms. Remains 194 /199 variables (removed 5) and now considering 155/169 (removed 14) transitions.
// Phase 1: matrix 155 rows 194 cols
[2023-03-14 11:42:03] [INFO ] Computed 67 place invariants in 2 ms
[2023-03-14 11:42:03] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-14 11:42:03] [INFO ] Invariant cache hit.
[2023-03-14 11:42:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-14 11:42:04] [INFO ] Implicit Places using invariants and state equation in 257 ms returned [10, 48, 50, 123, 129, 132]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 398 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 188/212 places, 155/170 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 188 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 187 transition count 154
Applied a total of 2 rules in 18 ms. Remains 187 /188 variables (removed 1) and now considering 154/155 (removed 1) transitions.
// Phase 1: matrix 154 rows 187 cols
[2023-03-14 11:42:04] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-14 11:42:04] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-14 11:42:04] [INFO ] Invariant cache hit.
[2023-03-14 11:42:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-14 11:42:04] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 187/212 places, 154/170 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1102 ms. Remains : 187/212 places, 154/170 transitions.
Incomplete random walk after 10000 steps, including 367 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1237488 steps, run timeout after 3001 ms. (steps per millisecond=412 ) properties seen :{}
Probabilistic random walk after 1237488 steps, saw 213013 distinct states, run finished after 3001 ms. (steps per millisecond=412 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 11:42:07] [INFO ] Invariant cache hit.
[2023-03-14 11:42:07] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 11:42:07] [INFO ] [Nat]Absence check using 47 positive place invariants in 9 ms returned sat
[2023-03-14 11:42:07] [INFO ] [Nat]Absence check using 47 positive and 14 generalized place invariants in 3 ms returned sat
[2023-03-14 11:42:07] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 11:42:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-14 11:42:07] [INFO ] After 44ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 11:42:07] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 1 ms to minimize.
[2023-03-14 11:42:08] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 0 ms to minimize.
[2023-03-14 11:42:08] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2023-03-14 11:42:08] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2023-03-14 11:42:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 415 ms
[2023-03-14 11:42:08] [INFO ] After 509ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-14 11:42:08] [INFO ] After 732ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 35 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 154/154 transitions.
Applied a total of 0 rules in 11 ms. Remains 187 /187 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 187/187 places, 154/154 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 154/154 transitions.
Applied a total of 0 rules in 13 ms. Remains 187 /187 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2023-03-14 11:42:08] [INFO ] Invariant cache hit.
[2023-03-14 11:42:08] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-14 11:42:08] [INFO ] Invariant cache hit.
[2023-03-14 11:42:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-14 11:42:08] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2023-03-14 11:42:08] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-14 11:42:08] [INFO ] Invariant cache hit.
[2023-03-14 11:42:08] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 526 ms. Remains : 187/187 places, 154/154 transitions.
Graph (complete) has 581 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 186 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 185 transition count 153
Applied a total of 3 rules in 8 ms. Remains 185 /187 variables (removed 2) and now considering 153/154 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 185 cols
[2023-03-14 11:42:08] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-14 11:42:08] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 11:42:08] [INFO ] [Nat]Absence check using 46 positive place invariants in 10 ms returned sat
[2023-03-14 11:42:08] [INFO ] [Nat]Absence check using 46 positive and 14 generalized place invariants in 4 ms returned sat
[2023-03-14 11:42:09] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 11:42:09] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2023-03-14 11:42:09] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2023-03-14 11:42:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
[2023-03-14 11:42:09] [INFO ] After 346ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-14 11:42:09] [INFO ] After 494ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-14 11:42:09] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 12 ms.
[2023-03-14 11:42:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 187 places, 154 transitions and 695 arcs took 3 ms.
[2023-03-14 11:42:09] [INFO ] Flatten gal took : 61 ms
Total runtime 47860 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 15
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: 187 places, 154 transitions, 695 arcs.
Final Score: 3114.583
Took : 10 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678794140924

--------------------
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 1047:
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="BusinessProcesses-PT-15"
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 BusinessProcesses-PT-15, 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 r043-tajo-167813697000567"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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