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.r106-tall-167814483100745.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 marciexred
Input is DLCround-PT-11a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483100745
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.7K Feb 25 20:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 20:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 19:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 19:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 21:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 25 21:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 20:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 20:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 762K 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 DLCround-PT-11a-CTLCardinality-00
FORMULA_NAME DLCround-PT-11a-CTLCardinality-01
FORMULA_NAME DLCround-PT-11a-CTLCardinality-02
FORMULA_NAME DLCround-PT-11a-CTLCardinality-03
FORMULA_NAME DLCround-PT-11a-CTLCardinality-04
FORMULA_NAME DLCround-PT-11a-CTLCardinality-05
FORMULA_NAME DLCround-PT-11a-CTLCardinality-06
FORMULA_NAME DLCround-PT-11a-CTLCardinality-07
FORMULA_NAME DLCround-PT-11a-CTLCardinality-08
FORMULA_NAME DLCround-PT-11a-CTLCardinality-09
FORMULA_NAME DLCround-PT-11a-CTLCardinality-10
FORMULA_NAME DLCround-PT-11a-CTLCardinality-11
FORMULA_NAME DLCround-PT-11a-CTLCardinality-12
FORMULA_NAME DLCround-PT-11a-CTLCardinality-13
FORMULA_NAME DLCround-PT-11a-CTLCardinality-14
FORMULA_NAME DLCround-PT-11a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678465767535

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=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-11a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 16:29:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 16:29:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 16:29:29] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2023-03-10 16:29:29] [INFO ] Transformed 377 places.
[2023-03-10 16:29:29] [INFO ] Transformed 2993 transitions.
[2023-03-10 16:29:29] [INFO ] Found NUPN structural information;
[2023-03-10 16:29:29] [INFO ] Parsed PT model containing 377 places and 2993 transitions and 11677 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Ensure Unique test removed 280 transitions
Reduce redundant transitions removed 280 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA DLCround-PT-11a-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-11a-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 103 out of 377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 377/377 places, 2713/2713 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 360 transition count 2440
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 360 transition count 2440
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 360 transition count 2438
Drop transitions removed 801 transitions
Redundant transition composition rules discarded 801 transitions
Iterating global reduction 1 with 801 rules applied. Total rules applied 837 place count 360 transition count 1637
Applied a total of 837 rules in 106 ms. Remains 360 /377 variables (removed 17) and now considering 1637/2713 (removed 1076) transitions.
[2023-03-10 16:29:29] [INFO ] Flow matrix only has 215 transitions (discarded 1422 similar events)
// Phase 1: matrix 215 rows 360 cols
[2023-03-10 16:29:29] [INFO ] Computed 244 place invariants in 19 ms
[2023-03-10 16:29:30] [INFO ] Implicit Places using invariants in 981 ms returned [133, 134, 135, 139, 141, 142, 143, 144, 145, 148, 149, 150, 153, 155, 157, 158, 159, 160, 161, 164, 165, 166, 168, 169, 170, 172, 173, 174, 175, 176, 178, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 193, 196, 197, 198, 199, 200, 201, 202, 203, 204, 206, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 219, 220, 223, 224, 225, 226, 227, 229, 230, 233, 234, 235, 236, 237, 238, 239, 242, 244, 245, 246, 247, 248, 249, 251, 252, 254, 255, 257, 258, 260, 261, 262, 263, 265, 266, 267, 268, 269, 271, 273, 275, 276, 277, 278, 279, 280, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 294, 295, 296, 299, 300, 302, 303, 304, 305, 306, 307, 308, 310, 314, 315, 317, 318, 319, 320, 321, 322, 324, 325, 328, 329, 330, 331, 332, 334, 335, 336, 337, 338, 340, 342, 344, 345, 347, 348, 350, 351, 352, 354, 355, 356, 357, 358, 359]
Discarding 169 places :
Ensure Unique test removed 978 transitions
Reduce isomorphic transitions removed 978 transitions.
Implicit Place search using SMT only with invariants took 1013 ms to find 169 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 191/377 places, 659/2713 transitions.
Drop transitions removed 374 transitions
Redundant transition composition rules discarded 374 transitions
Iterating global reduction 0 with 374 rules applied. Total rules applied 374 place count 191 transition count 285
Applied a total of 374 rules in 7 ms. Remains 191 /191 variables (removed 0) and now considering 285/659 (removed 374) transitions.
[2023-03-10 16:29:30] [INFO ] Flow matrix only has 215 transitions (discarded 70 similar events)
// Phase 1: matrix 215 rows 191 cols
[2023-03-10 16:29:30] [INFO ] Computed 75 place invariants in 1 ms
[2023-03-10 16:29:30] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-10 16:29:30] [INFO ] Flow matrix only has 215 transitions (discarded 70 similar events)
[2023-03-10 16:29:30] [INFO ] Invariant cache hit.
[2023-03-10 16:29:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 16:29:30] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 191/377 places, 285/2713 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1306 ms. Remains : 191/377 places, 285/2713 transitions.
Support contains 103 out of 191 places after structural reductions.
[2023-03-10 16:29:30] [INFO ] Flatten gal took : 40 ms
[2023-03-10 16:29:31] [INFO ] Flatten gal took : 17 ms
[2023-03-10 16:29:31] [INFO ] Input system was already deterministic with 285 transitions.
Support contains 97 out of 191 places (down from 103) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 618 ms. (steps per millisecond=16 ) properties (out of 56) seen :38
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-10 16:29:31] [INFO ] Flow matrix only has 215 transitions (discarded 70 similar events)
[2023-03-10 16:29:31] [INFO ] Invariant cache hit.
[2023-03-10 16:29:31] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-10 16:29:32] [INFO ] [Nat]Absence check using 75 positive place invariants in 11 ms returned sat
[2023-03-10 16:29:32] [INFO ] After 444ms SMT Verify possible using all constraints in natural domain returned unsat :18 sat :0
Fused 18 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 18 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DLCround-PT-11a-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-11a-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-10 16:29:32] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-10 16:29:32] [INFO ] Flatten gal took : 41 ms
FORMULA DLCround-PT-11a-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-11a-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-10 16:29:32] [INFO ] Flatten gal took : 11 ms
[2023-03-10 16:29:32] [INFO ] Input system was already deterministic with 285 transitions.
Support contains 46 out of 191 places (down from 55) after GAL structural reductions.
Computed a total of 60 stabilizing places and 1 stable transitions
Graph (complete) has 359 edges and 191 vertex of which 132 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 285/285 transitions.
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 137 transition count 285
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 67 place count 124 transition count 259
Iterating global reduction 1 with 13 rules applied. Total rules applied 80 place count 124 transition count 259
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 82 place count 124 transition count 257
Applied a total of 82 rules in 5 ms. Remains 124 /191 variables (removed 67) and now considering 257/285 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 124/191 places, 257/285 transitions.
[2023-03-10 16:29:32] [INFO ] Flatten gal took : 7 ms
[2023-03-10 16:29:32] [INFO ] Flatten gal took : 7 ms
[2023-03-10 16:29:32] [INFO ] Input system was already deterministic with 257 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 191/191 places, 285/285 transitions.
Graph (trivial) has 284 edges and 191 vertex of which 131 / 191 are part of one of the 16 SCC in 3 ms
Free SCC test removed 115 places
Ensure Unique test removed 268 transitions
Reduce isomorphic transitions removed 268 transitions.
Graph (complete) has 91 edges and 76 vertex of which 18 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.0 ms
Discarding 58 places :
Also discarding 0 output transitions
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 17 place count 3 transition count 2
Iterating global reduction 0 with 15 rules applied. Total rules applied 32 place count 3 transition count 2
Applied a total of 32 rules in 8 ms. Remains 3 /191 variables (removed 188) and now considering 2/285 (removed 283) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 3/191 places, 2/285 transitions.
[2023-03-10 16:29:32] [INFO ] Flatten gal took : 0 ms
[2023-03-10 16:29:32] [INFO ] Flatten gal took : 0 ms
[2023-03-10 16:29:32] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 285/285 transitions.
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 133 transition count 285
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 73 place count 118 transition count 255
Iterating global reduction 1 with 15 rules applied. Total rules applied 88 place count 118 transition count 255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 90 place count 118 transition count 253
Applied a total of 90 rules in 4 ms. Remains 118 /191 variables (removed 73) and now considering 253/285 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 118/191 places, 253/285 transitions.
[2023-03-10 16:29:32] [INFO ] Flatten gal took : 7 ms
[2023-03-10 16:29:32] [INFO ] Flatten gal took : 7 ms
[2023-03-10 16:29:32] [INFO ] Input system was already deterministic with 253 transitions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 285/285 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 141 transition count 285
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 63 place count 128 transition count 259
Iterating global reduction 1 with 13 rules applied. Total rules applied 76 place count 128 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 77 place count 128 transition count 258
Applied a total of 77 rules in 5 ms. Remains 128 /191 variables (removed 63) and now considering 258/285 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 128/191 places, 258/285 transitions.
[2023-03-10 16:29:32] [INFO ] Flatten gal took : 7 ms
[2023-03-10 16:29:32] [INFO ] Flatten gal took : 8 ms
[2023-03-10 16:29:32] [INFO ] Input system was already deterministic with 258 transitions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 285/285 transitions.
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 132 transition count 285
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 74 place count 117 transition count 255
Iterating global reduction 1 with 15 rules applied. Total rules applied 89 place count 117 transition count 255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 91 place count 117 transition count 253
Applied a total of 91 rules in 3 ms. Remains 117 /191 variables (removed 74) and now considering 253/285 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 117/191 places, 253/285 transitions.
[2023-03-10 16:29:32] [INFO ] Flatten gal took : 24 ms
[2023-03-10 16:29:32] [INFO ] Flatten gal took : 8 ms
[2023-03-10 16:29:32] [INFO ] Input system was already deterministic with 253 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 191/191 places, 285/285 transitions.
Graph (trivial) has 282 edges and 191 vertex of which 129 / 191 are part of one of the 16 SCC in 1 ms
Free SCC test removed 113 places
Ensure Unique test removed 264 transitions
Reduce isomorphic transitions removed 264 transitions.
Graph (complete) has 95 edges and 78 vertex of which 19 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.0 ms
Discarding 59 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 3 transition count 6
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 2 transition count 3
Applied a total of 35 rules in 4 ms. Remains 2 /191 variables (removed 189) and now considering 3/285 (removed 282) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 2/191 places, 3/285 transitions.
[2023-03-10 16:29:32] [INFO ] Flatten gal took : 0 ms
[2023-03-10 16:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-10 16:29:32] [INFO ] Input system was already deterministic with 3 transitions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 285/285 transitions.
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 132 transition count 285
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 74 place count 117 transition count 255
Iterating global reduction 1 with 15 rules applied. Total rules applied 89 place count 117 transition count 255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 91 place count 117 transition count 253
Applied a total of 91 rules in 5 ms. Remains 117 /191 variables (removed 74) and now considering 253/285 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 117/191 places, 253/285 transitions.
[2023-03-10 16:29:32] [INFO ] Flatten gal took : 6 ms
[2023-03-10 16:29:32] [INFO ] Flatten gal took : 6 ms
[2023-03-10 16:29:32] [INFO ] Input system was already deterministic with 253 transitions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 285/285 transitions.
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 135 transition count 285
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 69 place count 122 transition count 259
Iterating global reduction 1 with 13 rules applied. Total rules applied 82 place count 122 transition count 259
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 84 place count 122 transition count 257
Applied a total of 84 rules in 4 ms. Remains 122 /191 variables (removed 69) and now considering 257/285 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 122/191 places, 257/285 transitions.
[2023-03-10 16:29:32] [INFO ] Flatten gal took : 6 ms
[2023-03-10 16:29:32] [INFO ] Flatten gal took : 7 ms
[2023-03-10 16:29:32] [INFO ] Input system was already deterministic with 257 transitions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 285/285 transitions.
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 140 transition count 285
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 65 place count 126 transition count 257
Iterating global reduction 1 with 14 rules applied. Total rules applied 79 place count 126 transition count 257
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 81 place count 126 transition count 255
Applied a total of 81 rules in 4 ms. Remains 126 /191 variables (removed 65) and now considering 255/285 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 126/191 places, 255/285 transitions.
[2023-03-10 16:29:32] [INFO ] Flatten gal took : 7 ms
[2023-03-10 16:29:32] [INFO ] Flatten gal took : 6 ms
[2023-03-10 16:29:32] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 191/191 places, 285/285 transitions.
Graph (trivial) has 284 edges and 191 vertex of which 131 / 191 are part of one of the 16 SCC in 0 ms
Free SCC test removed 115 places
Ensure Unique test removed 268 transitions
Reduce isomorphic transitions removed 268 transitions.
Graph (complete) has 91 edges and 76 vertex of which 18 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.0 ms
Discarding 58 places :
Also discarding 0 output transitions
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 17 place count 3 transition count 2
Iterating global reduction 0 with 15 rules applied. Total rules applied 32 place count 3 transition count 2
Applied a total of 32 rules in 3 ms. Remains 3 /191 variables (removed 188) and now considering 2/285 (removed 283) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 3/191 places, 2/285 transitions.
[2023-03-10 16:29:32] [INFO ] Flatten gal took : 0 ms
[2023-03-10 16:29:32] [INFO ] Flatten gal took : 1 ms
[2023-03-10 16:29:32] [INFO ] Input system was already deterministic with 2 transitions.
[2023-03-10 16:29:32] [INFO ] Flatten gal took : 9 ms
[2023-03-10 16:29:32] [INFO ] Flatten gal took : 10 ms
[2023-03-10 16:29:32] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-10 16:29:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 191 places, 285 transitions and 644 arcs took 2 ms.
Total runtime 3637 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 191 NrTr: 285 NrArc: 644)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.003sec

