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.r405-oct2-167903725200068.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 lolaxred
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 r405-oct2-167903725200068
=====================================================================

--------------------
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 1679750029306

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=lolaxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldIIPs-PT-020B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-25 13:13:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-25 13:13:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-25 13:13:52] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2023-03-25 13:13:52] [INFO ] Transformed 1203 places.
[2023-03-25 13:13:52] [INFO ] Transformed 1183 transitions.
[2023-03-25 13:13:52] [INFO ] Found NUPN structural information;
[2023-03-25 13:13:52] [INFO ] Parsed PT model containing 1203 places and 1183 transitions and 3566 arcs in 288 ms.
Structural test allowed to assert that 542 places are NOT stable. Took 11 ms.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 626 ms. (steps per millisecond=15 ) properties (out of 661) seen :636
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) seen :0
Running SMT prover for 25 properties.
// Phase 1: matrix 1183 rows 1203 cols
[2023-03-25 13:13:53] [INFO ] Computed 181 place invariants in 16 ms
[2023-03-25 13:13:54] [INFO ] After 1293ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-25 13:13:55] [INFO ] [Nat]Absence check using 181 positive place invariants in 63 ms returned sat
[2023-03-25 13:13:58] [INFO ] After 2043ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :25
[2023-03-25 13:13:58] [INFO ] Deduced a trap composed of 17 places in 330 ms of which 6 ms to minimize.
[2023-03-25 13:13:59] [INFO ] Deduced a trap composed of 16 places in 424 ms of which 1 ms to minimize.
[2023-03-25 13:13:59] [INFO ] Deduced a trap composed of 36 places in 450 ms of which 6 ms to minimize.
[2023-03-25 13:14:00] [INFO ] Deduced a trap composed of 13 places in 419 ms of which 4 ms to minimize.
[2023-03-25 13:14:00] [INFO ] Deduced a trap composed of 25 places in 661 ms of which 1 ms to minimize.
[2023-03-25 13:14:01] [INFO ] Deduced a trap composed of 25 places in 369 ms of which 1 ms to minimize.
[2023-03-25 13:14:01] [INFO ] Deduced a trap composed of 36 places in 719 ms of which 1 ms to minimize.
[2023-03-25 13:14:02] [INFO ] Deduced a trap composed of 30 places in 593 ms of which 2 ms to minimize.
[2023-03-25 13:14:02] [INFO ] Deduced a trap composed of 17 places in 268 ms of which 1 ms to minimize.
[2023-03-25 13:14:03] [INFO ] Deduced a trap composed of 36 places in 276 ms of which 4 ms to minimize.
[2023-03-25 13:14:03] [INFO ] Deduced a trap composed of 33 places in 298 ms of which 0 ms to minimize.
[2023-03-25 13:14:03] [INFO ] Deduced a trap composed of 28 places in 250 ms of which 1 ms to minimize.
[2023-03-25 13:14:04] [INFO ] Deduced a trap composed of 26 places in 326 ms of which 3 ms to minimize.
[2023-03-25 13:14:04] [INFO ] Deduced a trap composed of 30 places in 251 ms of which 1 ms to minimize.
[2023-03-25 13:14:04] [INFO ] Deduced a trap composed of 25 places in 320 ms of which 1 ms to minimize.
[2023-03-25 13:14:05] [INFO ] Deduced a trap composed of 41 places in 267 ms of which 0 ms to minimize.
[2023-03-25 13:14:05] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 1 ms to minimize.
[2023-03-25 13:14:05] [INFO ] Deduced a trap composed of 29 places in 256 ms of which 1 ms to minimize.
[2023-03-25 13:14:06] [INFO ] Deduced a trap composed of 40 places in 248 ms of which 0 ms to minimize.
[2023-03-25 13:14:06] [INFO ] Deduced a trap composed of 32 places in 284 ms of which 2 ms to minimize.
[2023-03-25 13:14:06] [INFO ] Deduced a trap composed of 30 places in 312 ms of which 1 ms to minimize.
[2023-03-25 13:14:06] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 14 ms to minimize.
[2023-03-25 13:14:07] [INFO ] Deduced a trap composed of 29 places in 213 ms of which 0 ms to minimize.
[2023-03-25 13:14:07] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 0 ms to minimize.
[2023-03-25 13:14:07] [INFO ] Deduced a trap composed of 36 places in 224 ms of which 1 ms to minimize.
[2023-03-25 13:14:07] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 1 ms to minimize.
[2023-03-25 13:14:08] [INFO ] Deduced a trap composed of 19 places in 292 ms of which 0 ms to minimize.
[2023-03-25 13:14:08] [INFO ] Deduced a trap composed of 22 places in 257 ms of which 1 ms to minimize.
[2023-03-25 13:14:08] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 28 ms to minimize.
[2023-03-25 13:14:09] [INFO ] Deduced a trap composed of 19 places in 300 ms of which 0 ms to minimize.
[2023-03-25 13:14:09] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 0 ms to minimize.
[2023-03-25 13:14:09] [INFO ] Deduced a trap composed of 31 places in 240 ms of which 1 ms to minimize.
[2023-03-25 13:14:10] [INFO ] Deduced a trap composed of 21 places in 246 ms of which 14 ms to minimize.
[2023-03-25 13:14:10] [INFO ] Deduced a trap composed of 30 places in 312 ms of which 17 ms to minimize.
[2023-03-25 13:14:10] [INFO ] Deduced a trap composed of 27 places in 258 ms of which 0 ms to minimize.
[2023-03-25 13:14:11] [INFO ] Deduced a trap composed of 35 places in 310 ms of which 1 ms to minimize.
[2023-03-25 13:14:11] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 1 ms to minimize.
[2023-03-25 13:14:11] [INFO ] Deduced a trap composed of 15 places in 245 ms of which 0 ms to minimize.
[2023-03-25 13:14:11] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 1 ms to minimize.
[2023-03-25 13:14:12] [INFO ] Deduced a trap composed of 34 places in 303 ms of which 2 ms to minimize.
[2023-03-25 13:14:12] [INFO ] Deduced a trap composed of 28 places in 290 ms of which 1 ms to minimize.
[2023-03-25 13:14:12] [INFO ] Deduced a trap composed of 28 places in 218 ms of which 0 ms to minimize.
[2023-03-25 13:14:13] [INFO ] Deduced a trap composed of 28 places in 202 ms of which 3 ms to minimize.
[2023-03-25 13:14:13] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 1 ms to minimize.
[2023-03-25 13:14:13] [INFO ] Deduced a trap composed of 22 places in 218 ms of which 0 ms to minimize.
[2023-03-25 13:14:13] [INFO ] Deduced a trap composed of 26 places in 260 ms of which 0 ms to minimize.
[2023-03-25 13:14:14] [INFO ] Deduced a trap composed of 35 places in 231 ms of which 0 ms to minimize.
[2023-03-25 13:14:14] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 0 ms to minimize.
[2023-03-25 13:14:14] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 0 ms to minimize.
[2023-03-25 13:14:14] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 1 ms to minimize.
[2023-03-25 13:14:15] [INFO ] Deduced a trap composed of 28 places in 215 ms of which 2 ms to minimize.
[2023-03-25 13:14:15] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 0 ms to minimize.
[2023-03-25 13:14:15] [INFO ] Deduced a trap composed of 28 places in 215 ms of which 1 ms to minimize.
[2023-03-25 13:14:15] [INFO ] Deduced a trap composed of 32 places in 254 ms of which 1 ms to minimize.
[2023-03-25 13:14:16] [INFO ] Deduced a trap composed of 41 places in 187 ms of which 1 ms to minimize.
[2023-03-25 13:14:16] [INFO ] Deduced a trap composed of 23 places in 332 ms of which 12 ms to minimize.
[2023-03-25 13:14:16] [INFO ] Deduced a trap composed of 34 places in 266 ms of which 1 ms to minimize.
[2023-03-25 13:14:17] [INFO ] Deduced a trap composed of 27 places in 227 ms of which 0 ms to minimize.
[2023-03-25 13:14:17] [INFO ] Deduced a trap composed of 33 places in 208 ms of which 1 ms to minimize.
[2023-03-25 13:14:17] [INFO ] Deduced a trap composed of 28 places in 218 ms of which 0 ms to minimize.
[2023-03-25 13:14:17] [INFO ] Deduced a trap composed of 31 places in 192 ms of which 0 ms to minimize.
[2023-03-25 13:14:18] [INFO ] Deduced a trap composed of 26 places in 188 ms of which 1 ms to minimize.
[2023-03-25 13:14:18] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 0 ms to minimize.
[2023-03-25 13:14:18] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 4 ms to minimize.
[2023-03-25 13:14:18] [INFO ] Deduced a trap composed of 42 places in 207 ms of which 17 ms to minimize.
[2023-03-25 13:14:18] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 0 ms to minimize.
[2023-03-25 13:14:19] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 14 ms to minimize.
[2023-03-25 13:14:19] [INFO ] Deduced a trap composed of 47 places in 217 ms of which 9 ms to minimize.
[2023-03-25 13:14:19] [INFO ] Trap strengthening (SAT) tested/added 69/68 trap constraints in 21235 ms
[2023-03-25 13:14:19] [INFO ] Deduced a trap composed of 38 places in 217 ms of which 13 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 13:14:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-25 13:14:19] [INFO ] After 25185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:25
Fused 25 Parikh solutions to 24 different solutions.
Parikh walk visited 0 properties in 6758 ms.
Support contains 25 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 2 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 117 places :
Symmetric choice reduction at 2 with 117 rule applications. Total rules 521 place count 884 transition count 864
Iterating global reduction 2 with 117 rules applied. Total rules applied 638 place count 884 transition count 864
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 638 place count 884 transition count 804
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 758 place count 824 transition count 804
Performed 298 Post agglomeration using F-continuation condition.Transition count delta: 298
Deduced a syphon composed of 298 places in 2 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 2 with 596 rules applied. Total rules applied 1354 place count 526 transition count 506
Partial Free-agglomeration rule applied 138 times.
Drop transitions removed 138 transitions
Iterating global reduction 2 with 138 rules applied. Total rules applied 1492 place count 526 transition count 506
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1493 place count 525 transition count 505
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1494 place count 524 transition count 505
Applied a total of 1494 rules in 505 ms. Remains 524 /1203 variables (removed 679) and now considering 505/1183 (removed 678) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 506 ms. Remains : 524/1203 places, 505/1183 transitions.
Finished random walk after 3144 steps, including 0 resets, run visited all 25 properties in 41 ms. (steps per millisecond=76 )
Able to resolve query StableMarking after proving 662 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 35148 ms.
ITS solved all properties within timeout

BK_STOP 1679750067402

--------------------
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 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="lolaxred"
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 lolaxred"
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 r405-oct2-167903725200068"
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 ;