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-167840348700426.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 HirschbergSinclair-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348700426
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 12K Feb 26 02:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 02:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 02:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 02:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 02:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 02:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 02:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 02:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 157K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HirschbergSinclair-PT-05-CTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-05-CTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-05-CTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-05-CTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-05-CTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-05-CTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-05-CTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-05-CTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-05-CTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-05-CTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-05-CTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-05-CTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-05-CTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-05-CTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-05-CTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-05-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678784058796

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-05
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 08:54:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 08:54:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 08:54:22] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2023-03-14 08:54:22] [INFO ] Transformed 124 places.
[2023-03-14 08:54:22] [INFO ] Transformed 111 transitions.
[2023-03-14 08:54:22] [INFO ] Parsed PT model containing 124 places and 111 transitions and 340 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 84 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 119 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 118 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 118 transition count 110
Applied a total of 7 rules in 45 ms. Remains 118 /124 variables (removed 6) and now considering 110/111 (removed 1) transitions.
// Phase 1: matrix 110 rows 118 cols
[2023-03-14 08:54:22] [INFO ] Computed 8 place invariants in 31 ms
[2023-03-14 08:54:22] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-03-14 08:54:22] [INFO ] Invariant cache hit.
[2023-03-14 08:54:22] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
[2023-03-14 08:54:22] [INFO ] Invariant cache hit.
[2023-03-14 08:54:22] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/124 places, 110/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 759 ms. Remains : 118/124 places, 110/111 transitions.
Support contains 84 out of 118 places after structural reductions.
[2023-03-14 08:54:23] [INFO ] Flatten gal took : 49 ms
[2023-03-14 08:54:23] [INFO ] Flatten gal took : 24 ms
[2023-03-14 08:54:23] [INFO ] Input system was already deterministic with 110 transitions.
Incomplete random walk after 10000 steps, including 90 resets, run finished after 635 ms. (steps per millisecond=15 ) properties (out of 70) seen :65
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-14 08:54:24] [INFO ] Invariant cache hit.
[2023-03-14 08:54:24] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 15 ms returned sat
[2023-03-14 08:54:24] [INFO ] After 141ms SMT Verify possible using state equation in real domain returned unsat :3 sat :1
[2023-03-14 08:54:24] [INFO ] After 195ms SMT Verify possible using trap constraints in real domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-14 08:54:24] [INFO ] After 404ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 110/110 transitions.
Graph (complete) has 221 edges and 118 vertex of which 113 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 113 transition count 60
Reduce places removed 45 places and 0 transitions.
Graph (complete) has 114 edges and 68 vertex of which 52 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 46 rules applied. Total rules applied 97 place count 52 transition count 60
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 113 place count 52 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 113 place count 52 transition count 43
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 115 place count 51 transition count 43
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 50 transition count 42
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 50 transition count 42
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 118 place count 50 transition count 41
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 83 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 120 place count 48 transition count 41
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 121 place count 48 transition count 40
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 126 place count 43 transition count 35
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 7 rules applied. Total rules applied 133 place count 40 transition count 31
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 137 place count 36 transition count 31
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 13 Pre rules applied. Total rules applied 137 place count 36 transition count 18
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 163 place count 23 transition count 18
Applied a total of 163 rules in 55 ms. Remains 23 /118 variables (removed 95) and now considering 18/110 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 23/118 places, 18/110 transitions.
Incomplete random walk after 10000 steps, including 526 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 269 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 147 steps, run visited all 1 properties in 18 ms. (steps per millisecond=8 )
Probabilistic random walk after 147 steps, saw 70 distinct states, run finished after 18 ms. (steps per millisecond=8 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 24 ms
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 20 ms
[2023-03-14 08:54:25] [INFO ] Input system was already deterministic with 110 transitions.
Support contains 78 out of 118 places (down from 81) after GAL structural reductions.
Computed a total of 118 stabilizing places and 110 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 118 transition count 110
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 110/110 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 114 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 114 transition count 106
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 111 transition count 103
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 111 transition count 103
Applied a total of 14 rules in 23 ms. Remains 111 /118 variables (removed 7) and now considering 103/110 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 111/118 places, 103/110 transitions.
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 8 ms
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 9 ms
[2023-03-14 08:54:25] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 110/110 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 113 transition count 105
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 113 transition count 105
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 109 transition count 101
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 109 transition count 101
Applied a total of 18 rules in 20 ms. Remains 109 /118 variables (removed 9) and now considering 101/110 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 109/118 places, 101/110 transitions.
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 8 ms
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 8 ms
[2023-03-14 08:54:25] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 110/110 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 115 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 115 transition count 107
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 112 transition count 104
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 112 transition count 104
Applied a total of 12 rules in 8 ms. Remains 112 /118 variables (removed 6) and now considering 104/110 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 112/118 places, 104/110 transitions.
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 8 ms
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 8 ms
[2023-03-14 08:54:25] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 110/110 transitions.
Reduce places removed 3 places and 3 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 115 transition count 81
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 89 transition count 81
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 84 transition count 76
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 84 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 83 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 83 transition count 75
Applied a total of 64 rules in 15 ms. Remains 83 /118 variables (removed 35) and now considering 75/110 (removed 35) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 83/118 places, 75/110 transitions.
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 5 ms
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 5 ms
[2023-03-14 08:54:25] [INFO ] Input system was already deterministic with 75 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 110/110 transitions.
Reduce places removed 3 places and 3 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 115 transition count 81
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 89 transition count 81
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 85 transition count 77
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 85 transition count 77
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 85 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 62 place count 84 transition count 76
Applied a total of 62 rules in 13 ms. Remains 84 /118 variables (removed 34) and now considering 76/110 (removed 34) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 84/118 places, 76/110 transitions.
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 5 ms
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 5 ms
[2023-03-14 08:54:25] [INFO ] Input system was already deterministic with 76 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 117 transition count 94
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 102 transition count 94
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 34 place count 98 transition count 90
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 98 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 97 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 97 transition count 89
Applied a total of 40 rules in 15 ms. Remains 97 /118 variables (removed 21) and now considering 89/110 (removed 21) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 97/118 places, 89/110 transitions.
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 6 ms
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 6 ms
[2023-03-14 08:54:25] [INFO ] Input system was already deterministic with 89 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 110/110 transitions.
Reduce places removed 4 places and 4 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 114 transition count 68
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 76 transition count 68
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 71 transition count 63
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 71 transition count 63
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 70 transition count 62
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 70 transition count 62
Applied a total of 88 rules in 11 ms. Remains 70 /118 variables (removed 48) and now considering 62/110 (removed 48) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 70/118 places, 62/110 transitions.
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 3 ms
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 4 ms
[2023-03-14 08:54:25] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 110/110 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 114 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 114 transition count 106
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 111 transition count 103
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 111 transition count 103
Applied a total of 14 rules in 7 ms. Remains 111 /118 variables (removed 7) and now considering 103/110 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 111/118 places, 103/110 transitions.
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 7 ms
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 7 ms
[2023-03-14 08:54:25] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 110/110 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 113 transition count 105
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 113 transition count 105
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 110 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 110 transition count 102
Applied a total of 16 rules in 7 ms. Remains 110 /118 variables (removed 8) and now considering 102/110 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 110/118 places, 102/110 transitions.
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 6 ms
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 6 ms
[2023-03-14 08:54:25] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 110/110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 117 transition count 101
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 109 transition count 101
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 105 transition count 97
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 105 transition count 97
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 105 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 104 transition count 96
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 27 place count 103 transition count 95
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 103 transition count 95
Applied a total of 28 rules in 19 ms. Remains 103 /118 variables (removed 15) and now considering 95/110 (removed 15) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 103/118 places, 95/110 transitions.
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 6 ms
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 7 ms
[2023-03-14 08:54:25] [INFO ] Input system was already deterministic with 95 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 110/110 transitions.
Reduce places removed 3 places and 3 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 115 transition count 81
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 89 transition count 81
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 84 transition count 76
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 84 transition count 76
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 84 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 83 transition count 75
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 82 transition count 74
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 82 transition count 74
Applied a total of 66 rules in 22 ms. Remains 82 /118 variables (removed 36) and now considering 74/110 (removed 36) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 82/118 places, 74/110 transitions.
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 8 ms
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 7 ms
[2023-03-14 08:54:25] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 110/110 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 113 transition count 105
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 113 transition count 105
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 109 transition count 101
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 109 transition count 101
Applied a total of 18 rules in 14 ms. Remains 109 /118 variables (removed 9) and now considering 101/110 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 109/118 places, 101/110 transitions.
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 9 ms
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 10 ms
[2023-03-14 08:54:25] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 110/110 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 113 transition count 105
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 113 transition count 105
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 109 transition count 101
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 109 transition count 101
Applied a total of 18 rules in 11 ms. Remains 109 /118 variables (removed 9) and now considering 101/110 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 109/118 places, 101/110 transitions.
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 9 ms
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 11 ms
[2023-03-14 08:54:25] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 110/110 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 115 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 115 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 114 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 114 transition count 106
Applied a total of 8 rules in 10 ms. Remains 114 /118 variables (removed 4) and now considering 106/110 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 114/118 places, 106/110 transitions.
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 10 ms
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 10 ms
[2023-03-14 08:54:25] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 110/110 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 114 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 114 transition count 106
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 111 transition count 103
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 111 transition count 103
Applied a total of 14 rules in 11 ms. Remains 111 /118 variables (removed 7) and now considering 103/110 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 111/118 places, 103/110 transitions.
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 9 ms
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 9 ms
[2023-03-14 08:54:25] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 110/110 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 115 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 115 transition count 107
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 113 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 113 transition count 105
Applied a total of 10 rules in 10 ms. Remains 113 /118 variables (removed 5) and now considering 105/110 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 113/118 places, 105/110 transitions.
[2023-03-14 08:54:25] [INFO ] Flatten gal took : 9 ms
[2023-03-14 08:54:26] [INFO ] Flatten gal took : 9 ms
[2023-03-14 08:54:26] [INFO ] Input system was already deterministic with 105 transitions.
[2023-03-14 08:54:26] [INFO ] Flatten gal took : 10 ms
[2023-03-14 08:54:26] [INFO ] Flatten gal took : 10 ms
[2023-03-14 08:54:26] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-14 08:54:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 118 places, 110 transitions and 330 arcs took 2 ms.
Total runtime 4274 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 118 NrTr: 110 NrArc: 330)

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