net check time: 0m 0.000sec

init dd package: 0m 2.748sec


RS generation: 0m 0.040sec


-> reachability set: #nodes 1747 (1.7e+03) #states 308,558,896,128,001 (14)



starting MCC model checker
--------------------------

checking: EF [EG [AX [AX [1<=0]]]]
normalized: E [true U EG [~ [EX [EX [~ [1<=0]]]]]]

abstracting: (1<=0)
states: 0
...
EG iterations: 1
-> the formula is FALSE

FORMULA DLCround-PT-11a-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.077sec

checking: EF [AX [1<=0]]
normalized: E [true U ~ [EX [~ [1<=0]]]]

abstracting: (1<=0)
states: 0
.-> the formula is FALSE

FORMULA DLCround-PT-11a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [AG [[p164<=0 & 0<=p164]]]
normalized: E [true U ~ [E [true U ~ [[p164<=0 & 0<=p164]]]]]

abstracting: (0<=p164)
states: 308,558,896,128,001 (14)
abstracting: (p164<=0)
states: 1
-> the formula is FALSE

FORMULA DLCround-PT-11a-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EF [AX [EG [AX [~ [[p163<=1 & 1<=p163]]]]]]
normalized: E [true U ~ [EX [~ [EG [~ [EX [[p163<=1 & 1<=p163]]]]]]]]

