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.r202-smll-167840348100009.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 GPUForwardProgress-PT-04b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348100009
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.1K Feb 25 14:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 14:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 14:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 14:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 14:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 25 14:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 25 14:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:11 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 27K 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 GPUForwardProgress-PT-04b-CTLCardinality-00
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-01
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-02
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-03
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-04
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-05
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-06
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-07
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-08
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-09
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-10
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-11
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-12
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-13
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-14
FORMULA_NAME GPUForwardProgress-PT-04b-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678517038034

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=GPUForwardProgress-PT-04b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 06:44:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 06:44:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 06:44:01] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2023-03-11 06:44:01] [INFO ] Transformed 112 places.
[2023-03-11 06:44:01] [INFO ] Transformed 117 transitions.
[2023-03-11 06:44:01] [INFO ] Found NUPN structural information;
[2023-03-11 06:44:01] [INFO ] Parsed PT model containing 112 places and 117 transitions and 277 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 28 ms.
Support contains 71 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 117
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 109 transition count 115
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 109 transition count 115
Applied a total of 5 rules in 41 ms. Remains 109 /112 variables (removed 3) and now considering 115/117 (removed 2) transitions.
// Phase 1: matrix 115 rows 109 cols
[2023-03-11 06:44:02] [INFO ] Computed 5 place invariants in 19 ms
[2023-03-11 06:44:02] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-11 06:44:02] [INFO ] Invariant cache hit.
[2023-03-11 06:44:02] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2023-03-11 06:44:02] [INFO ] Invariant cache hit.
[2023-03-11 06:44:02] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/112 places, 115/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 964 ms. Remains : 109/112 places, 115/117 transitions.
Support contains 71 out of 109 places after structural reductions.
[2023-03-11 06:44:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-11 06:44:03] [INFO ] Flatten gal took : 76 ms
[2023-03-11 06:44:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA GPUForwardProgress-PT-04b-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04b-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 06:44:03] [INFO ] Flatten gal took : 26 ms
[2023-03-11 06:44:03] [INFO ] Input system was already deterministic with 115 transitions.
Support contains 70 out of 109 places (down from 71) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 215 resets, run finished after 812 ms. (steps per millisecond=12 ) properties (out of 64) seen :59
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:44:04] [INFO ] Invariant cache hit.
[2023-03-11 06:44:04] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:44:04] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2023-03-11 06:44:05] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:44:05] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-11 06:44:05] [INFO ] After 227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 6 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 115/115 transitions.
Graph (complete) has 160 edges and 109 vertex of which 104 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 104 transition count 63
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 107 place count 53 transition count 59
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 110 place count 52 transition count 57
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 112 place count 50 transition count 57
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 112 place count 50 transition count 49
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 128 place count 42 transition count 49
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 133 place count 37 transition count 44
Iterating global reduction 4 with 5 rules applied. Total rules applied 138 place count 37 transition count 44
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 164 place count 24 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 165 place count 24 transition count 30
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 167 place count 22 transition count 26
Iterating global reduction 5 with 2 rules applied. Total rules applied 169 place count 22 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 171 place count 21 transition count 25
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 175 place count 19 transition count 30
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 176 place count 19 transition count 29
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 178 place count 19 transition count 27
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 179 place count 19 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 180 place count 18 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 181 place count 17 transition count 25
Applied a total of 181 rules in 46 ms. Remains 17 /109 variables (removed 92) and now considering 25/115 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 17/109 places, 25/115 transitions.
Incomplete random walk after 10000 steps, including 194 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 58 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Probably explored full state space saw : 563 states, properties seen :0
Probabilistic random walk after 2070 steps, saw 563 distinct states, run finished after 43 ms. (steps per millisecond=48 ) properties seen :0
Explored full state space saw : 563 states, properties seen :0
Exhaustive walk after 2070 steps, saw 563 distinct states, run finished after 20 ms. (steps per millisecond=103 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2023-03-11 06:44:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-11 06:44:05] [INFO ] Flatten gal took : 16 ms
FORMULA GPUForwardProgress-PT-04b-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 06:44:05] [INFO ] Flatten gal took : 16 ms
[2023-03-11 06:44:05] [INFO ] Input system was already deterministic with 115 transitions.
Support contains 58 out of 109 places (down from 67) after GAL structural reductions.
Computed a total of 24 stabilizing places and 24 stable transitions
Graph (complete) has 160 edges and 109 vertex of which 101 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 96 transition count 102
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 96 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 96 transition count 101
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 91 transition count 96
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 91 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 91 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 90 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 90 transition count 92
Applied a total of 42 rules in 34 ms. Remains 90 /109 variables (removed 19) and now considering 92/115 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 90/109 places, 92/115 transitions.
[2023-03-11 06:44:05] [INFO ] Flatten gal took : 9 ms
[2023-03-11 06:44:05] [INFO ] Flatten gal took : 10 ms
[2023-03-11 06:44:05] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 96 transition count 102
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 96 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 96 transition count 101
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 92 transition count 97
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 92 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 92 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 91 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 91 transition count 94
Applied a total of 39 rules in 31 ms. Remains 91 /109 variables (removed 18) and now considering 94/115 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 91/109 places, 94/115 transitions.
[2023-03-11 06:44:05] [INFO ] Flatten gal took : 8 ms
[2023-03-11 06:44:05] [INFO ] Flatten gal took : 9 ms
[2023-03-11 06:44:05] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 95 transition count 101
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 95 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 95 transition count 100
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 90 transition count 95
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 90 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 90 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 89 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 89 transition count 92
Applied a total of 43 rules in 22 ms. Remains 89 /109 variables (removed 20) and now considering 92/115 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 89/109 places, 92/115 transitions.
[2023-03-11 06:44:05] [INFO ] Flatten gal took : 8 ms
[2023-03-11 06:44:05] [INFO ] Flatten gal took : 9 ms
[2023-03-11 06:44:05] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 98 transition count 104
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 98 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 98 transition count 103
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 94 transition count 99
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 94 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 94 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 93 transition count 96
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 93 transition count 96
Applied a total of 35 rules in 10 ms. Remains 93 /109 variables (removed 16) and now considering 96/115 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 93/109 places, 96/115 transitions.
[2023-03-11 06:44:06] [INFO ] Flatten gal took : 8 ms
[2023-03-11 06:44:06] [INFO ] Flatten gal took : 9 ms
[2023-03-11 06:44:06] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 96 transition count 102
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 96 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 96 transition count 101
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 91 transition count 96
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 91 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 91 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 90 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 90 transition count 92
Applied a total of 42 rules in 9 ms. Remains 90 /109 variables (removed 19) and now considering 92/115 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 90/109 places, 92/115 transitions.
[2023-03-11 06:44:06] [INFO ] Flatten gal took : 8 ms
[2023-03-11 06:44:06] [INFO ] Flatten gal took : 8 ms
[2023-03-11 06:44:06] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Graph (trivial) has 98 edges and 109 vertex of which 7 / 109 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 153 edges and 103 vertex of which 95 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 94 transition count 53
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 108 place count 43 transition count 49
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 110 place count 42 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 111 place count 41 transition count 48
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 111 place count 41 transition count 39
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 129 place count 32 transition count 39
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 134 place count 27 transition count 34
Iterating global reduction 4 with 5 rules applied. Total rules applied 139 place count 27 transition count 34
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 157 place count 18 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 159 place count 17 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 160 place count 17 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 162 place count 16 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 163 place count 16 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 164 place count 15 transition count 21
Applied a total of 164 rules in 26 ms. Remains 15 /109 variables (removed 94) and now considering 21/115 (removed 94) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 15/109 places, 21/115 transitions.
[2023-03-11 06:44:06] [INFO ] Flatten gal took : 2 ms
[2023-03-11 06:44:06] [INFO ] Flatten gal took : 2 ms
[2023-03-11 06:44:06] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 100 transition count 106
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 100 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 100 transition count 105
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 96 transition count 101
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 96 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 96 transition count 99
Applied a total of 29 rules in 7 ms. Remains 96 /109 variables (removed 13) and now considering 99/115 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 96/109 places, 99/115 transitions.
[2023-03-11 06:44:06] [INFO ] Flatten gal took : 9 ms
[2023-03-11 06:44:06] [INFO ] Flatten gal took : 9 ms
[2023-03-11 06:44:06] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Graph (trivial) has 87 edges and 109 vertex of which 7 / 109 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 153 edges and 103 vertex of which 95 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 94 transition count 63
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 88 place count 53 transition count 59
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 93 place count 52 transition count 55
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 97 place count 48 transition count 55
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 97 place count 48 transition count 45
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 117 place count 38 transition count 45
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 121 place count 34 transition count 41
Iterating global reduction 4 with 4 rules applied. Total rules applied 125 place count 34 transition count 41
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 135 place count 29 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 137 place count 28 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 138 place count 28 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 140 place count 27 transition count 33
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 142 place count 27 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 26 transition count 32
Applied a total of 143 rules in 22 ms. Remains 26 /109 variables (removed 83) and now considering 32/115 (removed 83) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 26/109 places, 32/115 transitions.
[2023-03-11 06:44:06] [INFO ] Flatten gal took : 3 ms
[2023-03-11 06:44:06] [INFO ] Flatten gal took : 3 ms
[2023-03-11 06:44:06] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 98 transition count 104
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 98 transition count 104
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 94 transition count 100
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 94 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 94 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 93 transition count 97
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 93 transition count 97
Applied a total of 34 rules in 8 ms. Remains 93 /109 variables (removed 16) and now considering 97/115 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 93/109 places, 97/115 transitions.
[2023-03-11 06:44:06] [INFO ] Flatten gal took : 7 ms
[2023-03-11 06:44:06] [INFO ] Flatten gal took : 8 ms
[2023-03-11 06:44:06] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Graph (trivial) has 99 edges and 109 vertex of which 7 / 109 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 153 edges and 103 vertex of which 95 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 94 transition count 51
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 58 rules applied. Total rules applied 113 place count 41 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 114 place count 40 transition count 46
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 114 place count 40 transition count 37
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 132 place count 31 transition count 37
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 137 place count 26 transition count 32
Iterating global reduction 3 with 5 rules applied. Total rules applied 142 place count 26 transition count 32
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 160 place count 17 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 162 place count 16 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 164 place count 16 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 165 place count 15 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 166 place count 14 transition count 19
Applied a total of 166 rules in 15 ms. Remains 14 /109 variables (removed 95) and now considering 19/115 (removed 96) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 14/109 places, 19/115 transitions.
[2023-03-11 06:44:06] [INFO ] Flatten gal took : 2 ms
[2023-03-11 06:44:06] [INFO ] Flatten gal took : 2 ms
[2023-03-11 06:44:06] [INFO ] Input system was already deterministic with 19 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA GPUForwardProgress-PT-04b-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 95 transition count 101
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 95 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 95 transition count 100
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 90 transition count 95
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 90 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 90 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 89 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 89 transition count 92
Applied a total of 43 rules in 8 ms. Remains 89 /109 variables (removed 20) and now considering 92/115 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 89/109 places, 92/115 transitions.
[2023-03-11 06:44:06] [INFO ] Flatten gal took : 7 ms
[2023-03-11 06:44:06] [INFO ] Flatten gal took : 8 ms
[2023-03-11 06:44:06] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 97 transition count 103
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 97 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 97 transition count 102
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 92 transition count 97
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 92 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 92 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 91 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 91 transition count 94
Applied a total of 39 rules in 8 ms. Remains 91 /109 variables (removed 18) and now considering 94/115 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 91/109 places, 94/115 transitions.
[2023-03-11 06:44:06] [INFO ] Flatten gal took : 8 ms
[2023-03-11 06:44:06] [INFO ] Flatten gal took : 8 ms
[2023-03-11 06:44:06] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 98 transition count 104
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 98 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 98 transition count 103
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 94 transition count 99
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 94 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 94 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 93 transition count 96
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 93 transition count 96
Applied a total of 35 rules in 21 ms. Remains 93 /109 variables (removed 16) and now considering 96/115 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 93/109 places, 96/115 transitions.
[2023-03-11 06:44:06] [INFO ] Flatten gal took : 7 ms
[2023-03-11 06:44:06] [INFO ] Flatten gal took : 8 ms
[2023-03-11 06:44:06] [INFO ] Input system was already deterministic with 96 transitions.
[2023-03-11 06:44:06] [INFO ] Flatten gal took : 10 ms
[2023-03-11 06:44:06] [INFO ] Flatten gal took : 9 ms
[2023-03-11 06:44:06] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-11 06:44:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 109 places, 115 transitions and 271 arcs took 2 ms.
Total runtime 4907 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: 109 NrTr: 115 NrArc: 271)

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

