Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r311-tall-171662335800054.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is QuasiCertifProtocol-COL-32, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335800054
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 6.5K Apr 13 04:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 13 04:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 03:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 13 03:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 13 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 13 04:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 13 04:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 131K May 18 16:43 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 QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-00
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-01
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-02
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-03
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-04
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-05
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-06
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-07
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-08
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-09
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-10
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-11
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-12
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-13
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-14
FORMULA_NAME QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716654704138

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-32
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 16:31:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 16:31:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:31:45] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 16:31:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 16:31:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 827 ms
[2024-05-25 16:31:46] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 37 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 16:31:46] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 10 ms.
[2024-05-25 16:31:46] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
RANDOM walk for 40068 steps (910 resets) in 733 ms. (54 steps per ms) remains 13/16 properties
BEST_FIRST walk for 40012 steps (377 resets) in 1146 ms. (34 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (504 resets) in 580 ms. (68 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40023 steps (298 resets) in 584 ms. (68 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (296 resets) in 233 ms. (170 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (272 resets) in 120 ms. (330 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (300 resets) in 308 ms. (129 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (297 resets) in 71 ms. (555 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40014 steps (503 resets) in 196 ms. (203 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40036 steps (516 resets) in 98 ms. (404 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (298 resets) in 109 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (392 resets) in 118 ms. (336 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (298 resets) in 67 ms. (588 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (492 resets) in 62 ms. (634 steps per ms) remains 13/13 properties
// Phase 1: matrix 26 rows 30 cols
[2024-05-25 16:31:47] [INFO ] Computed 5 invariants in 4 ms
Problem QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-01 is UNSAT
Problem QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-02 is UNSAT
Problem QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-03 is UNSAT
Problem QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-04 is UNSAT
Problem QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-05 is UNSAT
Problem QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-06 is UNSAT
Problem QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-07 is UNSAT
Problem QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-09 is UNSAT
Problem QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-10 is UNSAT
Problem QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-11 is UNSAT
Problem QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-14 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 26/56 variables, 30/35 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 11 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 11 solved, 2 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/25 variables, 5/5 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/51 variables, 25/30 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/31 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/31 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5/56 variables, 5/36 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 1/37 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/37 constraints. Problems are: Problem set: 11 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/37 constraints. Problems are: Problem set: 11 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 37 constraints, problems are : Problem set: 11 solved, 2 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 2/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 492ms problems are : Problem set: 11 solved, 2 unsolved
Finished Parikh walk after 195 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=195 )
Parikh walk visited 2 properties in 39 ms.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-25 16:31:48] [INFO ] Flatten gal took : 15 ms
[2024-05-25 16:31:48] [INFO ] Flatten gal took : 6 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
FORMULA QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-01 TRUE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-02 TRUE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-03 FALSE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-04 FALSE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-05 FALSE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-06 TRUE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-07 FALSE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-09 FALSE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-10 FALSE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-11 FALSE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-14 TRUE TECHNIQUES CPN_APPROX
Domain [tsid(33), tsid(33)] of place n9 breaks symmetries in sort tsid
[2024-05-25 16:31:48] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions 8173 arcs in 33 ms.
[2024-05-25 16:31:48] [INFO ] Unfolded 16 HLPN properties in 4 ms.
RANDOM walk for 40000 steps (1068 resets) in 1869 ms. (21 steps per ms) remains 3/5 properties
FORMULA QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (60 resets) in 178 ms. (223 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (44 resets) in 509 ms. (78 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (60 resets) in 4669 ms. (8 steps per ms) remains 3/3 properties
// Phase 1: matrix 506 rows 3806 cols
[2024-05-25 16:31:50] [INFO ] Computed 3301 invariants in 157 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3738 variables, 1120/1120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3738 variables, 0/1120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 35/3773 variables, 37/1157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3773/4312 variables, and 3269 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4221 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 3232/3264 constraints, State Equation: 0/3806 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3738 variables, 1120/1120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3738 variables, 0/1120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 35/3773 variables, 37/1157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3773 variables, 2112/3269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-25 16:32:02] [INFO ] Deduced a trap composed of 6 places in 2887 ms of which 183 ms to minimize.
SMT process timed out in 11489ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3738 out of 3806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 3805 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.22 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 86 ms. Remains 3805 /3806 variables (removed 1) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 3805/3806 places, 506/506 transitions.
RANDOM walk for 40000 steps (1069 resets) in 893 ms. (44 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (60 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (43 resets) in 316 ms. (126 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (60 resets) in 4277 ms. (9 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 378217 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :1 out of 3
Probabilistic random walk after 378217 steps, saw 71401 distinct states, run finished after 3007 ms. (steps per millisecond=125 ) properties seen :1
FORMULA QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 506 rows 3805 cols
[2024-05-25 16:32:06] [INFO ] Computed 3300 invariants in 77 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 71/340 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3465/3805 variables, 3298/3300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3805 variables, 0/3300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 506/4311 variables, 3805/7105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4311 variables, 0/7105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/4311 variables, 0/7105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4311/4311 variables, and 7105 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6912 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3298/3298 constraints, State Equation: 3805/3805 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 71/340 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3465/3805 variables, 3298/3300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3805 variables, 0/3300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 506/4311 variables, 3805/7105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4311 variables, 2/7107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4311 variables, 0/7107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/4311 variables, 0/7107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4311/4311 variables, and 7107 constraints, problems are : Problem set: 0 solved, 2 unsolved in 23974 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3298/3298 constraints, State Equation: 3805/3805 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 31046ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-08 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 193 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=48 )
FORMULA QuasiCertifProtocol-COL-32-ReachabilityCardinality-2024-12 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 275 ms.
All properties solved without resorting to model-checking.
Total runtime 52688 ms.
ITS solved all properties within timeout

BK_STOP 1716654757989

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -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="QuasiCertifProtocol-COL-32"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is QuasiCertifProtocol-COL-32, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r311-tall-171662335800054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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