abstracting: (1<=p163)
states: 308,558,896,128,000 (14)
abstracting: (p163<=1)
states: 308,558,896,128,001 (14)
..
EG iterations: 1
.-> the formula is FALSE

FORMULA DLCround-PT-11a-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AF [AG [AF [[p65<=0 & 0<=p65]]]]
normalized: ~ [EG [E [true U EG [~ [[p65<=0 & 0<=p65]]]]]]

abstracting: (0<=p65)
states: 308,558,896,128,001 (14)
abstracting: (p65<=0)
states: 274,274,574,336,001 (14)
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA DLCround-PT-11a-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.037sec

checking: EF [EG [[p151<=1 & 1<=p151]]]
normalized: E [true U EG [[p151<=1 & 1<=p151]]]

abstracting: (1<=p151)
states: 308,558,896,128,000 (14)
abstracting: (p151<=1)
states: 308,558,896,128,001 (14)
.
EG iterations: 1
-> the formula is TRUE

FORMULA DLCround-PT-11a-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AX [AG [[EF [[~ [[p178<=0 & 0<=p178]] | ~ [[p10<=0 & 0<=p10]]]] | ~ [A [AX [[[p139<=0 & 0<=p139] | [p109<=1 & 1<=p109]]] U [[p182<=0 & 0<=p182] | [p113<=1 & 1<=p113]]]]]]]
normalized: ~ [EX [E [true U ~ [[~ [[~ [EG [~ [[[p113<=1 & 1<=p113] | [p182<=0 & 0<=p182]]]]] & ~ [E [~ [[[p113<=1 & 1<=p113] | [p182<=0 & 0<=p182]]] U [EX [~ [[[p109<=1 & 1<=p109] | [p139<=0 & 0<=p139]]]] & ~ [[[p113<=1 & 1<=p113] | [p182<=0 & 0<=p182]]]]]]]] | E [true U [~ [[p10<=0 & 0<=p10]] | ~ [[p178<=0 & 0<=p178]]]]]]]]]