net check time: 0m 0.000sec

init dd package: 0m 3.377sec


RS generation: 0m 0.260sec


-> reachability set: #nodes 4872 (4.9e+03) #states 7,793,983 (6)



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

checking: EG [~ [[p14<=1 & 1<=p14]]]
normalized: EG [~ [[p14<=1 & 1<=p14]]]

abstracting: (1<=p14)
states: 420,444 (5)
abstracting: (p14<=1)
states: 7,793,983 (6)
.
EG iterations: 1
-> the formula is TRUE

FORMULA GPUForwardProgress-PT-04b-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.204sec

checking: AF [AX [AG [[p14<=1 & 1<=p14]]]]
normalized: ~ [EG [EX [E [true U ~ [[p14<=1 & 1<=p14]]]]]]

abstracting: (1<=p14)
states: 420,444 (5)
abstracting: (p14<=1)
states: 7,793,983 (6)
..........................................
EG iterations: 41
-> the formula is FALSE

FORMULA GPUForwardProgress-PT-04b-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.408sec

checking: EG [[EX [E [[p72<=0 & 0<=p72] U ~ [[[p27<=0 & 0<=p27] | [p14<=1 & 1<=p14]]]]] & [p66<=0 & 0<=p66]]]
normalized: EG [[EX [E [[p72<=0 & 0<=p72] U ~ [[[p14<=1 & 1<=p14] | [p27<=0 & 0<=p27]]]]] & [p66<=0 & 0<=p66]]]