net check time: 0m 0.000sec

init dd package: 0m 3.692sec


RS generation: 0m 0.445sec


-> reachability set: #nodes 11744 (1.2e+04) #states 5,464,817 (6)



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

checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]

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

FORMULA HirschbergSinclair-PT-05-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.295sec

checking: AG [EF [[1<=p9 & 1<=p73]]]
normalized: ~ [E [true U ~ [E [true U [1<=p9 & 1<=p73]]]]]

abstracting: (1<=p73)
states: 215,812 (5)
abstracting: (1<=p9)
states: 2,775,981 (6)
-> the formula is FALSE

FORMULA HirschbergSinclair-PT-05-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.329sec

checking: E [~ [[1<=p5 & 1<=p22]] U AF [[1<=p3 & 1<=p52]]]
normalized: E [~ [[1<=p5 & 1<=p22]] U ~ [EG [~ [[1<=p3 & 1<=p52]]]]]

abstracting: (1<=p52)
states: 114,564 (5)
abstracting: (1<=p3)
states: 2,349,025 (6)
...............................................
EG iterations: 47
abstracting: (1<=p22)
states: 1,374,471 (6)
abstracting: (1<=p5)
states: 2,303,263 (6)
-> the formula is TRUE

FORMULA HirschbergSinclair-PT-05-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.318sec

