About the Execution of LTSMin+red for FamilyReunion-COL-L01200M0120C060P060G030
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16191.424 | 192678.00 | 356231.00 | 816.60 | ??????T???T????? | 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.r492-smll-171636266900441.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 FamilyReunion-COL-L01200M0120C060P060G030, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266900441
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 6.8K Apr 11 20:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 20:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 20:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 20:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 20:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 11 20:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 20:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 20:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 24 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 211K May 18 16:42 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 FamilyReunion-COL-L01200M0120C060P060G030-CTLCardinality-2024-00
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-CTLCardinality-2024-01
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-CTLCardinality-2024-02
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-CTLCardinality-2024-03
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-CTLCardinality-2024-04
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-CTLCardinality-2024-05
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-CTLCardinality-2024-06
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-CTLCardinality-2024-07
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-CTLCardinality-2024-08
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-CTLCardinality-2024-09
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-CTLCardinality-2024-10
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-CTLCardinality-2024-11
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-CTLCardinality-2024-12
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-CTLCardinality-2024-13
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-CTLCardinality-2024-14
FORMULA_NAME FamilyReunion-COL-L01200M0120C060P060G030-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717269111755
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-COL-L01200M0120C060P060G030
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:11:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 19:11:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:11:54] [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-06-01 19:11:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 19:11:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1425 ms
[2024-06-01 19:11:56] [INFO ] Detected 5 constant HL places corresponding to 306 PT places.
[2024-06-01 19:11:56] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 4614109 PT places and 4406530.0 transition bindings in 120 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 27 ms.
[2024-06-01 19:11:56] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions 198 arcs in 11 ms.
[2024-06-01 19:11:56] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Initial state reduction rules removed 1 formulas.
FORMULA FamilyReunion-COL-L01200M0120C060P060G030-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 104 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA FamilyReunion-COL-L01200M0120C060P060G030-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 14 properties that can be checked using skeleton over-approximation.
Reduce places removed 5 places and 0 transitions.
Computed a total of 99 stabilizing places and 66 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 66
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 43280 steps (8 resets) in 132 ms. (325 steps per ms) remains 62/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 59/62 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 137 ms. (29 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 184 ms. (21 steps per ms) remains 41/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 106 ms. (37 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 82 ms. (48 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 102 ms. (38 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 40/40 properties
// Phase 1: matrix 66 rows 99 cols
[2024-06-01 19:11:57] [INFO ] Computed 33 invariants in 21 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp50 is UNSAT
At refinement iteration 1 (OVERLAPS) 30/69 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 6/10 constraints. Problems are: Problem set: 3 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 37 unsolved
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp43 is UNSAT
At refinement iteration 4 (OVERLAPS) 28/97 variables, 22/32 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/32 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 2/99 variables, 1/33 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/33 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 66/165 variables, 99/132 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/132 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 0/165 variables, 0/132 constraints. Problems are: Problem set: 5 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 132 constraints, problems are : Problem set: 5 solved, 35 unsolved in 1524 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 31/67 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 5/9 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/9 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 30/97 variables, 23/32 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/32 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 2/99 variables, 1/33 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/33 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 66/165 variables, 99/132 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 35/167 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/167 constraints. Problems are: Problem set: 5 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 0/165 variables, 0/167 constraints. Problems are: Problem set: 5 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 167 constraints, problems are : Problem set: 5 solved, 35 unsolved in 1864 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 35/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 3463ms problems are : Problem set: 5 solved, 35 unsolved
Fused 35 Parikh solutions to 31 different solutions.
Parikh walk visited 32 properties in 56678 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 66/66 transitions.
Graph (complete) has 123 edges and 99 vertex of which 78 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Discarding 21 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Discarding 15 places :
Implicit places reduction removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 63 transition count 15
Reduce places removed 41 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 1 with 44 rules applied. Total rules applied 101 place count 21 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 19 transition count 13
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 103 place count 19 transition count 6
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 121 place count 8 transition count 6
Discarding 1 places :
Implicit places reduction removed 1 places
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 3 with 3 rules applied. Total rules applied 124 place count 7 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 126 place count 5 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 126 place count 5 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 128 place count 4 transition count 3
Applied a total of 128 rules in 55 ms. Remains 4 /99 variables (removed 95) and now considering 3/66 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 4/99 places, 3/66 transitions.
RANDOM walk for 14424 steps (0 resets) in 19 ms. (721 steps per ms) remains 0/3 properties
Successfully simplified 5 atomic propositions for a total of 14 simplifications.
[2024-06-01 19:12:57] [INFO ] Flatten gal took : 49 ms
[2024-06-01 19:12:57] [INFO ] Flatten gal took : 21 ms
Transition Gate2ANDJoin forces synchronizations/join behavior on parameter l of sort LegalResident
Transition ReceiveLangChoice forces synchronizations/join behavior on parameter m of sort MICSystem
Symmetric sort wr.t. initial and guards and successors and join/free detected :CINFORMI
Symmetric sort wr.t. initial detected :CINFORMI
Symmetric sort wr.t. initial and guards detected :CINFORMI
Applying symmetric unfolding of full symmetric sort :CINFORMI domain size was 61
Transition Gate1ANDJoin forces synchronizations/join behavior on parameter p of sort PublicAdminOffice
Symmetric sort wr.t. initial and guards and successors and join/free detected :GovernmentCommission
Symmetric sort wr.t. initial detected :GovernmentCommission
Symmetric sort wr.t. initial and guards detected :GovernmentCommission
Applying symmetric unfolding of full symmetric sort :GovernmentCommission domain size was 31
Symmetric sort wr.t. initial and guards and successors and join/free detected :Response
Symmetric sort wr.t. initial detected :Response
Transition SendClearanceToRel : guard parameter $r(Response:2) in guard (EQ $r 0)introduces in Response(2) partition with 2 elements
[2024-06-01 19:13:08] [INFO ] Unfolded HLPN to a Petri net with 4073269 places and 3540609 transitions 10178597 arcs in 10736 ms.
[2024-06-01 19:13:08] [INFO ] Unfolded 14 HLPN properties in 337 ms.
Deduced a syphon composed of 1201 places in 13085 ms
Reduce places removed 1387 places and 0 transitions.
Support contains 2819238 out of 4071882 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4071882/4071882 places, 3540609/3540609 transitions.
Reduce places removed 1 places and 0 transitions.
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
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="FamilyReunion-COL-L01200M0120C060P060G030"
export BK_EXAMINATION="CTLCardinality"
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 FamilyReunion-COL-L01200M0120C060P060G030, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r492-smll-171636266900441"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L01200M0120C060P060G030.tgz
mv FamilyReunion-COL-L01200M0120C060P060G030 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;