abstracting: (0<=p66)
states: 7,793,983 (6)
abstracting: (p66<=0)
states: 7,347,871 (6)
abstracting: (0<=p27)
states: 7,793,983 (6)
abstracting: (p27<=0)
states: 7,253,043 (6)
abstracting: (1<=p14)
states: 420,444 (5)
abstracting: (p14<=1)
states: 7,793,983 (6)
abstracting: (0<=p72)
states: 7,793,983 (6)
abstracting: (p72<=0)
states: 7,335,888 (6)
.........................................
EG iterations: 40
-> the formula is TRUE

FORMULA GPUForwardProgress-PT-04b-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.337sec

checking: [EF [[[p44<=0 & 0<=p44] & AG [[0<=p107 & p107<=0]]]] | [EX [[[p58<=0 & 0<=p58] & [p87<=1 & 1<=p87]]] & EX [EX [AX [[p69<=0 & 0<=p69]]]]]]
normalized: [[EX [EX [~ [EX [~ [[p69<=0 & 0<=p69]]]]]] & EX [[[p87<=1 & 1<=p87] & [p58<=0 & 0<=p58]]]] | E [true U [~ [E [true U ~ [[0<=p107 & p107<=0]]]] & [p44<=0 & 0<=p44]]]]

abstracting: (0<=p44)
states: 7,793,983 (6)
abstracting: (p44<=0)
states: 7,372,288 (6)
abstracting: (p107<=0)
states: 7,773,137 (6)
abstracting: (0<=p107)
states: 7,793,983 (6)
abstracting: (0<=p58)
states: 7,793,983 (6)
abstracting: (p58<=0)
states: 7,365,012 (6)
abstracting: (1<=p87)
states: 595,146 (5)
abstracting: (p87<=1)
states: 7,793,983 (6)
.abstracting: (0<=p69)
states: 7,793,983 (6)
abstracting: (p69<=0)
states: 7,335,888 (6)
...-> the formula is TRUE