checking: EF [AG [[AG [p87<=0] & [[1<=p9 & 1<=p90] | [1<=p5 & 1<=p22]]]]]
normalized: E [true U ~ [E [true U ~ [[[[1<=p5 & 1<=p22] | [1<=p9 & 1<=p90]] & ~ [E [true U ~ [p87<=0]]]]]]]]

abstracting: (p87<=0)
states: 5,368,347 (6)
abstracting: (1<=p90)
states: 212,347 (5)
abstracting: (1<=p9)
states: 2,775,981 (6)
abstracting: (1<=p22)
states: 1,374,471 (6)
abstracting: (1<=p5)
states: 2,303,263 (6)
-> the formula is FALSE

FORMULA HirschbergSinclair-PT-05-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.364sec

checking: AG [[AX [EF [[[p7<=0 | p41<=0] & p48<=0]]] | [p5<=0 | p107<=0]]]
normalized: ~ [E [true U ~ [[[p5<=0 | p107<=0] | ~ [EX [~ [E [true U [p48<=0 & [p7<=0 | p41<=0]]]]]]]]]]

abstracting: (p41<=0)
states: 5,343,218 (6)
abstracting: (p7<=0)
states: 2,921,941 (6)
abstracting: (p48<=0)
states: 5,400,937 (6)
.abstracting: (p107<=0)
states: 5,306,780 (6)
abstracting: (p5<=0)
states: 3,161,554 (6)
-> the formula is TRUE

FORMULA HirschbergSinclair-PT-05-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.045sec

checking: [AF [EX [AG [[p62<=0 & p29<=0]]]] | EF [~ [E [[1<=p44 | EF [1<=p60]] U 1<=p46]]]]
normalized: [E [true U ~ [E [[1<=p44 | E [true U 1<=p60]] U 1<=p46]]] | ~ [EG [~ [EX [~ [E [true U ~ [[p62<=0 & p29<=0]]]]]]]]]

abstracting: (p29<=0)
states: 4,735,987 (6)
abstracting: (p62<=0)
states: 5,367,513 (6)
..........................................................................................................
EG iterations: 105
abstracting: (1<=p46)
states: 67,848 (4)
abstracting: (1<=p60)
states: 115,952 (5)
abstracting: (1<=p44)
states: 58,839 (4)
-> the formula is TRUE

FORMULA HirschbergSinclair-PT-05-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.244sec

checking: [AG [~ [E [[1<=p3 & 1<=p97] U E [AX [1<=p8] U ~ [[1<=p75 & 1<=p92]]]]]] | EG [[p5<=0 | p69<=0]]]
normalized: [EG [[p5<=0 | p69<=0]] | ~ [E [true U E [[1<=p3 & 1<=p97] U E [~ [EX [~ [1<=p8]]] U ~ [[1<=p75 & 1<=p92]]]]]]]

abstracting: (1<=p92)
states: 212,347 (5)
abstracting: (1<=p75)
states: 215,812 (5)
abstracting: (1<=p8)
states: 2,692 (3)
.abstracting: (1<=p97)
states: 158,037 (5)
abstracting: (1<=p3)
states: 2,349,025 (6)
abstracting: (p69<=0)
states: 5,249,005 (6)
abstracting: (p5<=0)
states: 3,161,554 (6)
................................................................................
EG iterations: 80
-> the formula is FALSE

FORMULA HirschbergSinclair-PT-05-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.481sec

checking: EG [E [[EF [[[1<=p1 & 1<=p88] | [[1<=p1 & 1<=p50] | [1<=p5 & 1<=p114]]]] | 1<=p72] U 1<=p19]]
normalized: EG [E [[1<=p72 | E [true U [[1<=p1 & 1<=p88] | [[1<=p1 & 1<=p50] | [1<=p5 & 1<=p114]]]]] U 1<=p19]]

abstracting: (1<=p19)
states: 1,150,061 (6)
abstracting: (1<=p114)
states: 138,776 (5)
abstracting: (1<=p5)
states: 2,303,263 (6)
abstracting: (1<=p50)
states: 114,564 (5)
abstracting: (1<=p1)
states: 3,512,209 (6)
abstracting: (1<=p88)
states: 212,347 (5)
abstracting: (1<=p1)
states: 3,512,209 (6)
abstracting: (1<=p72)
states: 115,952 (5)
............................................................................................................
EG iterations: 108
-> the formula is FALSE