abstracting: (0<=p178)
states: 308,558,896,128,001 (14)
abstracting: (p178<=0)
states: 1
abstracting: (0<=p10)
states: 308,558,896,128,001 (14)
abstracting: (p10<=0)
states: 257,132,413,440,001 (14)
abstracting: (0<=p182)
states: 308,558,896,128,001 (14)
abstracting: (p182<=0)
states: 1
abstracting: (1<=p113)
states: 34,284,321,792,000 (13)
abstracting: (p113<=1)
states: 308,558,896,128,001 (14)
abstracting: (0<=p139)
states: 308,558,896,128,001 (14)
abstracting: (p139<=0)
states: 1
abstracting: (1<=p109)
states: 34,284,321,792,000 (13)
abstracting: (p109<=1)
states: 308,558,896,128,001 (14)
.abstracting: (0<=p182)
states: 308,558,896,128,001 (14)
abstracting: (p182<=0)
states: 1
abstracting: (1<=p113)
states: 34,284,321,792,000 (13)
abstracting: (p113<=1)
states: 308,558,896,128,001 (14)
abstracting: (0<=p182)
states: 308,558,896,128,001 (14)
abstracting: (p182<=0)
states: 1
abstracting: (1<=p113)
states: 34,284,321,792,000 (13)
abstracting: (p113<=1)
states: 308,558,896,128,001 (14)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA DLCround-PT-11a-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: [EF [[[[[AG [[p149<=0 & 0<=p149]] & [[p84<=1 & 1<=p84] | [p185<=0 & 0<=p185]]] | [[p135<=0 & 0<=p135] & [p3<=1 & 1<=p3]]] | [[[p144<=0 & 0<=p144] & [p172<=1 & 1<=p172]] | [p153<=0 & 0<=p153]]] & EG [~ [[p174<=0 & 0<=p174]]]]] | [AG [EX [[p34<=0 & 0<=p34]]] | EX [AX [[p139<=0 & 0<=p139]]]]]
normalized: [[EX [~ [EX [~ [[p139<=0 & 0<=p139]]]]] | ~ [E [true U ~ [EX [[p34<=0 & 0<=p34]]]]]] | E [true U [EG [~ [[p174<=0 & 0<=p174]]] & [[[p153<=0 & 0<=p153] | [[p172<=1 & 1<=p172] & [p144<=0 & 0<=p144]]] | [[[p3<=1 & 1<=p3] & [p135<=0 & 0<=p135]] | [[[p185<=0 & 0<=p185] | [p84<=1 & 1<=p84]] & ~ [E [true U ~ [[p149<=0 & 0<=p149]]]]]]]]]]