FORMULA GPUForwardProgress-PT-04b-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.119sec

checking: EF [[[p89<=1 & 1<=p89] & [EX [[[p37<=0 & 0<=p37] & [p70<=1 & 1<=p70]]] | EF [[[p56<=0 & 0<=p56] | [p105<=1 & 1<=p105]]]]]]
normalized: E [true U [[E [true U [[p105<=1 & 1<=p105] | [p56<=0 & 0<=p56]]] | EX [[[p70<=1 & 1<=p70] & [p37<=0 & 0<=p37]]]] & [p89<=1 & 1<=p89]]]

abstracting: (1<=p89)
states: 595,146 (5)
abstracting: (p89<=1)
states: 7,793,983 (6)
abstracting: (0<=p37)
states: 7,793,983 (6)
abstracting: (p37<=0)
states: 7,361,763 (6)
abstracting: (1<=p70)
states: 458,095 (5)
abstracting: (p70<=1)
states: 7,793,983 (6)
.abstracting: (0<=p56)
states: 7,793,983 (6)
abstracting: (p56<=0)
states: 7,360,328 (6)
abstracting: (1<=p105)
states: 1,265,067 (6)
abstracting: (p105<=1)
states: 7,793,983 (6)
-> the formula is TRUE

FORMULA GPUForwardProgress-PT-04b-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.197sec

checking: E [AG [[~ [EF [[p14<=1 & 1<=p14]]] & [[p103<=0 & 0<=p103] | [p84<=1 & 1<=p84]]]] U [EG [[p71<=0 & 0<=p71]] | EF [AG [[[p59<=1 & 1<=p59] & AX [[p83<=1 & 1<=p83]]]]]]]
normalized: E [~ [E [true U ~ [[[[p84<=1 & 1<=p84] | [p103<=0 & 0<=p103]] & ~ [E [true U [p14<=1 & 1<=p14]]]]]]] U [E [true U ~ [E [true U ~ [[~ [EX [~ [[p83<=1 & 1<=p83]]]] & [p59<=1 & 1<=p59]]]]]] | EG [[p71<=0 & 0<=p71]]]]

abstracting: (0<=p71)
states: 7,793,983 (6)
abstracting: (p71<=0)
states: 7,335,888 (6)
.....................................
EG iterations: 37
abstracting: (1<=p59)
states: 453,341 (5)
abstracting: (p59<=1)
states: 7,793,983 (6)
abstracting: (1<=p83)
states: 595,146 (5)
abstracting: (p83<=1)
states: 7,793,983 (6)
.abstracting: (1<=p14)
states: 420,444 (5)
abstracting: (p14<=1)
states: 7,793,983 (6)
abstracting: (0<=p103)
states: 7,793,983 (6)
abstracting: (p103<=0)
states: 6,603,691 (6)
abstracting: (1<=p84)
states: 595,146 (5)
abstracting: (p84<=1)
states: 7,793,983 (6)
-> the formula is TRUE