FORMULA HirschbergSinclair-PT-05-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.699sec

checking: EF [[[EX [p51<=0] & 1<=p48] & [[p5<=0 | p84<=0] & [[p5<=0 | p107<=0] & [1<=p39 | [p25<=0 & p98<=0]]]]]]
normalized: E [true U [[[[1<=p39 | [p25<=0 & p98<=0]] & [p5<=0 | p107<=0]] & [p5<=0 | p84<=0]] & [1<=p48 & EX [p51<=0]]]]

abstracting: (p51<=0)
states: 5,375,207 (6)
.abstracting: (1<=p48)
states: 63,880 (4)
abstracting: (p84<=0)
states: 5,252,470 (6)
abstracting: (p5<=0)
states: 3,161,554 (6)
abstracting: (p107<=0)
states: 5,306,780 (6)
abstracting: (p5<=0)
states: 3,161,554 (6)
abstracting: (p98<=0)
states: 5,393,379 (6)
abstracting: (p25<=0)
states: 4,194,978 (6)
abstracting: (1<=p39)
states: 32,996 (4)
-> the formula is TRUE

FORMULA HirschbergSinclair-PT-05-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.098sec

checking: A [~ [[p108<=0 & [~ [[[AG [1<=p19] | p4<=0] & ~ [[[1<=p5 & 1<=p26] | [1<=p7 & 1<=p41]]]]] & AF [[1<=p35 & 1<=p40]]]]] U AG [AX [~ [A [1<=p42 U 1<=p110]]]]]
normalized: [~ [EG [E [true U EX [[~ [EG [~ [1<=p110]]] & ~ [E [~ [1<=p110] U [~ [1<=p42] & ~ [1<=p110]]]]]]]]] & ~ [E [E [true U EX [[~ [EG [~ [1<=p110]]] & ~ [E [~ [1<=p110] U [~ [1<=p42] & ~ [1<=p110]]]]]]] U [[p108<=0 & [~ [EG [~ [[1<=p35 & 1<=p40]]]] & ~ [[~ [[[1<=p7 & 1<=p41] | [1<=p5 & 1<=p26]]] & [p4<=0 | ~ [E [true U ~ [1<=p19]]]]]]]] & E [true U EX [[~ [EG [~ [1<=p110]]] & ~ [E [~ [1<=p110] U [~ [1<=p42] & ~ [1<=p110]]]]]]]]]]]

abstracting: (1<=p110)
states: 73,826 (4)
abstracting: (1<=p42)
states: 68,625 (4)
abstracting: (1<=p110)
states: 73,826 (4)
abstracting: (1<=p110)
states: 73,826 (4)
.
EG iterations: 1
.abstracting: (1<=p19)
states: 1,150,061 (6)
abstracting: (p4<=0)
states: 5,460,157 (6)
abstracting: (1<=p26)
states: 1,364,171 (6)
abstracting: (1<=p5)
states: 2,303,263 (6)
abstracting: (1<=p41)
states: 121,599 (5)
abstracting: (1<=p7)
states: 2,542,876 (6)
abstracting: (1<=p40)
states: 66,794 (4)
abstracting: (1<=p35)
states: 70,280 (4)
....................................
EG iterations: 36
abstracting: (p108<=0)
states: 5,396,115 (6)
abstracting: (1<=p110)
states: 73,826 (4)
abstracting: (1<=p42)
states: 68,625 (4)
abstracting: (1<=p110)
states: 73,826 (4)
abstracting: (1<=p110)
states: 73,826 (4)
.
EG iterations: 1
.abstracting: (1<=p110)
states: 73,826 (4)
abstracting: (1<=p42)
states: 68,625 (4)
abstracting: (1<=p110)
states: 73,826 (4)
abstracting: (1<=p110)
states: 73,826 (4)
.
EG iterations: 1
.........................................................................................................
EG iterations: 104
-> the formula is FALSE

FORMULA HirschbergSinclair-PT-05-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.121sec

checking: [AG [A [E [[1<=p55 & EF [1<=p60]] U 1<=p72] U AF [[1<=p104 & 1<=p29]]]] | EF [~ [E [[1<=p3 & 1<=p52] U [[EG [[1<=p7 & 1<=p109]] | ~ [[1<=p1 & 1<=p88]]] | [[1<=p5 & 1<=p22] | 1<=p51]]]]]]
normalized: [~ [E [true U ~ [[~ [EG [EG [~ [[1<=p104 & 1<=p29]]]]] & ~ [E [EG [~ [[1<=p104 & 1<=p29]]] U [~ [E [[1<=p55 & E [true U 1<=p60]] U 1<=p72]] & EG [~ [[1<=p104 & 1<=p29]]]]]]]]]] | E [true U ~ [E [[1<=p3 & 1<=p52] U [[1<=p51 | [1<=p5 & 1<=p22]] | [~ [[1<=p1 & 1<=p88]] | EG [[1<=p7 & 1<=p109]]]]]]]]

