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-167903718800447.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 ShieldPPPs-PT-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718800447
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 7.1K Feb 26 02:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 02:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 02:05 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.7K Feb 25 16:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 02:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 02:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 02:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 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 172K 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 ShieldPPPs-PT-010B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679567850791

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=ShieldPPPs-PT-010B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 10:37:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 10:37:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 10:37:35] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2023-03-23 10:37:35] [INFO ] Transformed 683 places.
[2023-03-23 10:37:35] [INFO ] Transformed 633 transitions.
[2023-03-23 10:37:35] [INFO ] Found NUPN structural information;
[2023-03-23 10:37:35] [INFO ] Parsed PT model containing 683 places and 633 transitions and 1746 arcs in 475 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 6 resets, run finished after 505 ms. (steps per millisecond=19 ) properties (out of 16) seen :9
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :1
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 633 rows 683 cols
[2023-03-23 10:37:36] [INFO ] Computed 111 place invariants in 37 ms
[2023-03-23 10:37:36] [INFO ] After 686ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 10:37:37] [INFO ] [Nat]Absence check using 111 positive place invariants in 97 ms returned sat
[2023-03-23 10:37:39] [INFO ] After 1786ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 10:37:39] [INFO ] Deduced a trap composed of 30 places in 330 ms of which 30 ms to minimize.
[2023-03-23 10:37:39] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 1 ms to minimize.
[2023-03-23 10:37:40] [INFO ] Deduced a trap composed of 27 places in 473 ms of which 1 ms to minimize.
[2023-03-23 10:37:41] [INFO ] Deduced a trap composed of 21 places in 670 ms of which 7 ms to minimize.
[2023-03-23 10:37:41] [INFO ] Deduced a trap composed of 26 places in 445 ms of which 3 ms to minimize.
[2023-03-23 10:37:42] [INFO ] Deduced a trap composed of 31 places in 501 ms of which 1 ms to minimize.
[2023-03-23 10:37:42] [INFO ] Deduced a trap composed of 20 places in 272 ms of which 1 ms to minimize.
[2023-03-23 10:37:42] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 14 ms to minimize.
[2023-03-23 10:37:43] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 1 ms to minimize.
[2023-03-23 10:37:43] [INFO ] Deduced a trap composed of 18 places in 201 ms of which 1 ms to minimize.
[2023-03-23 10:37:43] [INFO ] Deduced a trap composed of 19 places in 241 ms of which 0 ms to minimize.
[2023-03-23 10:37:43] [INFO ] Deduced a trap composed of 27 places in 206 ms of which 1 ms to minimize.
[2023-03-23 10:37:44] [INFO ] Deduced a trap composed of 24 places in 234 ms of which 1 ms to minimize.
[2023-03-23 10:37:44] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 3 ms to minimize.
[2023-03-23 10:37:44] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2023-03-23 10:37:44] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 0 ms to minimize.
[2023-03-23 10:37:44] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 0 ms to minimize.
[2023-03-23 10:37:45] [INFO ] Deduced a trap composed of 26 places in 279 ms of which 1 ms to minimize.
[2023-03-23 10:37:45] [INFO ] Deduced a trap composed of 39 places in 243 ms of which 2 ms to minimize.
[2023-03-23 10:37:45] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 0 ms to minimize.
[2023-03-23 10:37:45] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 1 ms to minimize.
[2023-03-23 10:37:46] [INFO ] Deduced a trap composed of 33 places in 259 ms of which 1 ms to minimize.
[2023-03-23 10:37:46] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 6770 ms
[2023-03-23 10:37:46] [INFO ] Deduced a trap composed of 25 places in 455 ms of which 1 ms to minimize.
[2023-03-23 10:37:47] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 0 ms to minimize.
[2023-03-23 10:37:47] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 1 ms to minimize.
[2023-03-23 10:37:47] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 0 ms to minimize.
[2023-03-23 10:37:47] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 0 ms to minimize.
[2023-03-23 10:37:47] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 1 ms to minimize.
[2023-03-23 10:37:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1628 ms
[2023-03-23 10:37:48] [INFO ] Deduced a trap composed of 15 places in 514 ms of which 0 ms to minimize.
[2023-03-23 10:37:48] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 0 ms to minimize.
[2023-03-23 10:37:49] [INFO ] Deduced a trap composed of 34 places in 240 ms of which 2 ms to minimize.
[2023-03-23 10:37:49] [INFO ] Deduced a trap composed of 19 places in 501 ms of which 1 ms to minimize.
[2023-03-23 10:37:49] [INFO ] Deduced a trap composed of 25 places in 238 ms of which 1 ms to minimize.
[2023-03-23 10:37:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1949 ms
[2023-03-23 10:37:50] [INFO ] Deduced a trap composed of 42 places in 400 ms of which 2 ms to minimize.
[2023-03-23 10:37:50] [INFO ] Deduced a trap composed of 45 places in 321 ms of which 18 ms to minimize.
[2023-03-23 10:37:51] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 0 ms to minimize.
[2023-03-23 10:37:51] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 1 ms to minimize.
[2023-03-23 10:37:51] [INFO ] Deduced a trap composed of 18 places in 286 ms of which 0 ms to minimize.
[2023-03-23 10:37:51] [INFO ] Deduced a trap composed of 19 places in 334 ms of which 1 ms to minimize.
[2023-03-23 10:37:52] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 14 ms to minimize.
[2023-03-23 10:37:52] [INFO ] Deduced a trap composed of 23 places in 394 ms of which 0 ms to minimize.
[2023-03-23 10:37:52] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 0 ms to minimize.
[2023-03-23 10:37:52] [INFO ] Deduced a trap composed of 19 places in 199 ms of which 1 ms to minimize.
[2023-03-23 10:37:53] [INFO ] Deduced a trap composed of 23 places in 376 ms of which 1 ms to minimize.
[2023-03-23 10:37:53] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 0 ms to minimize.
[2023-03-23 10:37:53] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 11 ms to minimize.
[2023-03-23 10:37:54] [INFO ] Deduced a trap composed of 41 places in 279 ms of which 1 ms to minimize.
[2023-03-23 10:37:54] [INFO ] Deduced a trap composed of 47 places in 169 ms of which 0 ms to minimize.
[2023-03-23 10:37:54] [INFO ] Deduced a trap composed of 39 places in 299 ms of which 1 ms to minimize.
[2023-03-23 10:37:54] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 0 ms to minimize.
[2023-03-23 10:37:55] [INFO ] Deduced a trap composed of 22 places in 320 ms of which 0 ms to minimize.
[2023-03-23 10:37:55] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 0 ms to minimize.
[2023-03-23 10:37:55] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 1 ms to minimize.
[2023-03-23 10:37:55] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 1 ms to minimize.
[2023-03-23 10:37:56] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 1 ms to minimize.
[2023-03-23 10:37:56] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 0 ms to minimize.
[2023-03-23 10:37:56] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 1 ms to minimize.
[2023-03-23 10:37:56] [INFO ] Deduced a trap composed of 50 places in 219 ms of which 0 ms to minimize.
[2023-03-23 10:37:56] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 0 ms to minimize.
[2023-03-23 10:37:57] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 0 ms to minimize.
[2023-03-23 10:37:57] [INFO ] Deduced a trap composed of 58 places in 303 ms of which 1 ms to minimize.
[2023-03-23 10:37:57] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 1 ms to minimize.
[2023-03-23 10:37:58] [INFO ] Deduced a trap composed of 41 places in 487 ms of which 0 ms to minimize.
[2023-03-23 10:37:58] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 8142 ms
[2023-03-23 10:37:58] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 1 ms to minimize.
[2023-03-23 10:37:59] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 0 ms to minimize.
[2023-03-23 10:37:59] [INFO ] Deduced a trap composed of 22 places in 230 ms of which 11 ms to minimize.
[2023-03-23 10:37:59] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 0 ms to minimize.
[2023-03-23 10:37:59] [INFO ] Deduced a trap composed of 19 places in 241 ms of which 0 ms to minimize.
[2023-03-23 10:37:59] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 16 ms to minimize.
[2023-03-23 10:38:00] [INFO ] Deduced a trap composed of 35 places in 244 ms of which 45 ms to minimize.
[2023-03-23 10:38:00] [INFO ] Deduced a trap composed of 31 places in 217 ms of which 0 ms to minimize.
[2023-03-23 10:38:00] [INFO ] Deduced a trap composed of 26 places in 405 ms of which 1 ms to minimize.
[2023-03-23 10:38:01] [INFO ] Deduced a trap composed of 28 places in 314 ms of which 2 ms to minimize.
[2023-03-23 10:38:01] [INFO ] Deduced a trap composed of 25 places in 393 ms of which 0 ms to minimize.
[2023-03-23 10:38:02] [INFO ] Deduced a trap composed of 24 places in 361 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 10:38:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 10:38:02] [INFO ] After 25193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 146 ms.
Support contains 102 out of 683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 683/683 places, 633/633 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 683 transition count 581
Reduce places removed 52 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 60 rules applied. Total rules applied 112 place count 631 transition count 573
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 120 place count 623 transition count 573
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 120 place count 623 transition count 530
Deduced a syphon composed of 43 places in 4 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 206 place count 580 transition count 530
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 262 place count 524 transition count 474
Iterating global reduction 3 with 56 rules applied. Total rules applied 318 place count 524 transition count 474
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 318 place count 524 transition count 461
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 344 place count 511 transition count 461
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 552 place count 407 transition count 357
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 3 with 60 rules applied. Total rules applied 612 place count 407 transition count 357
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 613 place count 406 transition count 356
Applied a total of 613 rules in 165 ms. Remains 406 /683 variables (removed 277) and now considering 356/633 (removed 277) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 406/683 places, 356/633 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :1
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :1
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 356 rows 406 cols
[2023-03-23 10:38:02] [INFO ] Computed 111 place invariants in 7 ms
[2023-03-23 10:38:03] [INFO ] [Real]Absence check using 111 positive place invariants in 227 ms returned sat
[2023-03-23 10:38:03] [INFO ] After 327ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 10:38:03] [INFO ] [Nat]Absence check using 111 positive place invariants in 144 ms returned sat
[2023-03-23 10:38:04] [INFO ] After 579ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 10:38:04] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 1 ms to minimize.
[2023-03-23 10:38:04] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 0 ms to minimize.
[2023-03-23 10:38:04] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2023-03-23 10:38:04] [INFO ] Deduced a trap composed of 46 places in 333 ms of which 1 ms to minimize.
[2023-03-23 10:38:05] [INFO ] Deduced a trap composed of 39 places in 263 ms of which 0 ms to minimize.
[2023-03-23 10:38:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1226 ms
[2023-03-23 10:38:05] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 1 ms to minimize.
[2023-03-23 10:38:05] [INFO ] Deduced a trap composed of 10 places in 263 ms of which 39 ms to minimize.
[2023-03-23 10:38:06] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 1 ms to minimize.
[2023-03-23 10:38:06] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 0 ms to minimize.
[2023-03-23 10:38:06] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 1 ms to minimize.
[2023-03-23 10:38:06] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2023-03-23 10:38:07] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 1 ms to minimize.
[2023-03-23 10:38:07] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2023-03-23 10:38:07] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2023-03-23 10:38:07] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1938 ms
[2023-03-23 10:38:07] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 1 ms to minimize.
[2023-03-23 10:38:07] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 1 ms to minimize.
[2023-03-23 10:38:08] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 1 ms to minimize.
[2023-03-23 10:38:08] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 0 ms to minimize.
[2023-03-23 10:38:08] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2023-03-23 10:38:08] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 0 ms to minimize.
[2023-03-23 10:38:09] [INFO ] Deduced a trap composed of 12 places in 628 ms of which 1 ms to minimize.
[2023-03-23 10:38:09] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-23 10:38:09] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 1 ms to minimize.
[2023-03-23 10:38:09] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 13 ms to minimize.
[2023-03-23 10:38:09] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 0 ms to minimize.
[2023-03-23 10:38:09] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2259 ms
[2023-03-23 10:38:09] [INFO ] After 6280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 288 ms.
[2023-03-23 10:38:10] [INFO ] After 6976ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 37 ms.
Support contains 40 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 356/356 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 406 transition count 351
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 401 transition count 351
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 10 place count 401 transition count 339
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 34 place count 389 transition count 339
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 387 transition count 337
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 387 transition count 337
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 110 place count 351 transition count 301
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 126 place count 351 transition count 301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 350 transition count 300
Applied a total of 127 rules in 92 ms. Remains 350 /406 variables (removed 56) and now considering 300/356 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 350/406 places, 300/356 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :1
FORMULA ShieldPPPs-PT-010B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 300 rows 350 cols
[2023-03-23 10:38:10] [INFO ] Computed 111 place invariants in 4 ms
[2023-03-23 10:38:10] [INFO ] [Real]Absence check using 108 positive place invariants in 21 ms returned sat
[2023-03-23 10:38:10] [INFO ] [Real]Absence check using 108 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-23 10:38:10] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 10:38:10] [INFO ] [Nat]Absence check using 108 positive place invariants in 15 ms returned sat
[2023-03-23 10:38:10] [INFO ] [Nat]Absence check using 108 positive and 3 generalized place invariants in 0 ms returned sat
[2023-03-23 10:38:11] [INFO ] After 408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 10:38:11] [INFO ] Deduced a trap composed of 5 places in 312 ms of which 1 ms to minimize.
[2023-03-23 10:38:11] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 0 ms to minimize.
[2023-03-23 10:38:12] [INFO ] Deduced a trap composed of 20 places in 369 ms of which 1 ms to minimize.
[2023-03-23 10:38:12] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 0 ms to minimize.
[2023-03-23 10:38:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1207 ms
[2023-03-23 10:38:12] [INFO ] Deduced a trap composed of 7 places in 234 ms of which 1 ms to minimize.
[2023-03-23 10:38:13] [INFO ] Deduced a trap composed of 8 places in 353 ms of which 1 ms to minimize.
[2023-03-23 10:38:13] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 0 ms to minimize.
[2023-03-23 10:38:13] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 2 ms to minimize.
[2023-03-23 10:38:13] [INFO ] Deduced a trap composed of 8 places in 216 ms of which 0 ms to minimize.
[2023-03-23 10:38:14] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 1 ms to minimize.
[2023-03-23 10:38:14] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2023-03-23 10:38:14] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 0 ms to minimize.
[2023-03-23 10:38:14] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 2 ms to minimize.
[2023-03-23 10:38:14] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 1 ms to minimize.
[2023-03-23 10:38:14] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2314 ms
[2023-03-23 10:38:14] [INFO ] After 4187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 288 ms.
[2023-03-23 10:38:15] [INFO ] After 4583ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 24 ms.
Support contains 27 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 300/300 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 350 transition count 297
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 347 transition count 297
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 24 place count 338 transition count 288
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 27 place count 338 transition count 288
Applied a total of 27 rules in 50 ms. Remains 338 /350 variables (removed 12) and now considering 288/300 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 338/350 places, 288/300 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 294927 steps, run timeout after 3002 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 294927 steps, saw 67910 distinct states, run finished after 3005 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 288 rows 338 cols
[2023-03-23 10:38:18] [INFO ] Computed 111 place invariants in 4 ms
[2023-03-23 10:38:18] [INFO ] [Real]Absence check using 104 positive place invariants in 77 ms returned sat
[2023-03-23 10:38:18] [INFO ] [Real]Absence check using 104 positive and 7 generalized place invariants in 43 ms returned sat
[2023-03-23 10:38:18] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 10:38:18] [INFO ] [Nat]Absence check using 104 positive place invariants in 70 ms returned sat
[2023-03-23 10:38:18] [INFO ] [Nat]Absence check using 104 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 10:38:19] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 10:38:19] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2023-03-23 10:38:19] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 0 ms to minimize.
[2023-03-23 10:38:19] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 1 ms to minimize.
[2023-03-23 10:38:19] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2023-03-23 10:38:19] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 0 ms to minimize.
[2023-03-23 10:38:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 717 ms
[2023-03-23 10:38:20] [INFO ] Deduced a trap composed of 7 places in 444 ms of which 0 ms to minimize.
[2023-03-23 10:38:20] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2023-03-23 10:38:20] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2023-03-23 10:38:20] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2023-03-23 10:38:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 727 ms
[2023-03-23 10:38:20] [INFO ] After 1922ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 187 ms.
[2023-03-23 10:38:21] [INFO ] After 2295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 27 out of 338 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 338/338 places, 288/288 transitions.
Applied a total of 0 rules in 30 ms. Remains 338 /338 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 338/338 places, 288/288 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 338/338 places, 288/288 transitions.
Applied a total of 0 rules in 35 ms. Remains 338 /338 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2023-03-23 10:38:21] [INFO ] Invariant cache hit.
[2023-03-23 10:38:21] [INFO ] Implicit Places using invariants in 456 ms returned []
[2023-03-23 10:38:21] [INFO ] Invariant cache hit.
[2023-03-23 10:38:22] [INFO ] Implicit Places using invariants and state equation in 804 ms returned []
Implicit Place search using SMT with State Equation took 1266 ms to find 0 implicit places.
[2023-03-23 10:38:22] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-23 10:38:22] [INFO ] Invariant cache hit.
[2023-03-23 10:38:22] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1563 ms. Remains : 338/338 places, 288/288 transitions.
Applied a total of 0 rules in 7 ms. Remains 338 /338 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-23 10:38:22] [INFO ] Invariant cache hit.
[2023-03-23 10:38:22] [INFO ] [Real]Absence check using 104 positive place invariants in 24 ms returned sat
[2023-03-23 10:38:22] [INFO ] [Real]Absence check using 104 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 10:38:22] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 10:38:23] [INFO ] [Nat]Absence check using 104 positive place invariants in 174 ms returned sat
[2023-03-23 10:38:23] [INFO ] [Nat]Absence check using 104 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-23 10:38:23] [INFO ] After 477ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 10:38:23] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 1 ms to minimize.
[2023-03-23 10:38:24] [INFO ] Deduced a trap composed of 8 places in 356 ms of which 0 ms to minimize.
[2023-03-23 10:38:24] [INFO ] Deduced a trap composed of 8 places in 359 ms of which 1 ms to minimize.
[2023-03-23 10:38:24] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 1 ms to minimize.
[2023-03-23 10:38:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1073 ms
[2023-03-23 10:38:24] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2023-03-23 10:38:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2023-03-23 10:38:25] [INFO ] After 2013ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 249 ms.
[2023-03-23 10:38:25] [INFO ] After 2628ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-23 10:38:25] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-23 10:38:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 338 places, 288 transitions and 1252 arcs took 2 ms.
[2023-03-23 10:38:25] [INFO ] Flatten gal took : 125 ms
Total runtime 51314 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldPPPs (PT), instance 010B
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: 338 places, 288 transitions, 1252 arcs.
Final Score: 7630.369
Took : 13 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679567919861

--------------------
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 1891:
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="ShieldPPPs-PT-010B"
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 ShieldPPPs-PT-010B, 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-167903718800447"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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