FORMULA GPUForwardProgress-PT-04b-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.635sec

checking: EG [EF [[[AF [[p78<=1 & 1<=p78]] | E [AG [[p5<=0 & 0<=p5]] U ~ [[[p14<=0 & 0<=p14] | [p40<=1 & 1<=p40]]]]] & [[p93<=1 & 1<=p93] | [[p6<=0 & 0<=p6] & [p44<=1 & 1<=p44]]]]]]
normalized: EG [E [true U [[[[p44<=1 & 1<=p44] & [p6<=0 & 0<=p6]] | [p93<=1 & 1<=p93]] & [E [~ [E [true U ~ [[p5<=0 & 0<=p5]]]] U ~ [[[p40<=1 & 1<=p40] | [p14<=0 & 0<=p14]]]] | ~ [EG [~ [[p78<=1 & 1<=p78]]]]]]]]

abstracting: (1<=p78)
states: 123,426 (5)
abstracting: (p78<=1)
states: 7,793,983 (6)
.................................
EG iterations: 33
abstracting: (0<=p14)
states: 7,793,983 (6)
abstracting: (p14<=0)
states: 7,373,539 (6)
abstracting: (1<=p40)
states: 427,814 (5)
abstracting: (p40<=1)
states: 7,793,983 (6)
abstracting: (0<=p5)
states: 7,793,983 (6)
abstracting: (p5<=0)
states: 7,366,169 (6)
abstracting: (1<=p93)
states: 20,845 (4)
abstracting: (p93<=1)
states: 7,793,983 (6)
abstracting: (0<=p6)
states: 7,793,983 (6)
abstracting: (p6<=0)
states: 7,373,539 (6)
abstracting: (1<=p44)
states: 421,695 (5)
abstracting: (p44<=1)
states: 7,793,983 (6)
.............................
EG iterations: 29
-> the formula is TRUE

FORMULA GPUForwardProgress-PT-04b-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.159sec

checking: EX [[~ [E [[[p20<=1 & 1<=p20] | [p25<=1 & 1<=p25]] U EF [[[p73<=0 & 0<=p73] | [p21<=1 & 1<=p21]]]]] | [AG [AX [E [[p57<=1 & 1<=p57] U [p30<=0 & 0<=p30]]]] | [p21<=1 & 1<=p21]]]]
normalized: EX [[[[p21<=1 & 1<=p21] | ~ [E [true U EX [~ [E [[p57<=1 & 1<=p57] U [p30<=0 & 0<=p30]]]]]]] | ~ [E [[[p25<=1 & 1<=p25] | [p20<=1 & 1<=p20]] U E [true U [[p21<=1 & 1<=p21] | [p73<=0 & 0<=p73]]]]]]]

abstracting: (0<=p73)
states: 7,793,983 (6)
abstracting: (p73<=0)
states: 7,335,888 (6)
abstracting: (1<=p21)
states: 427,814 (5)
abstracting: (p21<=1)
states: 7,793,983 (6)
abstracting: (1<=p20)
states: 432,220 (5)
abstracting: (p20<=1)
states: 7,793,983 (6)
abstracting: (1<=p25)
states: 420,444 (5)
abstracting: (p25<=1)
states: 7,793,983 (6)
abstracting: (0<=p30)
states: 7,793,983 (6)
abstracting: (p30<=0)
states: 7,373,539 (6)
abstracting: (1<=p57)
states: 428,971 (5)
abstracting: (p57<=1)
states: 7,793,983 (6)
.abstracting: (1<=p21)
states: 427,814 (5)
abstracting: (p21<=1)
states: 7,793,983 (6)
.-> the formula is FALSE

FORMULA GPUForwardProgress-PT-04b-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.357sec

checking: [AG [[EG [EX [[p35<=0 & 0<=p35]]] | [[AG [[p70<=1 & 1<=p70]] & [[p5<=0 & 0<=p5] | [p33<=0 & 0<=p33]]] | EG [AX [~ [[p70<=0 & 0<=p70]]]]]]] | [EG [[AX [[[p6<=0 & 0<=p6] & [[p74<=1 & 1<=p74] & [p34<=1 & 1<=p34]]]] | AG [[p101<=0 & 0<=p101]]]] | AX [1<=0]]]
normalized: [[EG [[~ [E [true U ~ [[p101<=0 & 0<=p101]]]] | ~ [EX [~ [[[[p34<=1 & 1<=p34] & [p74<=1 & 1<=p74]] & [p6<=0 & 0<=p6]]]]]]] | ~ [EX [~ [1<=0]]]] | ~ [E [true U ~ [[[EG [~ [EX [[p70<=0 & 0<=p70]]]] | [[[p33<=0 & 0<=p33] | [p5<=0 & 0<=p5]] & ~ [E [true U ~ [[p70<=1 & 1<=p70]]]]]] | EG [EX [[p35<=0 & 0<=p35]]]]]]]]

