About the Execution of LTSMin+red for CO4-PT-09
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
312.943 | 4621.00 | 11199.00 | 59.20 | FTFFFFFFTTTFTTFF | 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-171734900800071.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-09, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734900800071
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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 152K 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-09-ReachabilityFireability-2024-00
FORMULA_NAME CO4-PT-09-ReachabilityFireability-2024-01
FORMULA_NAME CO4-PT-09-ReachabilityFireability-2024-02
FORMULA_NAME CO4-PT-09-ReachabilityFireability-2024-03
FORMULA_NAME CO4-PT-09-ReachabilityFireability-2024-04
FORMULA_NAME CO4-PT-09-ReachabilityFireability-2024-05
FORMULA_NAME CO4-PT-09-ReachabilityFireability-2024-06
FORMULA_NAME CO4-PT-09-ReachabilityFireability-2024-07
FORMULA_NAME CO4-PT-09-ReachabilityFireability-2024-08
FORMULA_NAME CO4-PT-09-ReachabilityFireability-2024-09
FORMULA_NAME CO4-PT-09-ReachabilityFireability-2024-10
FORMULA_NAME CO4-PT-09-ReachabilityFireability-2024-11
FORMULA_NAME CO4-PT-09-ReachabilityFireability-2024-12
FORMULA_NAME CO4-PT-09-ReachabilityFireability-2024-13
FORMULA_NAME CO4-PT-09-ReachabilityFireability-2024-14
FORMULA_NAME CO4-PT-09-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717351519178
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-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:05:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:05:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:05:20] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-06-02 18:05:20] [INFO ] Transformed 467 places.
[2024-06-02 18:05:20] [INFO ] Transformed 634 transitions.
[2024-06-02 18:05:20] [INFO ] Found NUPN structural information;
[2024-06-02 18:05:20] [INFO ] Parsed PT model containing 467 places and 634 transitions and 1868 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 108 places in 6 ms
Reduce places removed 108 places and 163 transitions.
FORMULA CO4-PT-09-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (553 resets) in 1307 ms. (30 steps per ms) remains 7/12 properties
FORMULA CO4-PT-09-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-09-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-09-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-09-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-09-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (194 resets) in 207 ms. (192 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (262 resets) in 232 ms. (171 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (191 resets) in 340 ms. (117 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (199 resets) in 82 ms. (481 steps per ms) remains 6/7 properties
FORMULA CO4-PT-09-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (163 resets) in 118 ms. (336 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (217 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (256 resets) in 243 ms. (163 steps per ms) remains 6/6 properties
// Phase 1: matrix 471 rows 359 cols
[2024-06-02 18:05:21] [INFO ] Computed 9 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem CO4-PT-09-ReachabilityFireability-2024-02 is UNSAT
FORMULA CO4-PT-09-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem CO4-PT-09-ReachabilityFireability-2024-03 is UNSAT
FORMULA CO4-PT-09-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 303/348 variables, 5/50 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 303/353 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 0/353 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 6/354 variables, 2/355 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 6/361 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/361 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem CO4-PT-09-ReachabilityFireability-2024-04 is UNSAT
FORMULA CO4-PT-09-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 5/359 variables, 2/363 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 5/368 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/359 variables, 0/368 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 471/830 variables, 359/727 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/830 variables, 0/727 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/830 variables, 0/727 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 830/830 variables, and 727 constraints, problems are : Problem set: 3 solved, 3 unsolved in 622 ms.
Refiners :[Domain max(s): 359/359 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 359/359 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 317/333 variables, 3/19 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 317/336 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 0/336 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 19/352 variables, 4/340 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 19/359 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/359 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 7/359 variables, 2/361 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 7/368 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/359 variables, 0/368 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 471/830 variables, 359/727 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/830 variables, 3/730 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/830 variables, 0/730 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/830 variables, 0/730 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 830/830 variables, and 730 constraints, problems are : Problem set: 3 solved, 3 unsolved in 749 ms.
Refiners :[Domain max(s): 359/359 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 359/359 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1490ms problems are : Problem set: 3 solved, 3 unsolved
FORMULA CO4-PT-09-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA CO4-PT-09-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 232 ms.
Support contains 14 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 471/471 transitions.
Graph (trivial) has 307 edges and 359 vertex of which 2 / 359 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 757 edges and 358 vertex of which 338 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Discarding 20 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 147 rules applied. Total rules applied 149 place count 338 transition count 316
Reduce places removed 136 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 143 rules applied. Total rules applied 292 place count 202 transition count 309
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 7 rules applied. Total rules applied 299 place count 199 transition count 305
Reduce places removed 1 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 3 with 13 rules applied. Total rules applied 312 place count 198 transition count 293
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 325 place count 186 transition count 292
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 325 place count 186 transition count 291
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 327 place count 185 transition count 291
Discarding 36 places :
Symmetric choice reduction at 5 with 36 rule applications. Total rules 363 place count 149 transition count 253
Iterating global reduction 5 with 36 rules applied. Total rules applied 399 place count 149 transition count 253
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 5 rules applied. Total rules applied 404 place count 149 transition count 248
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 5 rules applied. Total rules applied 409 place count 147 transition count 245
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 410 place count 146 transition count 245
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 5 Pre rules applied. Total rules applied 410 place count 146 transition count 240
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 420 place count 141 transition count 240
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 436 place count 125 transition count 200
Iterating global reduction 8 with 16 rules applied. Total rules applied 452 place count 125 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 454 place count 125 transition count 198
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 456 place count 123 transition count 196
Iterating global reduction 9 with 2 rules applied. Total rules applied 458 place count 123 transition count 196
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 460 place count 123 transition count 194
Performed 33 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 10 with 66 rules applied. Total rules applied 526 place count 90 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 527 place count 90 transition count 156
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 11 with 32 rules applied. Total rules applied 559 place count 74 transition count 170
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 564 place count 74 transition count 165
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 574 place count 64 transition count 125
Iterating global reduction 12 with 10 rules applied. Total rules applied 584 place count 64 transition count 125
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 588 place count 64 transition count 121
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 590 place count 62 transition count 109
Iterating global reduction 13 with 2 rules applied. Total rules applied 592 place count 62 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 593 place count 62 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 14 with 8 rules applied. Total rules applied 601 place count 62 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 603 place count 61 transition count 111
Free-agglomeration rule applied 11 times.
Iterating global reduction 14 with 11 rules applied. Total rules applied 614 place count 61 transition count 100
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 14 with 11 rules applied. Total rules applied 625 place count 50 transition count 100
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 626 place count 50 transition count 99
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 629 place count 50 transition count 99
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 631 place count 50 transition count 99
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 632 place count 50 transition count 98
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 633 place count 49 transition count 97
Applied a total of 633 rules in 129 ms. Remains 49 /359 variables (removed 310) and now considering 97/471 (removed 374) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 49/359 places, 97/471 transitions.
RANDOM walk for 40000 steps (8 resets) in 408 ms. (97 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (8 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3845 steps, run visited all 1 properties in 20 ms. (steps per millisecond=192 )
Probabilistic random walk after 3845 steps, saw 1111 distinct states, run finished after 24 ms. (steps per millisecond=160 ) properties seen :1
FORMULA CO4-PT-09-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 3397 ms.
ITS solved all properties within timeout
BK_STOP 1717351523799
--------------------
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-09"
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-09, 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-171734900800071"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-09.tgz
mv CO4-PT-09 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 ;