abstracting: (1<=p109)
states: 158,037 (5)
abstracting: (1<=p7)
states: 2,542,876 (6)
............................
EG iterations: 28
abstracting: (1<=p88)
states: 212,347 (5)
abstracting: (1<=p1)
states: 3,512,209 (6)
abstracting: (1<=p22)
states: 1,374,471 (6)
abstracting: (1<=p5)
states: 2,303,263 (6)
abstracting: (1<=p51)
states: 89,610 (4)
abstracting: (1<=p52)
states: 114,564 (5)
abstracting: (1<=p3)
states: 2,349,025 (6)
abstracting: (1<=p29)
states: 728,830 (5)
abstracting: (1<=p104)
states: 111,590 (5)
.
EG iterations: 1
abstracting: (1<=p72)
states: 115,952 (5)
abstracting: (1<=p60)
states: 115,952 (5)
abstracting: (1<=p55)
states: 88,854 (4)
abstracting: (1<=p29)
states: 728,830 (5)
abstracting: (1<=p104)
states: 111,590 (5)
.
EG iterations: 1
abstracting: (1<=p29)
states: 728,830 (5)
abstracting: (1<=p104)
states: 111,590 (5)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA HirschbergSinclair-PT-05-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.401sec

checking: E [[EF [1<=p19] | A [A [[1<=p9 & 1<=p30] U [~ [[1<=p1 & 1<=p103]] & EX [[1<=p7 & 1<=p82]]]] U 1<=p8]] U [AG [A [EX [1<=p51] U ~ [[1<=p9 & 1<=p33]]]] & [~ [EF [[1<=p3 & 1<=p63]]] & EX [[1<=p7 & 1<=p82]]]]]
normalized: E [[[~ [EG [~ [1<=p8]]] & ~ [E [~ [1<=p8] U [~ [[~ [EG [~ [[EX [[1<=p7 & 1<=p82]] & ~ [[1<=p1 & 1<=p103]]]]]] & ~ [E [~ [[EX [[1<=p7 & 1<=p82]] & ~ [[1<=p1 & 1<=p103]]]] U [~ [[1<=p9 & 1<=p30]] & ~ [[EX [[1<=p7 & 1<=p82]] & ~ [[1<=p1 & 1<=p103]]]]]]]]] & ~ [1<=p8]]]]] | E [true U 1<=p19]] U [[EX [[1<=p7 & 1<=p82]] & ~ [E [true U [1<=p3 & 1<=p63]]]] & ~ [E [true U ~ [[~ [EG [[1<=p9 & 1<=p33]]] & ~ [E [[1<=p9 & 1<=p33] U [~ [EX [1<=p51]] & [1<=p9 & 1<=p33]]]]]]]]]]

abstracting: (1<=p33)
states: 70,280 (4)
abstracting: (1<=p9)
states: 2,775,981 (6)
abstracting: (1<=p51)
states: 89,610 (4)
.abstracting: (1<=p33)
states: 70,280 (4)
abstracting: (1<=p9)
states: 2,775,981 (6)
abstracting: (1<=p33)
states: 70,280 (4)
abstracting: (1<=p9)
states: 2,775,981 (6)
.........................
EG iterations: 25
abstracting: (1<=p63)
states: 215,812 (5)
abstracting: (1<=p3)
states: 2,349,025 (6)
abstracting: (1<=p82)
states: 212,347 (5)
abstracting: (1<=p7)
states: 2,542,876 (6)
.abstracting: (1<=p19)
states: 1,150,061 (6)
abstracting: (1<=p8)
states: 2,692 (3)
abstracting: (1<=p103)
states: 158,037 (5)
abstracting: (1<=p1)
states: 3,512,209 (6)
abstracting: (1<=p82)
states: 212,347 (5)
abstracting: (1<=p7)
states: 2,542,876 (6)
.abstracting: (1<=p30)
states: 2,385,255 (6)
abstracting: (1<=p9)
states: 2,775,981 (6)
abstracting: (1<=p103)
states: 158,037 (5)
abstracting: (1<=p1)
states: 3,512,209 (6)
abstracting: (1<=p82)
states: 212,347 (5)
abstracting: (1<=p7)
states: 2,542,876 (6)
.abstracting: (1<=p103)
states: 158,037 (5)
abstracting: (1<=p1)
states: 3,512,209 (6)
abstracting: (1<=p82)
states: 212,347 (5)
abstracting: (1<=p7)
states: 2,542,876 (6)
............................................................................
EG iterations: 75
abstracting: (1<=p8)
states: 2,692 (3)
abstracting: (1<=p8)
states: 2,692 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA HirschbergSinclair-PT-05-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.873sec

checking: [AF [~ [A [EF [p17<=0] U [[1<=p98 & [1<=p49 & 1<=p58]] | [[1<=p9 & [1<=p111 & 1<=p108]] | ~ [[1<=p7 & 1<=p45]]]]]]] | A [[1<=p1 & 1<=p14] U EG [[AG [[1<=p79 | [1<=p7 & 1<=p31]]] & 1<=p100]]]]
normalized: [[~ [E [~ [EG [[1<=p100 & ~ [E [true U ~ [[1<=p79 | [1<=p7 & 1<=p31]]]]]]]] U [~ [[1<=p1 & 1<=p14]] & ~ [EG [[1<=p100 & ~ [E [true U ~ [[1<=p79 | [1<=p7 & 1<=p31]]]]]]]]]]] & ~ [EG [~ [EG [[1<=p100 & ~ [E [true U ~ [[1<=p79 | [1<=p7 & 1<=p31]]]]]]]]]]] | ~ [EG [[~ [EG [~ [[[~ [[1<=p7 & 1<=p45]] | [1<=p9 & [1<=p111 & 1<=p108]]] | [1<=p98 & [1<=p49 & 1<=p58]]]]]] & ~ [E [~ [[[~ [[1<=p7 & 1<=p45]] | [1<=p9 & [1<=p111 & 1<=p108]]] | [1<=p98 & [1<=p49 & 1<=p58]]]] U [~ [E [true U p17<=0]] & ~ [[[~ [[1<=p7 & 1<=p45]] | [1<=p9 & [1<=p111 & 1<=p108]]] | [1<=p98 & [1<=p49 & 1<=p58]]]]]]]]]]]