abstracting: (0<=p35)
states: 7,793,983 (6)
abstracting: (p35<=0)
states: 7,361,763 (6)
..........................................
EG iterations: 41
abstracting: (1<=p70)
states: 458,095 (5)
abstracting: (p70<=1)
states: 7,793,983 (6)
abstracting: (0<=p5)
states: 7,793,983 (6)
abstracting: (p5<=0)
states: 7,366,169 (6)
abstracting: (0<=p33)
states: 7,793,983 (6)
abstracting: (p33<=0)
states: 7,373,539 (6)
abstracting: (0<=p70)
states: 7,793,983 (6)
abstracting: (p70<=0)
states: 7,335,888 (6)
...
EG iterations: 2
abstracting: (1<=0)
states: 0
.abstracting: (0<=p6)
states: 7,793,983 (6)
abstracting: (p6<=0)
states: 7,373,539 (6)
abstracting: (1<=p74)
states: 453,341 (5)
abstracting: (p74<=1)
states: 7,793,983 (6)
abstracting: (1<=p34)
states: 432,220 (5)
abstracting: (p34<=1)
states: 7,793,983 (6)
.abstracting: (0<=p101)
states: 7,793,983 (6)
abstracting: (p101<=0)
states: 6,603,691 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA GPUForwardProgress-PT-04b-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.652sec

checking: ~ [E [[[~ [[EX [[[p21<=0 & 0<=p21] | [p102<=1 & 1<=p102]]] & [[p25<=0 & 0<=p25] | [[p67<=0 & 0<=p67] | [p77<=1 & 1<=p77]]]]] | [AF [[p16<=1 & 1<=p16]] | AX [[[p101<=0 & 0<=p101] | [p9<=1 & 1<=p9]]]]] & EF [EG [EX [[p1<=1 & 1<=p1]]]]] U AG [[p100<=1 & 1<=p100]]]]
normalized: ~ [E [[E [true U EG [EX [[p1<=1 & 1<=p1]]]] & [[~ [EX [~ [[[p9<=1 & 1<=p9] | [p101<=0 & 0<=p101]]]]] | ~ [EG [~ [[p16<=1 & 1<=p16]]]]] | ~ [[[[[p77<=1 & 1<=p77] | [p67<=0 & 0<=p67]] | [p25<=0 & 0<=p25]] & EX [[[p102<=1 & 1<=p102] | [p21<=0 & 0<=p21]]]]]]] U ~ [E [true U ~ [[p100<=1 & 1<=p100]]]]]]

abstracting: (1<=p100)
states: 102,855 (5)
abstracting: (p100<=1)
states: 7,793,983 (6)
abstracting: (0<=p21)
states: 7,793,983 (6)
abstracting: (p21<=0)
states: 7,366,169 (6)
abstracting: (1<=p102)
states: 1,190,292 (6)
abstracting: (p102<=1)
states: 7,793,983 (6)
.abstracting: (0<=p25)
states: 7,793,983 (6)
abstracting: (p25<=0)
states: 7,373,539 (6)
abstracting: (0<=p67)
states: 7,793,983 (6)
abstracting: (p67<=0)
states: 7,347,871 (6)
abstracting: (1<=p77)
states: 694,566 (5)
abstracting: (p77<=1)
states: 7,793,983 (6)
abstracting: (1<=p16)
states: 432,220 (5)
abstracting: (p16<=1)
states: 7,793,983 (6)
.......................................
EG iterations: 39
abstracting: (0<=p101)
states: 7,793,983 (6)
abstracting: (p101<=0)
states: 6,603,691 (6)
abstracting: (1<=p9)
states: 540,940 (5)
abstracting: (p9<=1)
states: 7,793,983 (6)
.abstracting: (1<=p1)
states: 5
abstracting: (p1<=1)
states: 7,793,983 (6)
.......
EG iterations: 6
-> the formula is TRUE

FORMULA GPUForwardProgress-PT-04b-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.390sec

