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.r073-smll-167814399600454.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 CloudDeployment-PT-7b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r073-smll-167814399600454
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 8.7K Feb 25 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 14:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 14:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 14:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:45 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 20M 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 CloudDeployment-PT-7b-ReachabilityCardinality-00
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-01
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-02
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-03
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-04
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-05
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-06
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-07
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-08
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-09
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-10
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-11
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-12
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-13
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-14
FORMULA_NAME CloudDeployment-PT-7b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678502040097

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-7b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 02:34:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 02:34:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:34:05] [INFO ] Load time of PNML (sax parser for PT used): 1309 ms
[2023-03-11 02:34:05] [INFO ] Transformed 2271 places.
[2023-03-11 02:34:05] [INFO ] Transformed 19752 transitions.
[2023-03-11 02:34:05] [INFO ] Found NUPN structural information;
[2023-03-11 02:34:05] [INFO ] Parsed PT model containing 2271 places and 19752 transitions and 389666 arcs in 1644 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
FORMULA CloudDeployment-PT-7b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 40 resets, run finished after 1065 ms. (steps per millisecond=9 ) properties (out of 14) seen :4
FORMULA CloudDeployment-PT-7b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :1
FORMULA CloudDeployment-PT-7b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :1
FORMULA CloudDeployment-PT-7b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 8 properties.
// Phase 1: matrix 19752 rows 2271 cols
[2023-03-11 02:34:08] [INFO ] Computed 29 place invariants in 852 ms
[2023-03-11 02:34:10] [INFO ] After 1934ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 02:34:11] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 35 ms returned sat
[2023-03-11 02:34:34] [INFO ] After 22369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-11 02:34:35] [INFO ] After 23653ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-11 02:34:35] [INFO ] After 25077ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
FORMULA CloudDeployment-PT-7b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 352 ms.
Support contains 77 out of 2271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2271/2271 places, 19752/19752 transitions.
Graph (trivial) has 2148 edges and 2271 vertex of which 482 / 2271 are part of one of the 47 SCC in 18 ms
Free SCC test removed 435 places
Drop transitions removed 8725 transitions
Reduce isomorphic transitions removed 8725 transitions.
Graph (complete) has 5590 edges and 1836 vertex of which 1822 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.42 ms
Discarding 14 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Ensure Unique test removed 1 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 780 transitions
Trivial Post-agglo rules discarded 780 transitions
Performed 780 trivial Post agglomeration. Transition count delta: 780
Iterating post reduction 0 with 787 rules applied. Total rules applied 789 place count 1821 transition count 10235
Reduce places removed 780 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 786 rules applied. Total rules applied 1575 place count 1041 transition count 10229
Reduce places removed 2 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 2 with 31 rules applied. Total rules applied 1606 place count 1039 transition count 10200
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 1636 place count 1010 transition count 10199
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 1636 place count 1010 transition count 10170
Deduced a syphon composed of 29 places in 8 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1694 place count 981 transition count 10170
Discarding 398 places :
Symmetric choice reduction at 4 with 398 rule applications. Total rules 2092 place count 583 transition count 1594
Iterating global reduction 4 with 398 rules applied. Total rules applied 2490 place count 583 transition count 1594
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 2526 place count 583 transition count 1558
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 2526 place count 583 transition count 1550
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 2542 place count 575 transition count 1550
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2546 place count 571 transition count 1546
Iterating global reduction 5 with 4 rules applied. Total rules applied 2550 place count 571 transition count 1546
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2553 place count 568 transition count 1543
Iterating global reduction 5 with 3 rules applied. Total rules applied 2556 place count 568 transition count 1543
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2559 place count 565 transition count 1540
Iterating global reduction 5 with 3 rules applied. Total rules applied 2562 place count 565 transition count 1540
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2564 place count 563 transition count 1538
Iterating global reduction 5 with 2 rules applied. Total rules applied 2566 place count 563 transition count 1538
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2567 place count 562 transition count 1537
Iterating global reduction 5 with 1 rules applied. Total rules applied 2568 place count 562 transition count 1537
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 3 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 5 with 258 rules applied. Total rules applied 2826 place count 433 transition count 1408
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -207
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 2908 place count 392 transition count 1615
Drop transitions removed 6 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 2921 place count 392 transition count 1602
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -72
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 2933 place count 386 transition count 1674
Drop transitions removed 129 transitions
Redundant transition composition rules discarded 129 transitions
Iterating global reduction 6 with 129 rules applied. Total rules applied 3062 place count 386 transition count 1545
Free-agglomeration rule applied 84 times with reduction of 23 identical transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 3146 place count 386 transition count 1438
Reduce places removed 84 places and 0 transitions.
Drop transitions removed 113 transitions
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 177 transitions.
Iterating post reduction 6 with 261 rules applied. Total rules applied 3407 place count 302 transition count 1261
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3408 place count 301 transition count 1253
Iterating global reduction 7 with 1 rules applied. Total rules applied 3409 place count 301 transition count 1253
Drop transitions removed 154 transitions
Redundant transition composition rules discarded 154 transitions
Iterating global reduction 7 with 154 rules applied. Total rules applied 3563 place count 301 transition count 1099
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 3568 place count 301 transition count 1120
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 3573 place count 296 transition count 1120
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 3579 place count 296 transition count 1120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 3580 place count 295 transition count 1119
Applied a total of 3580 rules in 3229 ms. Remains 295 /2271 variables (removed 1976) and now considering 1119/19752 (removed 18633) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3230 ms. Remains : 295/2271 places, 1119/19752 transitions.
Incomplete random walk after 10000 steps, including 189 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 7) seen :2
FORMULA CloudDeployment-PT-7b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-11 02:34:39] [INFO ] Flow matrix only has 734 transitions (discarded 385 similar events)
// Phase 1: matrix 734 rows 295 cols
[2023-03-11 02:34:39] [INFO ] Computed 27 place invariants in 5 ms
[2023-03-11 02:34:39] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 02:34:40] [INFO ] [Nat]Absence check using 0 positive and 27 generalized place invariants in 17 ms returned sat
[2023-03-11 02:34:40] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 02:34:40] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-11 02:34:40] [INFO ] After 176ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 02:34:40] [INFO ] After 478ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 249 ms.
[2023-03-11 02:34:41] [INFO ] After 1245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 54 ms.
Support contains 49 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 1119/1119 transitions.
Graph (trivial) has 128 edges and 295 vertex of which 20 / 295 are part of one of the 8 SCC in 1 ms
Free SCC test removed 12 places
Drop transitions removed 20 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 283 transition count 1082
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 273 transition count 1082
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 21 place count 273 transition count 1077
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 31 place count 268 transition count 1077
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 267 transition count 1069
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 267 transition count 1069
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 257 transition count 1059
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 57 place count 257 transition count 1055
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 256 transition count 1047
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 256 transition count 1047
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 63 place count 254 transition count 1074
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 254 transition count 1073
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 4 with 48 rules applied. Total rules applied 112 place count 254 transition count 1025
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 116 place count 254 transition count 1021
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 146 place count 250 transition count 995
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 148 place count 248 transition count 979
Iterating global reduction 5 with 2 rules applied. Total rules applied 150 place count 248 transition count 979
Applied a total of 150 rules in 208 ms. Remains 248 /295 variables (removed 47) and now considering 979/1119 (removed 140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 248/295 places, 979/1119 transitions.
Incomplete random walk after 10000 steps, including 223 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :1
FORMULA CloudDeployment-PT-7b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 02:34:41] [INFO ] Flow matrix only has 609 transitions (discarded 370 similar events)
// Phase 1: matrix 609 rows 248 cols
[2023-03-11 02:34:41] [INFO ] Computed 27 place invariants in 6 ms
[2023-03-11 02:34:41] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 02:34:42] [INFO ] [Nat]Absence check using 0 positive and 27 generalized place invariants in 14 ms returned sat
[2023-03-11 02:34:42] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 02:34:42] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-11 02:34:42] [INFO ] After 139ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 02:34:42] [INFO ] After 321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-11 02:34:42] [INFO ] After 862ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 21 ms.
Support contains 40 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 979/979 transitions.
Graph (trivial) has 84 edges and 248 vertex of which 4 / 248 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 246 transition count 972
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 243 transition count 972
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 242 transition count 971
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 242 transition count 971
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 238 transition count 967
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 238 transition count 965
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 24 place count 238 transition count 960
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 3 with 46 rules applied. Total rules applied 70 place count 233 transition count 919
Applied a total of 70 rules in 96 ms. Remains 233 /248 variables (removed 15) and now considering 919/979 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 233/248 places, 919/979 transitions.
Incomplete random walk after 10000 steps, including 235 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :1
FORMULA CloudDeployment-PT-7b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 3 properties.
[2023-03-11 02:34:43] [INFO ] Flow matrix only has 573 transitions (discarded 346 similar events)
// Phase 1: matrix 573 rows 233 cols
[2023-03-11 02:34:43] [INFO ] Computed 27 place invariants in 12 ms
[2023-03-11 02:34:43] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 02:34:43] [INFO ] [Nat]Absence check using 0 positive and 27 generalized place invariants in 10 ms returned sat
[2023-03-11 02:34:43] [INFO ] After 245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 02:34:43] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-11 02:34:43] [INFO ] After 84ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 02:34:43] [INFO ] After 275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-11 02:34:44] [INFO ] After 731ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 26 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 919/919 transitions.
Graph (trivial) has 87 edges and 233 vertex of which 4 / 233 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (complete) has 1877 edges and 231 vertex of which 213 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 213 transition count 862
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 27 place count 209 transition count 862
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 208 transition count 854
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 208 transition count 854
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 45 place count 200 transition count 846
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 54 place count 200 transition count 837
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 199 transition count 836
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 199 transition count 836
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 198 transition count 835
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 198 transition count 835
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 197 transition count 850
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 197 transition count 849
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 4 with 21 rules applied. Total rules applied 82 place count 197 transition count 828
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 84 place count 197 transition count 826
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 13 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 106 place count 195 transition count 806
Applied a total of 106 rules in 168 ms. Remains 195 /233 variables (removed 38) and now considering 806/919 (removed 113) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 195/233 places, 806/919 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 477045 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :{}
Probabilistic random walk after 477045 steps, saw 66311 distinct states, run finished after 3002 ms. (steps per millisecond=158 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 02:34:47] [INFO ] Flow matrix only has 467 transitions (discarded 339 similar events)
// Phase 1: matrix 467 rows 195 cols
[2023-03-11 02:34:47] [INFO ] Computed 25 place invariants in 3 ms
[2023-03-11 02:34:47] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 02:34:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-11 02:34:47] [INFO ] [Nat]Absence check using 5 positive and 20 generalized place invariants in 12 ms returned sat
[2023-03-11 02:34:47] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 02:34:47] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-11 02:34:47] [INFO ] After 87ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 02:34:48] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-11 02:34:48] [INFO ] After 565ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 13 ms.
Support contains 26 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 806/806 transitions.
Applied a total of 0 rules in 20 ms. Remains 195 /195 variables (removed 0) and now considering 806/806 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 195/195 places, 806/806 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 806/806 transitions.
Applied a total of 0 rules in 19 ms. Remains 195 /195 variables (removed 0) and now considering 806/806 (removed 0) transitions.
[2023-03-11 02:34:48] [INFO ] Flow matrix only has 467 transitions (discarded 339 similar events)
[2023-03-11 02:34:48] [INFO ] Invariant cache hit.
[2023-03-11 02:34:48] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-03-11 02:34:48] [INFO ] Flow matrix only has 467 transitions (discarded 339 similar events)
[2023-03-11 02:34:48] [INFO ] Invariant cache hit.
[2023-03-11 02:34:48] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-11 02:34:48] [INFO ] Implicit Places using invariants and state equation in 587 ms returned []
Implicit Place search using SMT with State Equation took 834 ms to find 0 implicit places.
[2023-03-11 02:34:49] [INFO ] Redundant transitions in 69 ms returned []
[2023-03-11 02:34:49] [INFO ] Flow matrix only has 467 transitions (discarded 339 similar events)
[2023-03-11 02:34:49] [INFO ] Invariant cache hit.
[2023-03-11 02:34:49] [INFO ] Dead Transitions using invariants and state equation in 801 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1733 ms. Remains : 195/195 places, 806/806 transitions.
Graph (trivial) has 147 edges and 195 vertex of which 32 / 195 are part of one of the 5 SCC in 0 ms
Free SCC test removed 27 places
Drop transitions removed 44 transitions
Ensure Unique test removed 341 transitions
Reduce isomorphic transitions removed 385 transitions.
Graph (complete) has 566 edges and 168 vertex of which 158 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 158 transition count 394
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 131 transition count 390
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 64 place count 129 transition count 388
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 66 place count 127 transition count 388
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 66 place count 127 transition count 378
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 86 place count 117 transition count 378
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 93 place count 110 transition count 371
Iterating global reduction 4 with 7 rules applied. Total rules applied 100 place count 110 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 101 place count 110 transition count 370
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 107 place count 104 transition count 328
Iterating global reduction 5 with 6 rules applied. Total rules applied 113 place count 104 transition count 328
Ensure Unique test removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Iterating post reduction 5 with 110 rules applied. Total rules applied 223 place count 104 transition count 218
Performed 13 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 249 place count 91 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 250 place count 91 transition count 202
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 256 place count 88 transition count 217
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 258 place count 88 transition count 215
Drop transitions removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 8 with 33 rules applied. Total rules applied 291 place count 88 transition count 182
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 292 place count 88 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 293 place count 87 transition count 181
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 299 place count 84 transition count 191
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 302 place count 84 transition count 188
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 304 place count 84 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 306 place count 82 transition count 186
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 312 place count 82 transition count 186
Applied a total of 312 rules in 44 ms. Remains 82 /195 variables (removed 113) and now considering 186/806 (removed 620) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 186 rows 82 cols
[2023-03-11 02:34:49] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-11 02:34:49] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 02:34:49] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-11 02:34:50] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 02:34:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 02:34:50] [INFO ] After 28ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 02:34:50] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-11 02:34:50] [INFO ] After 223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-11 02:34:50] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-11 02:34:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 195 places, 806 transitions and 5900 arcs took 9 ms.
[2023-03-11 02:34:50] [INFO ] Flatten gal took : 231 ms
Total runtime 47120 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/518/inv_0_ --invariant=/tmp/518/inv_1_ --invariant=/tmp/518/inv_2_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 15237992 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16076448 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 ReachabilityCardinality -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="CloudDeployment-PT-7b"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is CloudDeployment-PT-7b, 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 r073-smll-167814399600454"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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