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.r409-oct2-167903727500068.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldIIPs-PT-020B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r409-oct2-167903727500068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 16:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 332K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1679770900589

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=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldIIPs-PT-020B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-25 19:01:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-25 19:01:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-25 19:01:43] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2023-03-25 19:01:43] [INFO ] Transformed 1203 places.
[2023-03-25 19:01:43] [INFO ] Transformed 1183 transitions.
[2023-03-25 19:01:43] [INFO ] Found NUPN structural information;
[2023-03-25 19:01:43] [INFO ] Parsed PT model containing 1203 places and 1183 transitions and 3566 arcs in 257 ms.
Structural test allowed to assert that 542 places are NOT stable. Took 10 ms.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 449 ms. (steps per millisecond=22 ) properties (out of 661) seen :624
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 37) seen :0
Running SMT prover for 37 properties.
// Phase 1: matrix 1183 rows 1203 cols
[2023-03-25 19:01:44] [INFO ] Computed 181 place invariants in 18 ms
[2023-03-25 19:01:45] [INFO ] After 1548ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:37
[2023-03-25 19:01:47] [INFO ] [Nat]Absence check using 181 positive place invariants in 164 ms returned sat
[2023-03-25 19:01:51] [INFO ] After 3414ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :37
[2023-03-25 19:01:52] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 18 ms to minimize.
[2023-03-25 19:01:52] [INFO ] Deduced a trap composed of 18 places in 322 ms of which 4 ms to minimize.
[2023-03-25 19:01:53] [INFO ] Deduced a trap composed of 24 places in 456 ms of which 1 ms to minimize.
[2023-03-25 19:01:53] [INFO ] Deduced a trap composed of 19 places in 257 ms of which 1 ms to minimize.
[2023-03-25 19:01:53] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 1 ms to minimize.
[2023-03-25 19:01:53] [INFO ] Deduced a trap composed of 23 places in 224 ms of which 1 ms to minimize.
[2023-03-25 19:01:54] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 2 ms to minimize.
[2023-03-25 19:01:54] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 0 ms to minimize.
[2023-03-25 19:01:54] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 0 ms to minimize.
[2023-03-25 19:01:54] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 1 ms to minimize.
[2023-03-25 19:01:54] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 0 ms to minimize.
[2023-03-25 19:01:55] [INFO ] Deduced a trap composed of 23 places in 426 ms of which 1 ms to minimize.
[2023-03-25 19:01:56] [INFO ] Deduced a trap composed of 23 places in 1085 ms of which 1 ms to minimize.
[2023-03-25 19:01:56] [INFO ] Deduced a trap composed of 15 places in 264 ms of which 1 ms to minimize.
[2023-03-25 19:01:57] [INFO ] Deduced a trap composed of 21 places in 290 ms of which 1 ms to minimize.
[2023-03-25 19:01:57] [INFO ] Deduced a trap composed of 24 places in 342 ms of which 0 ms to minimize.
[2023-03-25 19:01:57] [INFO ] Deduced a trap composed of 25 places in 264 ms of which 1 ms to minimize.
[2023-03-25 19:01:58] [INFO ] Deduced a trap composed of 19 places in 328 ms of which 1 ms to minimize.
[2023-03-25 19:01:58] [INFO ] Deduced a trap composed of 21 places in 260 ms of which 1 ms to minimize.
[2023-03-25 19:01:58] [INFO ] Deduced a trap composed of 46 places in 238 ms of which 1 ms to minimize.
[2023-03-25 19:01:59] [INFO ] Deduced a trap composed of 39 places in 316 ms of which 0 ms to minimize.
[2023-03-25 19:01:59] [INFO ] Deduced a trap composed of 31 places in 243 ms of which 4 ms to minimize.
[2023-03-25 19:01:59] [INFO ] Deduced a trap composed of 30 places in 191 ms of which 1 ms to minimize.
[2023-03-25 19:01:59] [INFO ] Deduced a trap composed of 66 places in 229 ms of which 1 ms to minimize.
[2023-03-25 19:02:00] [INFO ] Deduced a trap composed of 54 places in 255 ms of which 1 ms to minimize.
[2023-03-25 19:02:00] [INFO ] Deduced a trap composed of 30 places in 257 ms of which 0 ms to minimize.
[2023-03-25 19:02:00] [INFO ] Deduced a trap composed of 28 places in 203 ms of which 0 ms to minimize.
[2023-03-25 19:02:01] [INFO ] Deduced a trap composed of 25 places in 257 ms of which 0 ms to minimize.
[2023-03-25 19:02:01] [INFO ] Deduced a trap composed of 13 places in 242 ms of which 0 ms to minimize.
[2023-03-25 19:02:01] [INFO ] Deduced a trap composed of 28 places in 217 ms of which 0 ms to minimize.
[2023-03-25 19:02:01] [INFO ] Deduced a trap composed of 36 places in 192 ms of which 1 ms to minimize.
[2023-03-25 19:02:02] [INFO ] Deduced a trap composed of 40 places in 236 ms of which 2 ms to minimize.
[2023-03-25 19:02:02] [INFO ] Deduced a trap composed of 14 places in 336 ms of which 0 ms to minimize.
[2023-03-25 19:02:02] [INFO ] Deduced a trap composed of 28 places in 299 ms of which 1 ms to minimize.
[2023-03-25 19:02:03] [INFO ] Deduced a trap composed of 17 places in 294 ms of which 1 ms to minimize.
[2023-03-25 19:02:03] [INFO ] Deduced a trap composed of 13 places in 331 ms of which 1 ms to minimize.
[2023-03-25 19:02:04] [INFO ] Deduced a trap composed of 36 places in 303 ms of which 1 ms to minimize.
[2023-03-25 19:02:04] [INFO ] Deduced a trap composed of 33 places in 274 ms of which 1 ms to minimize.
[2023-03-25 19:02:04] [INFO ] Deduced a trap composed of 19 places in 278 ms of which 1 ms to minimize.
[2023-03-25 19:02:05] [INFO ] Deduced a trap composed of 31 places in 255 ms of which 2 ms to minimize.
[2023-03-25 19:02:05] [INFO ] Deduced a trap composed of 27 places in 237 ms of which 0 ms to minimize.
[2023-03-25 19:02:05] [INFO ] Deduced a trap composed of 35 places in 245 ms of which 0 ms to minimize.
[2023-03-25 19:02:05] [INFO ] Deduced a trap composed of 31 places in 247 ms of which 0 ms to minimize.
[2023-03-25 19:02:06] [INFO ] Deduced a trap composed of 29 places in 230 ms of which 0 ms to minimize.
[2023-03-25 19:02:06] [INFO ] Deduced a trap composed of 20 places in 358 ms of which 1 ms to minimize.
[2023-03-25 19:02:06] [INFO ] Deduced a trap composed of 10 places in 280 ms of which 1 ms to minimize.
[2023-03-25 19:02:07] [INFO ] Deduced a trap composed of 20 places in 407 ms of which 0 ms to minimize.
[2023-03-25 19:02:07] [INFO ] Deduced a trap composed of 21 places in 269 ms of which 0 ms to minimize.
[2023-03-25 19:02:08] [INFO ] Deduced a trap composed of 20 places in 250 ms of which 0 ms to minimize.
[2023-03-25 19:02:08] [INFO ] Deduced a trap composed of 29 places in 245 ms of which 1 ms to minimize.
[2023-03-25 19:02:08] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 1 ms to minimize.
[2023-03-25 19:02:08] [INFO ] Deduced a trap composed of 29 places in 262 ms of which 0 ms to minimize.
[2023-03-25 19:02:09] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 1 ms to minimize.
[2023-03-25 19:02:09] [INFO ] Deduced a trap composed of 36 places in 260 ms of which 1 ms to minimize.
[2023-03-25 19:02:09] [INFO ] Deduced a trap composed of 30 places in 389 ms of which 2 ms to minimize.
[2023-03-25 19:02:10] [INFO ] Deduced a trap composed of 33 places in 328 ms of which 26 ms to minimize.
[2023-03-25 19:02:10] [INFO ] Deduced a trap composed of 31 places in 352 ms of which 1 ms to minimize.
[2023-03-25 19:02:11] [INFO ] Deduced a trap composed of 11 places in 493 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.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-25 19:02:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-25 19:02:11] [INFO ] After 25508ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:37
Parikh walk visited 0 properties in 20378 ms.
Support contains 37 out of 1203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1203 transition count 1082
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 1102 transition count 1082
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 1102 transition count 981
Deduced a syphon composed of 101 places in 9 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 1001 transition count 981
Discarding 110 places :
Symmetric choice reduction at 2 with 110 rule applications. Total rules 514 place count 891 transition count 871
Iterating global reduction 2 with 110 rules applied. Total rules applied 624 place count 891 transition count 871
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 624 place count 891 transition count 811
Deduced a syphon composed of 60 places in 7 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 744 place count 831 transition count 811
Performed 293 Post agglomeration using F-continuation condition.Transition count delta: 293
Deduced a syphon composed of 293 places in 5 ms
Reduce places removed 293 places and 0 transitions.
Iterating global reduction 2 with 586 rules applied. Total rules applied 1330 place count 538 transition count 518
Partial Free-agglomeration rule applied 138 times.
Drop transitions removed 138 transitions
Iterating global reduction 2 with 138 rules applied. Total rules applied 1468 place count 538 transition count 518
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1469 place count 537 transition count 517
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1470 place count 536 transition count 517
Applied a total of 1470 rules in 279 ms. Remains 536 /1203 variables (removed 667) and now considering 517/1183 (removed 666) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 536/1203 places, 517/1183 transitions.
Finished random walk after 2144 steps, including 0 resets, run visited all 37 properties in 57 ms. (steps per millisecond=37 )
Able to resolve query StableMarking after proving 662 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 48826 ms.
ITS solved all properties within timeout

BK_STOP 1679770952146

--------------------
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 StableMarking -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-020B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is ShieldIIPs-PT-020B, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r409-oct2-167903727500068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-020B.tgz
mv ShieldIIPs-PT-020B execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;