checking: AF [[A [[[p39<=0 & 0<=p39] & [p16<=0 & 0<=p16]] U [EX [[p85<=1 & 1<=p85]] | [p59<=0 & 0<=p59]]] & [AG [[~ [E [[[p81<=0 & 0<=p81] | [p17<=1 & 1<=p17]] U [[p102<=0 & 0<=p102] | [p19<=1 & 1<=p19]]]] & [p101<=0 & 0<=p101]]] & [EG [[p35<=1 & 1<=p35]] | [[p49<=0 & 0<=p49] | [p80<=1 & 1<=p80]]]]]]
normalized: ~ [EG [~ [[[[[[p80<=1 & 1<=p80] | [p49<=0 & 0<=p49]] | EG [[p35<=1 & 1<=p35]]] & ~ [E [true U ~ [[[p101<=0 & 0<=p101] & ~ [E [[[p17<=1 & 1<=p17] | [p81<=0 & 0<=p81]] U [[p19<=1 & 1<=p19] | [p102<=0 & 0<=p102]]]]]]]]] & [~ [EG [~ [[[p59<=0 & 0<=p59] | EX [[p85<=1 & 1<=p85]]]]]] & ~ [E [~ [[[p59<=0 & 0<=p59] | EX [[p85<=1 & 1<=p85]]]] U [~ [[[p16<=0 & 0<=p16] & [p39<=0 & 0<=p39]]] & ~ [[[p59<=0 & 0<=p59] | EX [[p85<=1 & 1<=p85]]]]]]]]]]]]

abstracting: (1<=p85)
states: 595,146 (5)
abstracting: (p85<=1)
states: 7,793,983 (6)
.abstracting: (0<=p59)
states: 7,793,983 (6)
abstracting: (p59<=0)
states: 7,340,642 (6)
abstracting: (0<=p39)
states: 7,793,983 (6)
abstracting: (p39<=0)
states: 7,366,169 (6)
abstracting: (0<=p16)
states: 7,793,983 (6)
abstracting: (p16<=0)
states: 7,361,763 (6)
abstracting: (1<=p85)
states: 595,146 (5)
abstracting: (p85<=1)
states: 7,793,983 (6)
.abstracting: (0<=p59)
states: 7,793,983 (6)
abstracting: (p59<=0)
states: 7,340,642 (6)
abstracting: (1<=p85)
states: 595,146 (5)
abstracting: (p85<=1)
states: 7,793,983 (6)
.abstracting: (0<=p59)
states: 7,793,983 (6)
abstracting: (p59<=0)
states: 7,340,642 (6)
.................................
EG iterations: 33
abstracting: (0<=p102)
states: 7,793,983 (6)
abstracting: (p102<=0)
states: 6,603,691 (6)
abstracting: (1<=p19)
states: 432,220 (5)
abstracting: (p19<=1)
states: 7,793,983 (6)
abstracting: (0<=p81)
states: 7,793,983 (6)
abstracting: (p81<=0)
states: 7,198,837 (6)
abstracting: (1<=p17)
states: 432,220 (5)
abstracting: (p17<=1)
states: 7,793,983 (6)
abstracting: (0<=p101)
states: 7,793,983 (6)
abstracting: (p101<=0)
states: 6,603,691 (6)
abstracting: (1<=p35)
states: 432,220 (5)
abstracting: (p35<=1)
states: 7,793,983 (6)
.................................
EG iterations: 33
abstracting: (0<=p49)
states: 7,793,983 (6)
abstracting: (p49<=0)
states: 7,372,288 (6)
abstracting: (1<=p80)
states: 123,426 (5)
abstracting: (p80<=1)
states: 7,793,983 (6)

EG iterations: 0
-> the formula is FALSE

FORMULA GPUForwardProgress-PT-04b-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.333sec

checking: [EX [[p50<=0 & 0<=p50]] & [EF [[E [AG [[p39<=1 & 1<=p39]] U AG [[[p4<=0 & 0<=p4] | [p68<=1 & 1<=p68]]]] & [[AG [[p86<=0 & 0<=p86]] | EG [[[p103<=0 & 0<=p103] | [p74<=1 & 1<=p74]]]] | [[p102<=1 & 1<=p102] | [[[p3<=0 & 0<=p3] | [p0<=1 & 1<=p0]] & [[[p102<=0 & 0<=p102] | [p77<=1 & 1<=p77]] & [p46<=1 & 1<=p46]]]]]]] & AG [[[AF [[p8<=0 & 0<=p8]] | [p86<=0 & 0<=p86]] | [[p56<=1 & 1<=p56] | [p30<=1 & 1<=p30]]]]]]
normalized: [[~ [E [true U ~ [[[[p30<=1 & 1<=p30] | [p56<=1 & 1<=p56]] | [[p86<=0 & 0<=p86] | ~ [EG [~ [[p8<=0 & 0<=p8]]]]]]]]] & E [true U [[[[[[p46<=1 & 1<=p46] & [[p77<=1 & 1<=p77] | [p102<=0 & 0<=p102]]] & [[p0<=1 & 1<=p0] | [p3<=0 & 0<=p3]]] | [p102<=1 & 1<=p102]] | [EG [[[p74<=1 & 1<=p74] | [p103<=0 & 0<=p103]]] | ~ [E [true U ~ [[p86<=0 & 0<=p86]]]]]] & E [~ [E [true U ~ [[p39<=1 & 1<=p39]]]] U ~ [E [true U ~ [[[p68<=1 & 1<=p68] | [p4<=0 & 0<=p4]]]]]]]]] & EX [[p50<=0 & 0<=p50]]]

