Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r201-smll-167840347800479.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is HirschbergSinclair-PT-35, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347800479
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 12K Feb 26 02:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 02:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 02:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 02:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 26 02:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 26 02:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 02:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 02:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 544K Mar 5 18:22 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 HirschbergSinclair-PT-35-ReachabilityFireability-00
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-01
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-02
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-03
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-04
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-05
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-06
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-07
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-08
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-09
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-10
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-11
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-12
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-13
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-14
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678729085069

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-35
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-13 17:38:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 17:38:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:38:08] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2023-03-13 17:38:08] [INFO ] Transformed 998 places.
[2023-03-13 17:38:08] [INFO ] Transformed 922 transitions.
[2023-03-13 17:38:08] [INFO ] Parsed PT model containing 998 places and 922 transitions and 2806 arcs in 286 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 10 resets, run finished after 486 ms. (steps per millisecond=20 ) properties (out of 16) seen :13
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 922 rows 998 cols
[2023-03-13 17:38:09] [INFO ] Computed 76 place invariants in 52 ms
[2023-03-13 17:38:10] [INFO ] [Real]Absence check using 70 positive place invariants in 48 ms returned sat
[2023-03-13 17:38:10] [INFO ] [Real]Absence check using 70 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-13 17:38:11] [INFO ] After 1917ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 17:38:11] [INFO ] [Nat]Absence check using 70 positive place invariants in 50 ms returned sat
[2023-03-13 17:38:11] [INFO ] [Nat]Absence check using 70 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-13 17:38:15] [INFO ] After 3384ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 17:38:16] [INFO ] Deduced a trap composed of 18 places in 518 ms of which 16 ms to minimize.
[2023-03-13 17:38:16] [INFO ] Deduced a trap composed of 97 places in 446 ms of which 2 ms to minimize.
[2023-03-13 17:38:17] [INFO ] Deduced a trap composed of 14 places in 482 ms of which 1 ms to minimize.
[2023-03-13 17:38:17] [INFO ] Deduced a trap composed of 160 places in 520 ms of which 3 ms to minimize.
[2023-03-13 17:38:18] [INFO ] Deduced a trap composed of 17 places in 397 ms of which 1 ms to minimize.
[2023-03-13 17:38:18] [INFO ] Deduced a trap composed of 14 places in 465 ms of which 1 ms to minimize.
[2023-03-13 17:38:19] [INFO ] Deduced a trap composed of 17 places in 501 ms of which 1 ms to minimize.
[2023-03-13 17:38:19] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3732 ms
[2023-03-13 17:38:21] [INFO ] Deduced a trap composed of 38 places in 485 ms of which 2 ms to minimize.
[2023-03-13 17:38:22] [INFO ] Deduced a trap composed of 39 places in 578 ms of which 1 ms to minimize.
[2023-03-13 17:38:23] [INFO ] Deduced a trap composed of 58 places in 539 ms of which 6 ms to minimize.
[2023-03-13 17:38:24] [INFO ] Deduced a trap composed of 17 places in 586 ms of which 2 ms to minimize.
[2023-03-13 17:38:24] [INFO ] Deduced a trap composed of 56 places in 556 ms of which 2 ms to minimize.
[2023-03-13 17:38:25] [INFO ] Deduced a trap composed of 17 places in 519 ms of which 1 ms to minimize.
[2023-03-13 17:38:26] [INFO ] Deduced a trap composed of 60 places in 493 ms of which 1 ms to minimize.
[2023-03-13 17:38:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5468 ms
[2023-03-13 17:38:27] [INFO ] Deduced a trap composed of 107 places in 524 ms of which 1 ms to minimize.
[2023-03-13 17:38:28] [INFO ] Deduced a trap composed of 105 places in 551 ms of which 1 ms to minimize.
[2023-03-13 17:38:29] [INFO ] Deduced a trap composed of 95 places in 499 ms of which 1 ms to minimize.
[2023-03-13 17:38:29] [INFO ] Deduced a trap composed of 32 places in 517 ms of which 1 ms to minimize.
[2023-03-13 17:38:30] [INFO ] Deduced a trap composed of 15 places in 603 ms of which 1 ms to minimize.
[2023-03-13 17:38:31] [INFO ] Deduced a trap composed of 103 places in 450 ms of which 1 ms to minimize.
[2023-03-13 17:38:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 3790 ms
[2023-03-13 17:38:31] [INFO ] After 19119ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 2021 ms.
[2023-03-13 17:38:33] [INFO ] After 21792ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 59 ms.
Support contains 64 out of 998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 998/998 places, 922/922 transitions.
Graph (complete) has 1924 edges and 998 vertex of which 963 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.6 ms
Discarding 35 places :
Also discarding 0 output transitions
Drop transitions removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 0 with 191 rules applied. Total rules applied 192 place count 963 transition count 731
Reduce places removed 191 places and 0 transitions.
Graph (complete) has 1404 edges and 772 vertex of which 727 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.3 ms
Discarding 45 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 192 rules applied. Total rules applied 384 place count 727 transition count 731
Drop transitions removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 2 with 45 rules applied. Total rules applied 429 place count 727 transition count 686
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 450 place count 706 transition count 665
Iterating global reduction 3 with 21 rules applied. Total rules applied 471 place count 706 transition count 665
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 489 place count 688 transition count 647
Iterating global reduction 3 with 18 rules applied. Total rules applied 507 place count 688 transition count 647
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 531 place count 688 transition count 623
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 555 place count 664 transition count 623
Reduce places removed 16 places and 16 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 571 place count 648 transition count 607
Applied a total of 571 rules in 453 ms. Remains 648 /998 variables (removed 350) and now considering 607/922 (removed 315) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 453 ms. Remains : 648/998 places, 607/922 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :1
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 607 rows 648 cols
[2023-03-13 17:38:34] [INFO ] Computed 41 place invariants in 11 ms
[2023-03-13 17:38:34] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 145 ms returned sat
[2023-03-13 17:38:34] [INFO ] After 281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 17:38:34] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 137 ms returned sat
[2023-03-13 17:38:35] [INFO ] After 586ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 17:38:35] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-13 17:38:35] [INFO ] After 424ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 17:38:35] [INFO ] After 637ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 384 ms.
[2023-03-13 17:38:36] [INFO ] After 1878ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 648 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 648/648 places, 607/607 transitions.
Graph (complete) has 1228 edges and 648 vertex of which 643 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 188 transitions
Trivial Post-agglo rules discarded 188 transitions
Performed 188 trivial Post agglomeration. Transition count delta: 188
Iterating post reduction 0 with 193 rules applied. Total rules applied 194 place count 643 transition count 414
Reduce places removed 189 places and 0 transitions.
Graph (complete) has 812 edges and 454 vertex of which 428 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.1 ms
Discarding 26 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 1 with 190 rules applied. Total rules applied 384 place count 428 transition count 413
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 409 place count 428 transition count 388
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 409 place count 428 transition count 377
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 431 place count 417 transition count 377
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 436 place count 412 transition count 372
Iterating global reduction 3 with 5 rules applied. Total rules applied 441 place count 412 transition count 372
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 444 place count 412 transition count 369
Reduce places removed 3 places and 0 transitions.
Graph (complete) has 749 edges and 409 vertex of which 403 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 4 rules applied. Total rules applied 448 place count 403 transition count 369
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 454 place count 403 transition count 363
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 455 place count 402 transition count 362
Iterating global reduction 6 with 1 rules applied. Total rules applied 456 place count 402 transition count 362
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 6 with 12 rules applied. Total rules applied 468 place count 402 transition count 350
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 480 place count 390 transition count 350
Reduce places removed 17 places and 17 transitions.
Iterating global reduction 7 with 17 rules applied. Total rules applied 497 place count 373 transition count 333
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 7 with 44 rules applied. Total rules applied 541 place count 368 transition count 294
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 8 with 39 rules applied. Total rules applied 580 place count 329 transition count 294
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 18 Pre rules applied. Total rules applied 580 place count 329 transition count 276
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 616 place count 311 transition count 276
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 617 place count 310 transition count 276
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 617 place count 310 transition count 275
Deduced a syphon composed of 1 places in 20 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 619 place count 309 transition count 275
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 20 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 625 place count 306 transition count 272
Applied a total of 625 rules in 292 ms. Remains 306 /648 variables (removed 342) and now considering 272/607 (removed 335) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 292 ms. Remains : 306/648 places, 272/607 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Finished Best-First random walk after 603 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=301 )
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 28610 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/527/inv_0_ --invariant=/tmp/527/inv_1_ --invariant=/tmp/527/inv_2_ --invariant=/tmp/527/inv_3_ --invariant=/tmp/527/inv_4_ --invariant=/tmp/527/inv_5_ --invariant=/tmp/527/inv_6_ --invariant=/tmp/527/inv_7_ --invariant=/tmp/527/inv_8_ --invariant=/tmp/527/inv_9_ --invariant=/tmp/527/inv_10_ --invariant=/tmp/527/inv_11_ --invariant=/tmp/527/inv_12_ --invariant=/tmp/527/inv_13_ --invariant=/tmp/527/inv_14_ --invariant=/tmp/527/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13139328 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098908 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023

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="HirschbergSinclair-PT-35"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is HirschbergSinclair-PT-35, 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 r201-smll-167840347800479"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-35.tgz
mv HirschbergSinclair-PT-35 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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;