abstracting: (1<=p58)
states: 113,808 (5)
abstracting: (1<=p49)
states: 120,822 (5)
abstracting: (1<=p98)
states: 71,438 (4)
abstracting: (1<=p108)
states: 68,702 (4)
abstracting: (1<=p111)
states: 158,037 (5)
abstracting: (1<=p9)
states: 2,775,981 (6)
abstracting: (1<=p45)
states: 120,822 (5)
abstracting: (1<=p7)
states: 2,542,876 (6)
abstracting: (p17<=0)
states: 4,844,085 (6)
abstracting: (1<=p58)
states: 113,808 (5)
abstracting: (1<=p49)
states: 120,822 (5)
abstracting: (1<=p98)
states: 71,438 (4)
abstracting: (1<=p108)
states: 68,702 (4)
abstracting: (1<=p111)
states: 158,037 (5)
abstracting: (1<=p9)
states: 2,775,981 (6)
abstracting: (1<=p45)
states: 120,822 (5)
abstracting: (1<=p7)
states: 2,542,876 (6)
abstracting: (1<=p58)
states: 113,808 (5)
abstracting: (1<=p49)
states: 120,822 (5)
abstracting: (1<=p98)
states: 71,438 (4)
abstracting: (1<=p108)
states: 68,702 (4)
abstracting: (1<=p111)
states: 158,037 (5)
abstracting: (1<=p9)
states: 2,775,981 (6)
abstracting: (1<=p45)
states: 120,822 (5)
abstracting: (1<=p7)
states: 2,542,876 (6)
.............................
EG iterations: 29

EG iterations: 0
abstracting: (1<=p31)
states: 72,887 (4)
abstracting: (1<=p7)
states: 2,542,876 (6)
abstracting: (1<=p79)
states: 96,470 (4)
abstracting: (1<=p100)
states: 111,590 (5)
.
EG iterations: 1

EG iterations: 0
abstracting: (1<=p31)
states: 72,887 (4)
abstracting: (1<=p7)
states: 2,542,876 (6)
abstracting: (1<=p79)
states: 96,470 (4)
abstracting: (1<=p100)
states: 111,590 (5)
.
EG iterations: 1
abstracting: (1<=p14)
states: 1,278,825 (6)
abstracting: (1<=p1)
states: 3,512,209 (6)
abstracting: (1<=p31)
states: 72,887 (4)
abstracting: (1<=p7)
states: 2,542,876 (6)
abstracting: (1<=p79)
states: 96,470 (4)
abstracting: (1<=p100)
states: 111,590 (5)
.
EG iterations: 1
-> the formula is FALSE

FORMULA HirschbergSinclair-PT-05-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.490sec

checking: [AG [[p5<=0 | p61<=0]] & EF [[[EG [[1<=p3 & [1<=p115 & [p3<=0 | p86<=0]]]] | AX [[[p7<=0 | p28<=0] | [p9<=0 | p73<=0]]]] & [[1<=p3 & 1<=p78] | [EF [[1<=p5 & 1<=p43]] | EX [1<=p74]]]]]]
normalized: [E [true U [[[EX [1<=p74] | E [true U [1<=p5 & 1<=p43]]] | [1<=p3 & 1<=p78]] & [~ [EX [~ [[[p9<=0 | p73<=0] | [p7<=0 | p28<=0]]]]] | EG [[1<=p3 & [1<=p115 & [p3<=0 | p86<=0]]]]]]] & ~ [E [true U ~ [[p5<=0 | p61<=0]]]]]

abstracting: (p61<=0)
states: 5,249,005 (6)
abstracting: (p5<=0)
states: 3,161,554 (6)
abstracting: (p86<=0)
states: 5,252,470 (6)
abstracting: (p3<=0)
states: 3,115,792 (6)
abstracting: (1<=p115)
states: 61,584 (4)
abstracting: (1<=p3)
states: 2,349,025 (6)
............
EG iterations: 12
abstracting: (p28<=0)
states: 4,105,086 (6)
abstracting: (p7<=0)
states: 2,921,941 (6)
abstracting: (p73<=0)
states: 5,249,005 (6)
abstracting: (p9<=0)
states: 2,688,836 (6)
.abstracting: (1<=p78)
states: 212,347 (5)
abstracting: (1<=p3)
states: 2,349,025 (6)
abstracting: (1<=p43)
states: 121,599 (5)
abstracting: (1<=p5)
states: 2,303,263 (6)
abstracting: (1<=p74)
states: 118,160 (5)
.-> the formula is FALSE

FORMULA HirschbergSinclair-PT-05-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.413sec