abstracting: (0<=p50)
states: 7,793,983 (6)
abstracting: (p50<=0)
states: 7,372,288 (6)
.abstracting: (0<=p4)
states: 7,793,983 (6)
abstracting: (p4<=0)
states: 7,770,667 (6)
abstracting: (1<=p68)
states: 446,112 (5)
abstracting: (p68<=1)
states: 7,793,983 (6)
abstracting: (1<=p39)
states: 427,814 (5)
abstracting: (p39<=1)
states: 7,793,983 (6)
abstracting: (0<=p86)
states: 7,793,983 (6)
abstracting: (p86<=0)
states: 7,198,837 (6)
abstracting: (0<=p103)
states: 7,793,983 (6)
abstracting: (p103<=0)
states: 6,603,691 (6)
abstracting: (1<=p74)
states: 453,341 (5)
abstracting: (p74<=1)
states: 7,793,983 (6)
........................................
EG iterations: 40
abstracting: (1<=p102)
states: 1,190,292 (6)
abstracting: (p102<=1)
states: 7,793,983 (6)
abstracting: (0<=p3)
states: 7,793,983 (6)
abstracting: (p3<=0)
states: 7,792,826 (6)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 7,793,983 (6)
abstracting: (0<=p102)
states: 7,793,983 (6)
abstracting: (p102<=0)
states: 6,603,691 (6)
abstracting: (1<=p77)
states: 694,566 (5)
abstracting: (p77<=1)
states: 7,793,983 (6)
abstracting: (1<=p46)
states: 421,695 (5)
abstracting: (p46<=1)
states: 7,793,983 (6)
abstracting: (0<=p8)
states: 7,793,983 (6)
abstracting: (p8<=0)
states: 7,373,539 (6)
.................................
EG iterations: 33
abstracting: (0<=p86)
states: 7,793,983 (6)
abstracting: (p86<=0)
states: 7,198,837 (6)
abstracting: (1<=p56)
states: 433,655 (5)
abstracting: (p56<=1)
states: 7,793,983 (6)
abstracting: (1<=p30)
states: 420,444 (5)
abstracting: (p30<=1)
states: 7,793,983 (6)
-> the formula is FALSE

FORMULA GPUForwardProgress-PT-04b-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.302sec

totally nodes used: 5207551 (5.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 7253420 17847932 25101352
used/not used/entry size/cache size: 19567208 47541656 16 1024MB
basic ops cache: hits/miss/sum: 646310 1660689 2306999
used/not used/entry size/cache size: 2694101 14083115 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: 31304 78135 109439
used/not used/entry size/cache size: 77792 8310816 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 62486546
1 4118074
2 433377
3 62137
4 7833
5 761
6 72
7 3
8 27
9 10
>= 10 24

Total processing time: 0m14.972sec


BK_STOP 1678517062660

--------------------
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:5037 (43), effective:776 (6)

initing FirstDep: 0m 0.000sec


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

iterations count:629 (5), effective:64 (0)

iterations count:120 (1), effective:3 (0)

iterations count:124 (1), effective:5 (0)

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

iterations count:899 (7), effective:113 (0)

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

iterations count:475 (4), effective:46 (0)

iterations count:631 (5), effective:76 (0)

iterations count:216 (1), effective:8 (0)

iterations count:133 (1), effective:5 (0)

iterations count:457 (3), effective:41 (0)

iterations count:1463 (12), effective:181 (1)

iterations count:130 (1), effective:5 (0)

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

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

iterations count:479 (4), effective:47 (0)

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

iterations count:1765 (15), effective:229 (1)

iterations count:876 (7), effective:101 (0)

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

iterations count:172 (1), effective:18 (0)

iterations count:162 (1), effective:14 (0)

iterations count:164 (1), effective:15 (0)

iterations count:139 (1), effective:5 (0)

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

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

iterations count:883 (7), effective:113 (0)

iterations count:207 (1), effective:27 (0)

iterations count:551 (4), effective:59 (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="GPUForwardProgress-PT-04b"
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 GPUForwardProgress-PT-04b, 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 r202-smll-167840348100009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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