abstracting: (0<=p149)
states: 308,558,896,128,001 (14)
abstracting: (p149<=0)
states: 1
abstracting: (1<=p84)
states: 34,284,321,792,000 (13)
abstracting: (p84<=1)
states: 308,558,896,128,001 (14)
abstracting: (0<=p185)
states: 308,558,896,128,001 (14)
abstracting: (p185<=0)
states: 1
abstracting: (0<=p135)
states: 308,558,896,128,001 (14)
abstracting: (p135<=0)
states: 1
abstracting: (1<=p3)
states: 44,079,842,304,000 (13)
abstracting: (p3<=1)
states: 308,558,896,128,001 (14)
abstracting: (0<=p144)
states: 308,558,896,128,001 (14)
abstracting: (p144<=0)
states: 1
abstracting: (1<=p172)
states: 308,558,896,128,000 (14)
abstracting: (p172<=1)
states: 308,558,896,128,001 (14)
abstracting: (0<=p153)
states: 308,558,896,128,001 (14)
abstracting: (p153<=0)
states: 1
abstracting: (0<=p174)
states: 308,558,896,128,001 (14)
abstracting: (p174<=0)
states: 1
.
EG iterations: 1
abstracting: (0<=p34)
states: 308,558,896,128,001 (14)
abstracting: (p34<=0)
states: 277,703,006,515,201 (14)
.abstracting: (0<=p139)
states: 308,558,896,128,001 (14)
abstracting: (p139<=0)
states: 1
..-> the formula is TRUE

