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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 21:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 21:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 21:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 21:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 21:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 376K 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 ShieldPPPt-PT-020B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679575790697

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=ShieldPPPt-PT-020B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 12:49:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 12:49:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 12:49:53] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2023-03-23 12:49:54] [INFO ] Transformed 1563 places.
[2023-03-23 12:49:54] [INFO ] Transformed 1423 transitions.
[2023-03-23 12:49:54] [INFO ] Found NUPN structural information;
[2023-03-23 12:49:54] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 424 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 16) seen :6
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1423 rows 1563 cols
[2023-03-23 12:49:55] [INFO ] Computed 221 place invariants in 28 ms
[2023-03-23 12:49:56] [INFO ] After 981ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-23 12:49:57] [INFO ] [Nat]Absence check using 221 positive place invariants in 136 ms returned sat
[2023-03-23 12:49:59] [INFO ] After 2000ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-03-23 12:50:00] [INFO ] Deduced a trap composed of 32 places in 514 ms of which 9 ms to minimize.
[2023-03-23 12:50:00] [INFO ] Deduced a trap composed of 19 places in 696 ms of which 2 ms to minimize.
[2023-03-23 12:50:01] [INFO ] Deduced a trap composed of 31 places in 674 ms of which 19 ms to minimize.
[2023-03-23 12:50:02] [INFO ] Deduced a trap composed of 27 places in 508 ms of which 3 ms to minimize.
[2023-03-23 12:50:02] [INFO ] Deduced a trap composed of 20 places in 390 ms of which 1 ms to minimize.
[2023-03-23 12:50:03] [INFO ] Deduced a trap composed of 27 places in 304 ms of which 1 ms to minimize.
[2023-03-23 12:50:03] [INFO ] Deduced a trap composed of 44 places in 486 ms of which 2 ms to minimize.
[2023-03-23 12:50:04] [INFO ] Deduced a trap composed of 22 places in 329 ms of which 1 ms to minimize.
[2023-03-23 12:50:04] [INFO ] Deduced a trap composed of 25 places in 401 ms of which 2 ms to minimize.
[2023-03-23 12:50:04] [INFO ] Deduced a trap composed of 27 places in 346 ms of which 1 ms to minimize.
[2023-03-23 12:50:05] [INFO ] Deduced a trap composed of 37 places in 310 ms of which 1 ms to minimize.
[2023-03-23 12:50:05] [INFO ] Deduced a trap composed of 19 places in 327 ms of which 0 ms to minimize.
[2023-03-23 12:50:06] [INFO ] Deduced a trap composed of 31 places in 281 ms of which 1 ms to minimize.
[2023-03-23 12:50:06] [INFO ] Deduced a trap composed of 19 places in 750 ms of which 1 ms to minimize.
[2023-03-23 12:50:07] [INFO ] Deduced a trap composed of 19 places in 385 ms of which 1 ms to minimize.
[2023-03-23 12:50:07] [INFO ] Deduced a trap composed of 21 places in 287 ms of which 1 ms to minimize.
[2023-03-23 12:50:07] [INFO ] Deduced a trap composed of 23 places in 296 ms of which 2 ms to minimize.
[2023-03-23 12:50:08] [INFO ] Deduced a trap composed of 23 places in 379 ms of which 24 ms to minimize.
[2023-03-23 12:50:08] [INFO ] Deduced a trap composed of 20 places in 378 ms of which 1 ms to minimize.
[2023-03-23 12:50:09] [INFO ] Deduced a trap composed of 21 places in 279 ms of which 1 ms to minimize.
[2023-03-23 12:50:09] [INFO ] Deduced a trap composed of 35 places in 410 ms of which 0 ms to minimize.
[2023-03-23 12:50:10] [INFO ] Deduced a trap composed of 22 places in 273 ms of which 14 ms to minimize.
[2023-03-23 12:50:10] [INFO ] Deduced a trap composed of 28 places in 290 ms of which 1 ms to minimize.
[2023-03-23 12:50:10] [INFO ] Deduced a trap composed of 20 places in 521 ms of which 1 ms to minimize.
[2023-03-23 12:50:11] [INFO ] Deduced a trap composed of 26 places in 218 ms of which 1 ms to minimize.
[2023-03-23 12:50:11] [INFO ] Deduced a trap composed of 20 places in 282 ms of which 1 ms to minimize.
[2023-03-23 12:50:11] [INFO ] Deduced a trap composed of 18 places in 253 ms of which 0 ms to minimize.
[2023-03-23 12:50:12] [INFO ] Deduced a trap composed of 29 places in 426 ms of which 1 ms to minimize.
[2023-03-23 12:50:12] [INFO ] Deduced a trap composed of 21 places in 458 ms of which 1 ms to minimize.
[2023-03-23 12:50:13] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 0 ms to minimize.
[2023-03-23 12:50:13] [INFO ] Deduced a trap composed of 42 places in 329 ms of which 0 ms to minimize.
[2023-03-23 12:50:13] [INFO ] Deduced a trap composed of 41 places in 261 ms of which 0 ms to minimize.
[2023-03-23 12:50:14] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 1 ms to minimize.
[2023-03-23 12:50:14] [INFO ] Deduced a trap composed of 44 places in 252 ms of which 14 ms to minimize.
[2023-03-23 12:50:14] [INFO ] Deduced a trap composed of 39 places in 253 ms of which 1 ms to minimize.
[2023-03-23 12:50:14] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 15428 ms
[2023-03-23 12:50:15] [INFO ] Deduced a trap composed of 38 places in 373 ms of which 0 ms to minimize.
[2023-03-23 12:50:15] [INFO ] Deduced a trap composed of 39 places in 377 ms of which 13 ms to minimize.
[2023-03-23 12:50:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 992 ms
[2023-03-23 12:50:16] [INFO ] Deduced a trap composed of 18 places in 303 ms of which 1 ms to minimize.
[2023-03-23 12:50:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 419 ms
[2023-03-23 12:50:17] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 0 ms to minimize.
[2023-03-23 12:50:17] [INFO ] Deduced a trap composed of 38 places in 264 ms of which 1 ms to minimize.
[2023-03-23 12:50:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 695 ms
[2023-03-23 12:50:17] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 1 ms to minimize.
[2023-03-23 12:50:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 355 ms
[2023-03-23 12:50:18] [INFO ] Deduced a trap composed of 34 places in 386 ms of which 1 ms to minimize.
[2023-03-23 12:50:19] [INFO ] Deduced a trap composed of 25 places in 584 ms of which 13 ms to minimize.
[2023-03-23 12:50:19] [INFO ] Deduced a trap composed of 33 places in 325 ms of which 1 ms to minimize.
[2023-03-23 12:50:20] [INFO ] Deduced a trap composed of 35 places in 349 ms of which 0 ms to minimize.
[2023-03-23 12:50:20] [INFO ] Deduced a trap composed of 31 places in 262 ms of which 1 ms to minimize.
[2023-03-23 12:50:20] [INFO ] Deduced a trap composed of 31 places in 301 ms of which 1 ms to minimize.
[2023-03-23 12:50:21] [INFO ] Deduced a trap composed of 33 places in 530 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 12:50:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 12:50:21] [INFO ] After 25386ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 522 ms.
Support contains 96 out of 1563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Drop transitions removed 313 transitions
Trivial Post-agglo rules discarded 313 transitions
Performed 313 trivial Post agglomeration. Transition count delta: 313
Iterating post reduction 0 with 313 rules applied. Total rules applied 313 place count 1563 transition count 1110
Reduce places removed 313 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 1 with 340 rules applied. Total rules applied 653 place count 1250 transition count 1083
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 680 place count 1223 transition count 1083
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 680 place count 1223 transition count 1006
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 834 place count 1146 transition count 1006
Discarding 120 places :
Symmetric choice reduction at 3 with 120 rule applications. Total rules 954 place count 1026 transition count 886
Iterating global reduction 3 with 120 rules applied. Total rules applied 1074 place count 1026 transition count 886
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 1076 place count 1026 transition count 884
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1077 place count 1025 transition count 884
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 40 Pre rules applied. Total rules applied 1077 place count 1025 transition count 844
Deduced a syphon composed of 40 places in 4 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 1157 place count 985 transition count 844
Performed 310 Post agglomeration using F-continuation condition.Transition count delta: 310
Deduced a syphon composed of 310 places in 1 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 5 with 620 rules applied. Total rules applied 1777 place count 675 transition count 534
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 1861 place count 633 transition count 534
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 1864 place count 633 transition count 531
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1867 place count 630 transition count 531
Partial Free-agglomeration rule applied 51 times.
Drop transitions removed 51 transitions
Iterating global reduction 6 with 51 rules applied. Total rules applied 1918 place count 630 transition count 531
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1919 place count 629 transition count 530
Applied a total of 1919 rules in 474 ms. Remains 629 /1563 variables (removed 934) and now considering 530/1423 (removed 893) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 477 ms. Remains : 629/1563 places, 530/1423 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 9) seen :6
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 530 rows 629 cols
[2023-03-23 12:50:23] [INFO ] Computed 221 place invariants in 3 ms
[2023-03-23 12:50:23] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:50:23] [INFO ] [Nat]Absence check using 221 positive place invariants in 90 ms returned sat
[2023-03-23 12:50:24] [INFO ] After 616ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 12:50:24] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-23 12:50:24] [INFO ] After 326ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 12:50:24] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2023-03-23 12:50:24] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 2 ms to minimize.
[2023-03-23 12:50:25] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 14 ms to minimize.
[2023-03-23 12:50:25] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 1 ms to minimize.
[2023-03-23 12:50:25] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 0 ms to minimize.
[2023-03-23 12:50:25] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2023-03-23 12:50:25] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 0 ms to minimize.
[2023-03-23 12:50:25] [INFO ] Deduced a trap composed of 8 places in 216 ms of which 5 ms to minimize.
[2023-03-23 12:50:25] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2023-03-23 12:50:26] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 0 ms to minimize.
[2023-03-23 12:50:26] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 0 ms to minimize.
[2023-03-23 12:50:26] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 0 ms to minimize.
[2023-03-23 12:50:27] [INFO ] Deduced a trap composed of 4 places in 672 ms of which 1 ms to minimize.
[2023-03-23 12:50:27] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 1 ms to minimize.
[2023-03-23 12:50:27] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2023-03-23 12:50:27] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2879 ms
[2023-03-23 12:50:27] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 2 ms to minimize.
[2023-03-23 12:50:28] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2023-03-23 12:50:28] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2023-03-23 12:50:28] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 1 ms to minimize.
[2023-03-23 12:50:28] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 13 ms to minimize.
[2023-03-23 12:50:28] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 10 ms to minimize.
[2023-03-23 12:50:29] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 2 ms to minimize.
[2023-03-23 12:50:29] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 0 ms to minimize.
[2023-03-23 12:50:29] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 1 ms to minimize.
[2023-03-23 12:50:29] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2023-03-23 12:50:29] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 1 ms to minimize.
[2023-03-23 12:50:30] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2023-03-23 12:50:30] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 0 ms to minimize.
[2023-03-23 12:50:30] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2536 ms
[2023-03-23 12:50:30] [INFO ] After 6136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 400 ms.
[2023-03-23 12:50:30] [INFO ] After 7447ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 11 ms.
Support contains 83 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 530/530 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 629 transition count 528
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 627 transition count 527
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 626 transition count 527
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 6 place count 626 transition count 523
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 14 place count 622 transition count 523
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 619 transition count 520
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 32 place count 613 transition count 519
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 613 transition count 518
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 612 transition count 518
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 612 transition count 518
Applied a total of 35 rules in 115 ms. Remains 612 /629 variables (removed 17) and now considering 518/530 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 612/629 places, 518/530 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 134133 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 134133 steps, saw 101237 distinct states, run finished after 3002 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 518 rows 612 cols
[2023-03-23 12:50:34] [INFO ] Computed 221 place invariants in 2 ms
[2023-03-23 12:50:34] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:50:34] [INFO ] [Nat]Absence check using 221 positive place invariants in 36 ms returned sat
[2023-03-23 12:50:35] [INFO ] After 507ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 12:50:35] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-23 12:50:35] [INFO ] After 282ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 12:50:35] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 0 ms to minimize.
[2023-03-23 12:50:36] [INFO ] Deduced a trap composed of 6 places in 279 ms of which 1 ms to minimize.
[2023-03-23 12:50:36] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 0 ms to minimize.
[2023-03-23 12:50:36] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 0 ms to minimize.
[2023-03-23 12:50:36] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 0 ms to minimize.
[2023-03-23 12:50:36] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 1 ms to minimize.
[2023-03-23 12:50:37] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 0 ms to minimize.
[2023-03-23 12:50:37] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2023-03-23 12:50:37] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 0 ms to minimize.
[2023-03-23 12:50:37] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 0 ms to minimize.
[2023-03-23 12:50:37] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2032 ms
[2023-03-23 12:50:38] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 1 ms to minimize.
[2023-03-23 12:50:38] [INFO ] Deduced a trap composed of 7 places in 256 ms of which 0 ms to minimize.
[2023-03-23 12:50:38] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 1 ms to minimize.
[2023-03-23 12:50:38] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 0 ms to minimize.
[2023-03-23 12:50:39] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 1 ms to minimize.
[2023-03-23 12:50:39] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 0 ms to minimize.
[2023-03-23 12:50:39] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2023-03-23 12:50:39] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 0 ms to minimize.
[2023-03-23 12:50:39] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 0 ms to minimize.
[2023-03-23 12:50:39] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 1 ms to minimize.
[2023-03-23 12:50:40] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2023-03-23 12:50:40] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 0 ms to minimize.
[2023-03-23 12:50:40] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2487 ms
[2023-03-23 12:50:40] [INFO ] After 5150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 267 ms.
[2023-03-23 12:50:40] [INFO ] After 6180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 67 ms.
Support contains 83 out of 612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 518/518 transitions.
Applied a total of 0 rules in 22 ms. Remains 612 /612 variables (removed 0) and now considering 518/518 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 612/612 places, 518/518 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 518/518 transitions.
Applied a total of 0 rules in 23 ms. Remains 612 /612 variables (removed 0) and now considering 518/518 (removed 0) transitions.
[2023-03-23 12:50:40] [INFO ] Invariant cache hit.
[2023-03-23 12:50:41] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-23 12:50:41] [INFO ] Invariant cache hit.
[2023-03-23 12:50:41] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-23 12:50:42] [INFO ] Implicit Places using invariants and state equation in 1515 ms returned []
Implicit Place search using SMT with State Equation took 1927 ms to find 0 implicit places.
[2023-03-23 12:50:42] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-23 12:50:42] [INFO ] Invariant cache hit.
[2023-03-23 12:50:43] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2372 ms. Remains : 612/612 places, 518/518 transitions.
Partial Free-agglomeration rule applied 90 times.
Drop transitions removed 90 transitions
Iterating global reduction 0 with 90 rules applied. Total rules applied 90 place count 612 transition count 518
Applied a total of 90 rules in 75 ms. Remains 612 /612 variables (removed 0) and now considering 518/518 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 518 rows 612 cols
[2023-03-23 12:50:43] [INFO ] Computed 221 place invariants in 6 ms
[2023-03-23 12:50:43] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:50:43] [INFO ] [Nat]Absence check using 221 positive place invariants in 33 ms returned sat
[2023-03-23 12:50:44] [INFO ] After 472ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 12:50:44] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-23 12:50:44] [INFO ] After 525ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 12:50:45] [INFO ] Deduced a trap composed of 8 places in 328 ms of which 1 ms to minimize.
[2023-03-23 12:50:45] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 0 ms to minimize.
[2023-03-23 12:50:45] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 1 ms to minimize.
[2023-03-23 12:50:45] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 0 ms to minimize.
[2023-03-23 12:50:45] [INFO ] Deduced a trap composed of 5 places in 252 ms of which 1 ms to minimize.
[2023-03-23 12:50:45] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 0 ms to minimize.
[2023-03-23 12:50:46] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2023-03-23 12:50:46] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2023-03-23 12:50:46] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 1 ms to minimize.
[2023-03-23 12:50:46] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2023-03-23 12:50:46] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 0 ms to minimize.
[2023-03-23 12:50:47] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 0 ms to minimize.
[2023-03-23 12:50:47] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 0 ms to minimize.
[2023-03-23 12:50:47] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 0 ms to minimize.
[2023-03-23 12:50:47] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 1 ms to minimize.
[2023-03-23 12:50:47] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 0 ms to minimize.
[2023-03-23 12:50:47] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 0 ms to minimize.
[2023-03-23 12:50:48] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2023-03-23 12:50:48] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 0 ms to minimize.
[2023-03-23 12:50:48] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2023-03-23 12:50:48] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 1 ms to minimize.
[2023-03-23 12:50:48] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 0 ms to minimize.
[2023-03-23 12:50:49] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 26 ms to minimize.
[2023-03-23 12:50:49] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4465 ms
[2023-03-23 12:50:49] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 1 ms to minimize.
[2023-03-23 12:50:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2023-03-23 12:50:50] [INFO ] Deduced a trap composed of 4 places in 568 ms of which 0 ms to minimize.
[2023-03-23 12:50:50] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2023-03-23 12:50:50] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 0 ms to minimize.
[2023-03-23 12:50:51] [INFO ] Deduced a trap composed of 4 places in 376 ms of which 26 ms to minimize.
[2023-03-23 12:50:51] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 26 ms to minimize.
[2023-03-23 12:50:51] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 1 ms to minimize.
[2023-03-23 12:50:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2018 ms
[2023-03-23 12:50:51] [INFO ] After 7627ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 419 ms.
[2023-03-23 12:50:52] [INFO ] After 8787ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-23 12:50:52] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-23 12:50:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 612 places, 518 transitions and 2032 arcs took 5 ms.
[2023-03-23 12:50:52] [INFO ] Flatten gal took : 103 ms
Total runtime 58998 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldPPPt (PT), instance 020B
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: 612 places, 518 transitions, 2032 arcs.
Final Score: 10417.735
Took : 20 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679575873430

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 3243:
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="ShieldPPPt-PT-020B"
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 ShieldPPPt-PT-020B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r395-oct2-167903719000639"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-020B.tgz
mv ShieldPPPt-PT-020B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;