checking: AF [[A [[EG [AG [[1<=p5 & 1<=p95]]] | ~ [EF [[1<=p7 & 1<=p82]]]] U [AG [[1<=p87 | 1<=p102]] | 1<=p72]] & [EG [[EX [[p7<=0 | p93<=0]] & p17<=0]] | E [~ [[E [1<=p106 U [1<=p7 & 1<=p24]] | [[1<=p9 & 1<=p117] & [1<=p9 & 1<=p101]]]] U 1<=p110]]]]
normalized: ~ [EG [~ [[[E [~ [[[[1<=p9 & 1<=p101] & [1<=p9 & 1<=p117]] | E [1<=p106 U [1<=p7 & 1<=p24]]]] U 1<=p110] | EG [[p17<=0 & EX [[p7<=0 | p93<=0]]]]] & [~ [EG [~ [[1<=p72 | ~ [E [true U ~ [[1<=p87 | 1<=p102]]]]]]]] & ~ [E [~ [[1<=p72 | ~ [E [true U ~ [[1<=p87 | 1<=p102]]]]]] U [~ [[~ [E [true U [1<=p7 & 1<=p82]]] | EG [~ [E [true U ~ [[1<=p5 & 1<=p95]]]]]]] & ~ [[1<=p72 | ~ [E [true U ~ [[1<=p87 | 1<=p102]]]]]]]]]]]]]]

abstracting: (1<=p102)
states: 84,652 (4)
abstracting: (1<=p87)
states: 96,470 (4)
abstracting: (1<=p72)
states: 115,952 (5)
abstracting: (1<=p95)
states: 158,037 (5)
abstracting: (1<=p5)
states: 2,303,263 (6)
.
EG iterations: 1
abstracting: (1<=p82)
states: 212,347 (5)
abstracting: (1<=p7)
states: 2,542,876 (6)
abstracting: (1<=p102)
states: 84,652 (4)
abstracting: (1<=p87)
states: 96,470 (4)
abstracting: (1<=p72)
states: 115,952 (5)
abstracting: (1<=p102)
states: 84,652 (4)
abstracting: (1<=p87)
states: 96,470 (4)
abstracting: (1<=p72)
states: 115,952 (5)
...................................................................................
EG iterations: 83
abstracting: (p93<=0)
states: 5,306,780 (6)
abstracting: (p7<=0)
states: 2,921,941 (6)
.abstracting: (p17<=0)
states: 4,844,085 (6)
..............................................................................................................
EG iterations: 110
abstracting: (1<=p110)
states: 73,826 (4)
abstracting: (1<=p24)
states: 2,096,458 (6)
abstracting: (1<=p7)
states: 2,542,876 (6)
abstracting: (1<=p106)
states: 71,438 (4)
abstracting: (1<=p117)
states: 18,360 (4)
abstracting: (1<=p9)
states: 2,775,981 (6)
abstracting: (1<=p101)
states: 158,037 (5)
abstracting: (1<=p9)
states: 2,775,981 (6)
......................................................................
EG iterations: 70
-> the formula is FALSE

FORMULA HirschbergSinclair-PT-05-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.421sec

checking: E [[EX [~ [[[E [[1<=p9 & 1<=p73] U 1<=p104] & 1<=p9] & [1<=p10 & [[[1<=p35 & 1<=p40] | [1<=p3 & 1<=p86]] | [1<=p53 | 1<=p81]]]]]] & [AG [[AF [[1<=p7 & 1<=p28]] | [1<=p4 | [1<=p9 & 1<=p47]]]] | [[1<=p1 & 1<=p103] | [AF [1<=p112] & ~ [A [1<=p27 U [1<=p5 & 1<=p43]]]]]]] U EG [~ [[~ [[1<=p44 | [[1<=p1 & 1<=p14] | [1<=p112 & 1<=p72]]]] | [EX [[1<=p7 & 1<=p31]] & [A [[1<=p3 & 1<=p86] U [1<=p3 & 1<=p105]] & ~ [[1<=p9 & 1<=p47]]]]]]]]
normalized: E [[[[[~ [[~ [EG [~ [[1<=p5 & 1<=p43]]]] & ~ [E [~ [[1<=p5 & 1<=p43]] U [~ [1<=p27] & ~ [[1<=p5 & 1<=p43]]]]]]] & ~ [EG [~ [1<=p112]]]] | [1<=p1 & 1<=p103]] | ~ [E [true U ~ [[[1<=p4 | [1<=p9 & 1<=p47]] | ~ [EG [~ [[1<=p7 & 1<=p28]]]]]]]]] & EX [~ [[[1<=p10 & [[1<=p53 | 1<=p81] | [[1<=p3 & 1<=p86] | [1<=p35 & 1<=p40]]]] & [1<=p9 & E [[1<=p9 & 1<=p73] U 1<=p104]]]]]] U EG [~ [[[[~ [[1<=p9 & 1<=p47]] & [~ [EG [~ [[1<=p3 & 1<=p105]]]] & ~ [E [~ [[1<=p3 & 1<=p105]] U [~ [[1<=p3 & 1<=p86]] & ~ [[1<=p3 & 1<=p105]]]]]]] & EX [[1<=p7 & 1<=p31]]] | ~ [[1<=p44 | [[1<=p112 & 1<=p72] | [1<=p1 & 1<=p14]]]]]]]]