FORMULA DLCround-PT-11a-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: E [[AF [[[p43<=1 & 1<=p43] | [[p184<=1 & 1<=p184] & [[p34<=1 & 1<=p34] & ~ [[[p110<=0 & 0<=p110] | [p100<=1 & 1<=p100]]]]]]] & [~ [[[p4<=1 & 1<=p4] & ~ [[[p160<=0 & 0<=p160] & [p113<=1 & 1<=p113]]]]] & [p150<=1 & 1<=p150]]] U AG [[AX [[p179<=1 & 1<=p179]] | [EX [[p132<=1 & 1<=p132]] & [[p51<=0 & 0<=p51] | [p30<=1 & 1<=p30]]]]]]
normalized: E [[[[p150<=1 & 1<=p150] & ~ [[~ [[[p113<=1 & 1<=p113] & [p160<=0 & 0<=p160]]] & [p4<=1 & 1<=p4]]]] & ~ [EG [~ [[[[~ [[[p100<=1 & 1<=p100] | [p110<=0 & 0<=p110]]] & [p34<=1 & 1<=p34]] & [p184<=1 & 1<=p184]] | [p43<=1 & 1<=p43]]]]]] U ~ [E [true U ~ [[[[[p30<=1 & 1<=p30] | [p51<=0 & 0<=p51]] & EX [[p132<=1 & 1<=p132]]] | ~ [EX [~ [[p179<=1 & 1<=p179]]]]]]]]]

abstracting: (1<=p179)
states: 308,558,896,128,000 (14)
abstracting: (p179<=1)
states: 308,558,896,128,001 (14)
.abstracting: (1<=p132)
states: 308,558,896,128,000 (14)
abstracting: (p132<=1)
states: 308,558,896,128,001 (14)
.abstracting: (0<=p51)
states: 308,558,896,128,001 (14)
abstracting: (p51<=0)
states: 269,989,034,112,001 (14)
abstracting: (1<=p30)
states: 34,284,321,792,000 (13)
abstracting: (p30<=1)
states: 308,558,896,128,001 (14)
abstracting: (1<=p43)
states: 30,855,889,612,800 (13)
abstracting: (p43<=1)
states: 308,558,896,128,001 (14)
abstracting: (1<=p184)
states: 308,558,896,128,000 (14)
abstracting: (p184<=1)
states: 308,558,896,128,001 (14)
abstracting: (1<=p34)
states: 30,855,889,612,800 (13)
abstracting: (p34<=1)
states: 308,558,896,128,001 (14)
abstracting: (0<=p110)
states: 308,558,896,128,001 (14)
abstracting: (p110<=0)
states: 274,274,574,336,001 (14)
abstracting: (1<=p100)
states: 34,284,321,792,000 (13)
abstracting: (p100<=1)
states: 308,558,896,128,001 (14)
..
EG iterations: 2
abstracting: (1<=p4)
states: 44,079,842,304,000 (13)
abstracting: (p4<=1)
states: 308,558,896,128,001 (14)
abstracting: (0<=p160)
states: 308,558,896,128,001 (14)
abstracting: (p160<=0)
states: 1
abstracting: (1<=p113)
states: 34,284,321,792,000 (13)
abstracting: (p113<=1)
states: 308,558,896,128,001 (14)
abstracting: (1<=p150)
states: 308,558,896,128,000 (14)
abstracting: (p150<=1)
states: 308,558,896,128,001 (14)
-> the formula is TRUE

FORMULA DLCround-PT-11a-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.065sec

checking: E [[[EX [[[[p176<=0 & 0<=p176] | [p133<=1 & 1<=p133]] & [[[p171<=1 & 1<=p171] | [p9<=1 & 1<=p9]] & [[p40<=1 & 1<=p40] | [p164<=0 & 0<=p164]]]]] | [p6<=0 & 0<=p6]] | [[p81<=1 & 1<=p81] | [AG [[EF [[[p138<=0 & 0<=p138] | [p70<=1 & 1<=p70]]] & ~ [[p170<=1 & 1<=p170]]]] & [~ [[[[p34<=1 & 1<=p34] | [p76<=0 & 0<=p76]] & [p147<=1 & 1<=p147]]] & [[p158<=0 & 0<=p158] | [p1<=1 & 1<=p1]]]]]] U ~ [AX [[p183<=1 & 1<=p183]]]]
normalized: E [[[[[[[p1<=1 & 1<=p1] | [p158<=0 & 0<=p158]] & ~ [[[p147<=1 & 1<=p147] & [[p76<=0 & 0<=p76] | [p34<=1 & 1<=p34]]]]] & ~ [E [true U ~ [[~ [[p170<=1 & 1<=p170]] & E [true U [[p70<=1 & 1<=p70] | [p138<=0 & 0<=p138]]]]]]]] | [p81<=1 & 1<=p81]] | [[p6<=0 & 0<=p6] | EX [[[[[p164<=0 & 0<=p164] | [p40<=1 & 1<=p40]] & [[p9<=1 & 1<=p9] | [p171<=1 & 1<=p171]]] & [[p133<=1 & 1<=p133] | [p176<=0 & 0<=p176]]]]]] U EX [~ [[p183<=1 & 1<=p183]]]]

