About the Execution of LTSMin+red for CO4-PT-06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
414.907 | 5695.00 | 14227.00 | 37.30 | FFTFTFFFFFTTFFFF | normal |
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.r553-tall-171734900800047.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 ltsminxred
Input is CO4-PT-06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734900800047
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 97K Jun 2 16:33 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 CO4-PT-06-ReachabilityFireability-2024-00
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-01
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-02
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-03
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-04
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-05
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-06
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-07
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-08
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-09
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-10
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-11
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-12
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-13
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-14
FORMULA_NAME CO4-PT-06-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717351379151
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:03:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:03:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:03:00] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-06-02 18:03:00] [INFO ] Transformed 383 places.
[2024-06-02 18:03:00] [INFO ] Transformed 454 transitions.
[2024-06-02 18:03:00] [INFO ] Found NUPN structural information;
[2024-06-02 18:03:00] [INFO ] Parsed PT model containing 383 places and 454 transitions and 1016 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 100 places in 5 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-06-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-06-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (87 resets) in 1866 ms. (21 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (44 resets) in 248 ms. (160 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (49 resets) in 516 ms. (77 steps per ms) remains 11/12 properties
FORMULA CO4-PT-06-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (96 resets) in 428 ms. (93 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (74 resets) in 184 ms. (216 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (42 resets) in 303 ms. (131 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (41 resets) in 169 ms. (235 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (36 resets) in 178 ms. (223 steps per ms) remains 10/11 properties
FORMULA CO4-PT-06-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (57 resets) in 154 ms. (258 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (61 resets) in 214 ms. (186 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (24 resets) in 177 ms. (224 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (26 resets) in 221 ms. (180 steps per ms) remains 10/10 properties
// Phase 1: matrix 334 rows 283 cols
[2024-06-02 18:03:02] [INFO ] Computed 6 invariants in 22 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem CO4-PT-06-ReachabilityFireability-2024-00 is UNSAT
FORMULA CO4-PT-06-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem CO4-PT-06-ReachabilityFireability-2024-06 is UNSAT
FORMULA CO4-PT-06-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem CO4-PT-06-ReachabilityFireability-2024-08 is UNSAT
FORMULA CO4-PT-06-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem CO4-PT-06-ReachabilityFireability-2024-15 is UNSAT
FORMULA CO4-PT-06-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 206/279 variables, 5/78 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 206/284 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/284 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 4/283 variables, 1/285 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 4/289 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/289 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 334/617 variables, 283/572 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/617 variables, 0/572 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/617 variables, 0/572 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 617/617 variables, and 572 constraints, problems are : Problem set: 4 solved, 6 unsolved in 715 ms.
Refiners :[Domain max(s): 283/283 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/54 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Problem CO4-PT-06-ReachabilityFireability-2024-02 is UNSAT
FORMULA CO4-PT-06-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem CO4-PT-06-ReachabilityFireability-2024-04 is UNSAT
FORMULA CO4-PT-06-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 225/279 variables, 5/59 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 225/284 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 0/284 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/283 variables, 1/285 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 4/289 constraints. Problems are: Problem set: 6 solved, 4 unsolved
[2024-06-02 18:03:03] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 24 ms to minimize.
[2024-06-02 18:03:03] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 2/291 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/291 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 334/617 variables, 283/574 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/617 variables, 4/578 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/617 variables, 0/578 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/617 variables, 0/578 constraints. Problems are: Problem set: 6 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 617/617 variables, and 578 constraints, problems are : Problem set: 6 solved, 4 unsolved in 1078 ms.
Refiners :[Domain max(s): 283/283 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 4/10 constraints, Known Traps: 2/2 constraints]
After SMT, in 1900ms problems are : Problem set: 6 solved, 4 unsolved
FORMULA CO4-PT-06-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA CO4-PT-06-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA CO4-PT-06-ReachabilityFireability-2024-11 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 197 ms.
Support contains 18 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 334/334 transitions.
Graph (trivial) has 226 edges and 283 vertex of which 2 / 283 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 426 edges and 282 vertex of which 252 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 252 transition count 216
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 91 rules applied. Total rules applied 192 place count 167 transition count 210
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 197 place count 164 transition count 208
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 200 place count 163 transition count 206
Reduce places removed 1 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 4 with 17 rules applied. Total rules applied 217 place count 162 transition count 190
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 236 place count 146 transition count 187
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 236 place count 146 transition count 183
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 244 place count 142 transition count 183
Discarding 33 places :
Symmetric choice reduction at 6 with 33 rule applications. Total rules 277 place count 109 transition count 150
Iterating global reduction 6 with 33 rules applied. Total rules applied 310 place count 109 transition count 150
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 310 place count 109 transition count 147
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 316 place count 106 transition count 147
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 325 place count 97 transition count 138
Iterating global reduction 6 with 9 rules applied. Total rules applied 334 place count 97 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 335 place count 97 transition count 137
Performed 28 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 391 place count 69 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 392 place count 69 transition count 105
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 406 place count 62 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 408 place count 62 transition count 105
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 413 place count 57 transition count 95
Iterating global reduction 9 with 5 rules applied. Total rules applied 418 place count 57 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 420 place count 57 transition count 93
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 421 place count 56 transition count 90
Iterating global reduction 10 with 1 rules applied. Total rules applied 422 place count 56 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 423 place count 56 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 426 place count 56 transition count 86
Free-agglomeration rule applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 431 place count 56 transition count 81
Reduce places removed 5 places and 0 transitions.
Graph (complete) has 127 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 11 with 6 rules applied. Total rules applied 437 place count 50 transition count 81
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 438 place count 50 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 439 place count 50 transition count 79
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 13 with 4 rules applied. Total rules applied 443 place count 50 transition count 79
Graph (complete) has 125 edges and 50 vertex of which 49 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 1 rules applied. Total rules applied 444 place count 49 transition count 79
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 445 place count 49 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 446 place count 48 transition count 77
Applied a total of 446 rules in 83 ms. Remains 48 /283 variables (removed 235) and now considering 77/334 (removed 257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 48/283 places, 77/334 transitions.
RANDOM walk for 40000 steps (34 resets) in 448 ms. (89 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (28 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2679 steps, run visited all 1 properties in 13 ms. (steps per millisecond=206 )
Probabilistic random walk after 2679 steps, saw 844 distinct states, run finished after 16 ms. (steps per millisecond=167 ) properties seen :1
FORMULA CO4-PT-06-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 4487 ms.
ITS solved all properties within timeout
BK_STOP 1717351384846
--------------------
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 ReachabilityFireability -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="CO4-PT-06"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CO4-PT-06, 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 r553-tall-171734900800047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-06.tgz
mv CO4-PT-06 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 '
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 ;