abstracting: (1<=p14)
states: 1,278,825 (6)
abstracting: (1<=p1)
states: 3,512,209 (6)
abstracting: (1<=p72)
states: 115,952 (5)
abstracting: (1<=p112)
states: 84,652 (4)
abstracting: (1<=p44)
states: 58,839 (4)
abstracting: (1<=p31)
states: 72,887 (4)
abstracting: (1<=p7)
states: 2,542,876 (6)
.abstracting: (1<=p105)
states: 158,037 (5)
abstracting: (1<=p3)
states: 2,349,025 (6)
abstracting: (1<=p86)
states: 212,347 (5)
abstracting: (1<=p3)
states: 2,349,025 (6)
abstracting: (1<=p105)
states: 158,037 (5)
abstracting: (1<=p3)
states: 2,349,025 (6)
abstracting: (1<=p105)
states: 158,037 (5)
abstracting: (1<=p3)
states: 2,349,025 (6)
..................................
EG iterations: 34
abstracting: (1<=p47)
states: 120,822 (5)
abstracting: (1<=p9)
states: 2,775,981 (6)
....................................................
EG iterations: 52
abstracting: (1<=p104)
states: 111,590 (5)
abstracting: (1<=p73)
states: 215,812 (5)
abstracting: (1<=p9)
states: 2,775,981 (6)
abstracting: (1<=p9)
states: 2,775,981 (6)
abstracting: (1<=p40)
states: 66,794 (4)
abstracting: (1<=p35)
states: 70,280 (4)
abstracting: (1<=p86)
states: 212,347 (5)
abstracting: (1<=p3)
states: 2,349,025 (6)
abstracting: (1<=p81)
states: 95,498 (4)
abstracting: (1<=p53)
states: 55,968 (4)
abstracting: (1<=p10)
states: 2,385,297 (6)
.abstracting: (1<=p28)
states: 1,359,731 (6)
abstracting: (1<=p7)
states: 2,542,876 (6)
....................................................
EG iterations: 52
abstracting: (1<=p47)
states: 120,822 (5)
abstracting: (1<=p9)
states: 2,775,981 (6)
abstracting: (1<=p4)
states: 4,660 (3)
abstracting: (1<=p103)
states: 158,037 (5)
abstracting: (1<=p1)
states: 3,512,209 (6)
abstracting: (1<=p112)
states: 84,652 (4)
.
EG iterations: 1
abstracting: (1<=p43)
states: 121,599 (5)
abstracting: (1<=p5)
states: 2,303,263 (6)
abstracting: (1<=p27)
states: 649,536 (5)
abstracting: (1<=p43)
states: 121,599 (5)
abstracting: (1<=p5)
states: 2,303,263 (6)
abstracting: (1<=p43)
states: 121,599 (5)
abstracting: (1<=p5)
states: 2,303,263 (6)
...............................................
EG iterations: 47
-> the formula is FALSE

FORMULA HirschbergSinclair-PT-05-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.545sec

totally nodes used: 35768481 (3.6e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 23629992 96213793 119843785
used/not used/entry size/cache size: 56651604 10457260 16 1024MB
basic ops cache: hits/miss/sum: 2620991 11085439 13706430
used/not used/entry size/cache size: 12698510 4078706 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: 23956 138670 162626
used/not used/entry size/cache size: 137605 8251003 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 41249117
1 18211927
2 5811976
3 1477884
4 300124
5 49937
6 6948
7 849
8 85
9 10
>= 10 7

Total processing time: 1m 0.583sec


BK_STOP 1678784127657

--------------------
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 CTLFireability -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:5147 (46), effective:217 (1)

initing FirstDep: 0m 0.000sec


iterations count:1615 (14), effective:87 (0)

iterations count:1628 (14), effective:88 (0)

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

iterations count:1618 (14), effective:87 (0)

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

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

iterations count:1500 (13), effective:75 (0)

iterations count:1135 (10), effective:54 (0)

iterations count:651 (5), effective:30 (0)

iterations count:654 (5), effective:31 (0)

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

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

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

iterations count:2781 (25), effective:156 (1)

iterations count:387 (3), effective:12 (0)

iterations count:738 (6), effective:34 (0)

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

iterations count:2525 (22), effective:144 (1)

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

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

iterations count:2525 (22), effective:144 (1)

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

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

iterations count:2525 (22), effective:144 (1)

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

iterations count:1764 (16), effective:94 (0)

iterations count:1135 (10), effective:54 (0)

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

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

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

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

iterations count:252 (2), effective:8 (0)

iterations count:1323 (12), effective:67 (0)

iterations count:387 (3), effective:12 (0)

iterations count:1654 (15), effective:93 (0)

iterations count:781 (7), effective:52 (0)

iterations count:1716 (15), effective:93 (0)

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

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

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

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

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

iterations count:1236 (11), effective:60 (0)

iterations count:594 (5), effective:25 (0)

iterations count:1791 (16), effective:113 (1)

iterations count:146 (1), effective:2 (0)

iterations count:247 (2), effective:8 (0)

iterations count:1409 (12), effective:72 (0)

iterations count:146 (1), effective:2 (0)

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

iterations count:146 (1), effective:2 (0)

iterations count:142 (1), effective:2 (0)

iterations count:2498 (22), effective:143 (1)

iterations count:159 (1), effective:6 (0)

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

iterations count:556 (5), effective:27 (0)

iterations count:131 (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="HirschbergSinclair-PT-05"
export BK_EXAMINATION="CTLFireability"
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 HirschbergSinclair-PT-05, examination is CTLFireability"
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-167840348700426"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-05.tgz
mv HirschbergSinclair-PT-05 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;