fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r553-tall-171734900900110
Last Updated
July 7, 2024

About the Execution of LTSMin+red for CO4-PT-14

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
351.739 5661.00 13777.00 58.40 TFFTTTTFFFFFFFFT 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-171734900900110.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-14, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734900900110
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K 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 174K 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-14-ReachabilityCardinality-2024-00
FORMULA_NAME CO4-PT-14-ReachabilityCardinality-2024-01
FORMULA_NAME CO4-PT-14-ReachabilityCardinality-2024-02
FORMULA_NAME CO4-PT-14-ReachabilityCardinality-2024-03
FORMULA_NAME CO4-PT-14-ReachabilityCardinality-2024-04
FORMULA_NAME CO4-PT-14-ReachabilityCardinality-2024-05
FORMULA_NAME CO4-PT-14-ReachabilityCardinality-2024-06
FORMULA_NAME CO4-PT-14-ReachabilityCardinality-2024-07
FORMULA_NAME CO4-PT-14-ReachabilityCardinality-2024-08
FORMULA_NAME CO4-PT-14-ReachabilityCardinality-2024-09
FORMULA_NAME CO4-PT-14-ReachabilityCardinality-2024-10
FORMULA_NAME CO4-PT-14-ReachabilityCardinality-2024-11
FORMULA_NAME CO4-PT-14-ReachabilityCardinality-2024-12
FORMULA_NAME CO4-PT-14-ReachabilityCardinality-2024-13
FORMULA_NAME CO4-PT-14-ReachabilityCardinality-2024-14
FORMULA_NAME CO4-PT-14-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717351776227

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:09:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 18:09:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:09:37] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-06-02 18:09:37] [INFO ] Transformed 680 places.
[2024-06-02 18:09:37] [INFO ] Transformed 812 transitions.
[2024-06-02 18:09:37] [INFO ] Found NUPN structural information;
[2024-06-02 18:09:37] [INFO ] Parsed PT model containing 680 places and 812 transitions and 1822 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 100 places in 9 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-14-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (58 resets) in 1474 ms. (27 steps per ms) remains 7/11 properties
FORMULA CO4-PT-14-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-14-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-14-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-14-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (64 resets) in 483 ms. (82 steps per ms) remains 5/7 properties
FORMULA CO4-PT-14-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CO4-PT-14-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (116 resets) in 158 ms. (251 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (122 resets) in 337 ms. (118 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (100 resets) in 311 ms. (128 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (97 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (100 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
// Phase 1: matrix 692 rows 580 cols
[2024-06-02 18:09:38] [INFO ] Computed 8 invariants in 30 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 496/580 variables, 8/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 496/588 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 692/1272 variables, 580/1168 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1272 variables, 0/1168 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/1272 variables, 0/1168 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1272/1272 variables, and 1168 constraints, problems are : Problem set: 0 solved, 5 unsolved in 881 ms.
Refiners :[Domain max(s): 580/580 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem CO4-PT-14-ReachabilityCardinality-2024-04 is UNSAT
FORMULA CO4-PT-14-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 496/580 variables, 8/92 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 496/588 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-02 18:09:39] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 11 ms to minimize.
[2024-06-02 18:09:40] [INFO ] Deduced a trap composed of 93 places in 158 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 2/590 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 0/590 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 692/1272 variables, 580/1170 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1272 variables, 4/1174 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1272 variables, 0/1174 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1272 variables, 0/1174 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1272/1272 variables, and 1174 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1386 ms.
Refiners :[Domain max(s): 580/580 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 2390ms problems are : Problem set: 1 solved, 4 unsolved
FORMULA CO4-PT-14-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA CO4-PT-14-ReachabilityCardinality-2024-01 FALSE TECHNIQUES PARIKH_WALK
FORMULA CO4-PT-14-ReachabilityCardinality-2024-14 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 340 ms.
Support contains 19 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 692/692 transitions.
Graph (trivial) has 561 edges and 580 vertex of which 2 / 580 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 877 edges and 579 vertex of which 546 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.2 ms
Discarding 33 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 259 transitions
Trivial Post-agglo rules discarded 259 transitions
Performed 259 trivial Post agglomeration. Transition count delta: 259
Iterating post reduction 0 with 278 rules applied. Total rules applied 280 place count 546 transition count 395
Reduce places removed 259 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 266 rules applied. Total rules applied 546 place count 287 transition count 388
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 553 place count 284 transition count 384
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 556 place count 283 transition count 382
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 4 with 3 rules applied. Total rules applied 559 place count 282 transition count 380
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 5 with 15 rules applied. Total rules applied 574 place count 281 transition count 366
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 587 place count 268 transition count 366
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 587 place count 268 transition count 365
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 589 place count 267 transition count 365
Discarding 35 places :
Symmetric choice reduction at 7 with 35 rule applications. Total rules 624 place count 232 transition count 330
Iterating global reduction 7 with 35 rules applied. Total rules applied 659 place count 232 transition count 330
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 11 Pre rules applied. Total rules applied 659 place count 232 transition count 319
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 681 place count 221 transition count 319
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 702 place count 200 transition count 298
Iterating global reduction 7 with 21 rules applied. Total rules applied 723 place count 200 transition count 298
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 7 with 5 rules applied. Total rules applied 728 place count 200 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 729 place count 199 transition count 293
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 731 place count 197 transition count 290
Iterating global reduction 9 with 2 rules applied. Total rules applied 733 place count 197 transition count 290
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 735 place count 197 transition count 288
Performed 66 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 10 with 132 rules applied. Total rules applied 867 place count 131 transition count 217
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 871 place count 131 transition count 213
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 11 with 62 rules applied. Total rules applied 933 place count 100 transition count 216
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 11 with 14 rules applied. Total rules applied 947 place count 100 transition count 202
Discarding 22 places :
Symmetric choice reduction at 12 with 22 rule applications. Total rules 969 place count 78 transition count 158
Iterating global reduction 12 with 22 rules applied. Total rules applied 991 place count 78 transition count 158
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 12 with 11 rules applied. Total rules applied 1002 place count 78 transition count 147
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1004 place count 76 transition count 142
Iterating global reduction 13 with 2 rules applied. Total rules applied 1006 place count 76 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1007 place count 76 transition count 141
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 1015 place count 76 transition count 133
Free-agglomeration rule applied 12 times.
Iterating global reduction 14 with 12 rules applied. Total rules applied 1027 place count 76 transition count 121
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 13 rules applied. Total rules applied 1040 place count 64 transition count 120
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 1043 place count 64 transition count 120
Graph (complete) has 182 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 15 with 1 rules applied. Total rules applied 1044 place count 63 transition count 120
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 1045 place count 63 transition count 119
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1046 place count 63 transition count 119
Graph (complete) has 179 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 1 rules applied. Total rules applied 1047 place count 62 transition count 119
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 1048 place count 62 transition count 118
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 1049 place count 62 transition count 118
Graph (complete) has 176 edges and 62 vertex of which 61 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 19 with 1 rules applied. Total rules applied 1050 place count 61 transition count 118
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 1051 place count 61 transition count 117
Applied a total of 1051 rules in 142 ms. Remains 61 /580 variables (removed 519) and now considering 117/692 (removed 575) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 61/580 places, 117/692 transitions.
RANDOM walk for 40000 steps (8 resets) in 423 ms. (94 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 11094 steps, run visited all 1 properties in 32 ms. (steps per millisecond=346 )
Probabilistic random walk after 11094 steps, saw 2914 distinct states, run finished after 35 ms. (steps per millisecond=316 ) properties seen :1
FORMULA CO4-PT-14-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 4548 ms.
ITS solved all properties within timeout

BK_STOP 1717351781888

--------------------
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="CO4-PT-14"
export BK_EXAMINATION="ReachabilityCardinality"
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-14, 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 r553-tall-171734900900110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-14.tgz
mv CO4-PT-14 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 ;