abstracting: (1<=p183)
states: 308,558,896,128,000 (14)
abstracting: (p183<=1)
states: 308,558,896,128,001 (14)
.abstracting: (0<=p176)
states: 308,558,896,128,001 (14)
abstracting: (p176<=0)
states: 1
abstracting: (1<=p133)
states: 308,558,896,128,000 (14)
abstracting: (p133<=1)
states: 308,558,896,128,001 (14)
abstracting: (1<=p171)
states: 308,558,896,128,000 (14)
abstracting: (p171<=1)
states: 308,558,896,128,001 (14)
abstracting: (1<=p9)
states: 51,426,482,688,000 (13)
abstracting: (p9<=1)
states: 308,558,896,128,001 (14)
abstracting: (1<=p40)
states: 30,855,889,612,800 (13)
abstracting: (p40<=1)
states: 308,558,896,128,001 (14)
abstracting: (0<=p164)
states: 308,558,896,128,001 (14)
abstracting: (p164<=0)
states: 1
.abstracting: (0<=p6)
states: 308,558,896,128,001 (14)
abstracting: (p6<=0)
states: 264,479,053,824,001 (14)
abstracting: (1<=p81)
states: 34,284,321,792,000 (13)
abstracting: (p81<=1)
states: 308,558,896,128,001 (14)
abstracting: (0<=p138)
states: 308,558,896,128,001 (14)
abstracting: (p138<=0)
states: 1
abstracting: (1<=p70)
states: 38,569,862,016,000 (13)
abstracting: (p70<=1)
states: 308,558,896,128,001 (14)
abstracting: (1<=p170)
states: 308,558,896,128,000 (14)
abstracting: (p170<=1)
states: 308,558,896,128,001 (14)
abstracting: (1<=p34)
states: 30,855,889,612,800 (13)
abstracting: (p34<=1)
states: 308,558,896,128,001 (14)
abstracting: (0<=p76)
states: 308,558,896,128,001 (14)
abstracting: (p76<=0)
states: 269,989,034,112,001 (14)
abstracting: (1<=p147)
states: 308,558,896,128,000 (14)
abstracting: (p147<=1)
states: 308,558,896,128,001 (14)
abstracting: (0<=p158)
states: 308,558,896,128,001 (14)
abstracting: (p158<=0)
states: 1
abstracting: (1<=p1)
states: 44,079,842,304,000 (13)
abstracting: (p1<=1)
states: 308,558,896,128,001 (14)
-> the formula is FALSE

FORMULA DLCround-PT-11a-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.083sec

totally nodes used: 80932 (8.1e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 416558 1045751 1462309
used/not used/entry size/cache size: 1074661 66034203 16 1024MB
basic ops cache: hits/miss/sum: 53855 138392 192247
used/not used/entry size/cache size: 219222 16557994 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 6040 13140 19180
used/not used/entry size/cache size: 13140 8375468 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67029275
1 78277
2 1281
3 31
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.065sec


BK_STOP 1678465778814

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:2355 (8), effective:116 (0)

initing FirstDep: 0m 0.000sec


iterations count:556 (1), effective:1 (0)

iterations count:818 (2), effective:9 (0)

iterations count:556 (1), effective:1 (0)

iterations count:556 (1), effective:1 (0)

iterations count:285 (1), effective:0 (0)

iterations count:556 (1), effective:1 (0)

iterations count:285 (1), effective:0 (0)

iterations count:319 (1), effective:7 (0)

iterations count:556 (1), effective:1 (0)

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="DLCround-PT-11a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is DLCround-PT-11a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r106-tall-167814483100745"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-11a.tgz
mv DLCround-PT-11a execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;