About the Execution of Marcie+red for DiscoveryGPU-PT-07a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5715.268 | 18893.00 | 23900.00 | 652.00 | FFFFFTFTTFTFFTTT | normal |
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.r138-smll-167819420200298.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 DiscoveryGPU-PT-07a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819420200298
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.5K Feb 25 13:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 13:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 13:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 13:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 13:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Feb 25 13:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 13:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 13:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:59 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 25K 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 DiscoveryGPU-PT-07a-CTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-07a-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678738420475
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=DiscoveryGPU-PT-07a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 20:13:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 20:13:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 20:13:43] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-13 20:13:43] [INFO ] Transformed 73 places.
[2023-03-13 20:13:43] [INFO ] Transformed 99 transitions.
[2023-03-13 20:13:43] [INFO ] Found NUPN structural information;
[2023-03-13 20:13:43] [INFO ] Parsed PT model containing 73 places and 99 transitions and 318 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-07a-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 99/99 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 71 transition count 97
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 71 transition count 97
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 11 place count 71 transition count 90
Applied a total of 11 rules in 27 ms. Remains 71 /73 variables (removed 2) and now considering 90/99 (removed 9) transitions.
// Phase 1: matrix 90 rows 71 cols
[2023-03-13 20:13:43] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-13 20:13:43] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-13 20:13:43] [INFO ] Invariant cache hit.
[2023-03-13 20:13:43] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-13 20:13:43] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2023-03-13 20:13:43] [INFO ] Invariant cache hit.
[2023-03-13 20:13:44] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 71/73 places, 90/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 513 ms. Remains : 71/73 places, 90/99 transitions.
Support contains 50 out of 71 places after structural reductions.
[2023-03-13 20:13:44] [INFO ] Flatten gal took : 49 ms
[2023-03-13 20:13:44] [INFO ] Flatten gal took : 16 ms
[2023-03-13 20:13:44] [INFO ] Input system was already deterministic with 90 transitions.
Support contains 49 out of 71 places (down from 50) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 49) seen :48
Finished Best-First random walk after 438 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=87 )
[2023-03-13 20:13:44] [INFO ] Flatten gal took : 10 ms
[2023-03-13 20:13:44] [INFO ] Flatten gal took : 11 ms
[2023-03-13 20:13:44] [INFO ] Input system was already deterministic with 90 transitions.
Computed a total of 10 stabilizing places and 8 stable transitions
Graph (complete) has 198 edges and 71 vertex of which 66 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 84
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 59 transition count 78
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 59 transition count 78
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 56 transition count 75
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 56 transition count 75
Applied a total of 30 rules in 11 ms. Remains 56 /71 variables (removed 15) and now considering 75/90 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 56/71 places, 75/90 transitions.
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 6 ms
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 6 ms
[2023-03-13 20:13:45] [INFO ] Input system was already deterministic with 75 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 84
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 59 transition count 78
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 59 transition count 78
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 56 transition count 75
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 56 transition count 75
Applied a total of 30 rules in 15 ms. Remains 56 /71 variables (removed 15) and now considering 75/90 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 56/71 places, 75/90 transitions.
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 7 ms
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 6 ms
[2023-03-13 20:13:45] [INFO ] Input system was already deterministic with 75 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 84
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 59 transition count 78
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 59 transition count 78
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 56 transition count 75
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 56 transition count 75
Applied a total of 30 rules in 9 ms. Remains 56 /71 variables (removed 15) and now considering 75/90 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 56/71 places, 75/90 transitions.
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 5 ms
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 6 ms
[2023-03-13 20:13:45] [INFO ] Input system was already deterministic with 75 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 67 transition count 86
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 67 transition count 86
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 63 transition count 82
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 63 transition count 82
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 61 transition count 80
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 61 transition count 80
Applied a total of 20 rules in 9 ms. Remains 61 /71 variables (removed 10) and now considering 80/90 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 61/71 places, 80/90 transitions.
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 5 ms
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 7 ms
[2023-03-13 20:13:45] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Graph (complete) has 198 edges and 71 vertex of which 67 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 67 transition count 81
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 62 transition count 81
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 16 place count 57 transition count 76
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 57 transition count 76
Applied a total of 21 rules in 21 ms. Remains 57 /71 variables (removed 14) and now considering 76/90 (removed 14) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 57/71 places, 76/90 transitions.
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 5 ms
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 6 ms
[2023-03-13 20:13:45] [INFO ] Input system was already deterministic with 76 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 85
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 85
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 62 transition count 81
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 62 transition count 81
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 59 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 59 transition count 78
Applied a total of 24 rules in 8 ms. Remains 59 /71 variables (removed 12) and now considering 78/90 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 59/71 places, 78/90 transitions.
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 5 ms
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 5 ms
[2023-03-13 20:13:45] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Graph (complete) has 198 edges and 71 vertex of which 66 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 66 transition count 79
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 60 transition count 79
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 19 place count 54 transition count 73
Iterating global reduction 0 with 6 rules applied. Total rules applied 25 place count 54 transition count 73
Applied a total of 25 rules in 11 ms. Remains 54 /71 variables (removed 17) and now considering 73/90 (removed 17) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 54/71 places, 73/90 transitions.
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 4 ms
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 4 ms
[2023-03-13 20:13:45] [INFO ] Input system was already deterministic with 73 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Graph (complete) has 198 edges and 71 vertex of which 66 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 66 transition count 79
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 60 transition count 79
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 19 place count 54 transition count 73
Iterating global reduction 0 with 6 rules applied. Total rules applied 25 place count 54 transition count 73
Applied a total of 25 rules in 11 ms. Remains 54 /71 variables (removed 17) and now considering 73/90 (removed 17) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 54/71 places, 73/90 transitions.
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 3 ms
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 5 ms
[2023-03-13 20:13:45] [INFO ] Input system was already deterministic with 73 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 84
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 59 transition count 78
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 59 transition count 78
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 55 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 55 transition count 74
Applied a total of 32 rules in 6 ms. Remains 55 /71 variables (removed 16) and now considering 74/90 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 55/71 places, 74/90 transitions.
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 4 ms
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 5 ms
[2023-03-13 20:13:45] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 67 transition count 86
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 67 transition count 86
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 64 transition count 83
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 64 transition count 83
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 62 transition count 81
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 62 transition count 81
Applied a total of 18 rules in 5 ms. Remains 62 /71 variables (removed 9) and now considering 81/90 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 62/71 places, 81/90 transitions.
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 4 ms
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 6 ms
[2023-03-13 20:13:45] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 84
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 59 transition count 78
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 59 transition count 78
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 55 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 55 transition count 74
Applied a total of 32 rules in 4 ms. Remains 55 /71 variables (removed 16) and now considering 74/90 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 55/71 places, 74/90 transitions.
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 4 ms
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 5 ms
[2023-03-13 20:13:45] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 84
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 59 transition count 78
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 59 transition count 78
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 55 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 55 transition count 74
Applied a total of 32 rules in 4 ms. Remains 55 /71 variables (removed 16) and now considering 74/90 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 55/71 places, 74/90 transitions.
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 4 ms
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 4 ms
[2023-03-13 20:13:45] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 84
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 60 transition count 79
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 60 transition count 79
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 56 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 56 transition count 75
Applied a total of 30 rules in 7 ms. Remains 56 /71 variables (removed 15) and now considering 75/90 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 56/71 places, 75/90 transitions.
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 14 ms
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 5 ms
[2023-03-13 20:13:45] [INFO ] Input system was already deterministic with 75 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 84
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 60 transition count 79
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 60 transition count 79
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 57 transition count 76
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 57 transition count 76
Applied a total of 28 rules in 3 ms. Remains 57 /71 variables (removed 14) and now considering 76/90 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 57/71 places, 76/90 transitions.
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 3 ms
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 4 ms
[2023-03-13 20:13:45] [INFO ] Input system was already deterministic with 76 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 90/90 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 84
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 59 transition count 78
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 59 transition count 78
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 55 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 55 transition count 74
Applied a total of 32 rules in 3 ms. Remains 55 /71 variables (removed 16) and now considering 74/90 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 55/71 places, 74/90 transitions.
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 4 ms
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 4 ms
[2023-03-13 20:13:45] [INFO ] Input system was already deterministic with 74 transitions.
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 6 ms
[2023-03-13 20:13:45] [INFO ] Flatten gal took : 5 ms
[2023-03-13 20:13:45] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-13 20:13:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 71 places, 90 transitions and 288 arcs took 1 ms.
Total runtime 2252 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: 71 NrTr: 90 NrArc: 288)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 3.623sec
RS generation: 0m 0.189sec
-> reachability set: #nodes 4373 (4.4e+03) #states 19,033,301 (7)
starting MCC model checker
--------------------------
checking: EG [AG [EX [EF [[0<=p33 & p33<=0]]]]]
normalized: EG [~ [E [true U ~ [EX [E [true U [0<=p33 & p33<=0]]]]]]]
abstracting: (p33<=0)
states: 17,303,001 (7)
abstracting: (0<=p33)
states: 19,033,301 (7)
..
EG iterations: 1
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-07a-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.499sec
checking: AF [EG [EF [EX [[p62<=0 & 0<=p62]]]]]
normalized: ~ [EG [~ [EG [E [true U EX [[p62<=0 & 0<=p62]]]]]]]
abstracting: (0<=p62)
states: 19,033,301 (7)
abstracting: (p62<=0)
states: 17,276,381 (7)
.......................
EG iterations: 22
.
EG iterations: 1
-> the formula is TRUE
FORMULA DiscoveryGPU-PT-07a-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.619sec
checking: AG [AX [[[p6<=1 & 1<=p6] & [p69<=1 & 1<=p69]]]]
normalized: ~ [E [true U EX [~ [[[p6<=1 & 1<=p6] & [p69<=1 & 1<=p69]]]]]]
abstracting: (1<=p69)
states: 19,033,300 (7)
abstracting: (p69<=1)
states: 19,033,301 (7)
abstracting: (1<=p6)
states: 1,730,300 (6)
abstracting: (p6<=1)
states: 19,033,301 (7)
.-> the formula is FALSE
FORMULA DiscoveryGPU-PT-07a-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.205sec
checking: EX [EG [[AG [[[p3<=0 & 0<=p3] | [p70<=0 & 0<=p70]]] | [[p49<=1 & 1<=p49] & [p69<=1 & 1<=p69]]]]]
normalized: EX [EG [[[[p69<=1 & 1<=p69] & [p49<=1 & 1<=p49]] | ~ [E [true U ~ [[[p70<=0 & 0<=p70] | [p3<=0 & 0<=p3]]]]]]]]
abstracting: (0<=p3)
states: 19,033,301 (7)
abstracting: (p3<=0)
states: 17,303,001 (7)
abstracting: (0<=p70)
states: 19,033,301 (7)
abstracting: (p70<=0)
states: 1
abstracting: (1<=p49)
states: 1,730,300 (6)
abstracting: (p49<=1)
states: 19,033,301 (7)
abstracting: (1<=p69)
states: 19,033,300 (7)
abstracting: (p69<=1)
states: 19,033,301 (7)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA DiscoveryGPU-PT-07a-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.562sec
checking: EG [[AX [EG [[[p13<=0 & 0<=p13] | [[p6<=0 & 0<=p6] | [p69<=0 & 0<=p69]]]]] | AF [[p44<=1 & 1<=p44]]]]
normalized: EG [[~ [EX [~ [EG [[[p13<=0 & 0<=p13] | [[p69<=0 & 0<=p69] | [p6<=0 & 0<=p6]]]]]]] | ~ [EG [~ [[p44<=1 & 1<=p44]]]]]]
abstracting: (1<=p44)
states: 1,730,300 (6)
abstracting: (p44<=1)
states: 19,033,301 (7)
....................
EG iterations: 20
abstracting: (0<=p6)
states: 19,033,301 (7)
abstracting: (p6<=0)
states: 17,303,001 (7)
abstracting: (0<=p69)
states: 19,033,301 (7)
abstracting: (p69<=0)
states: 1
abstracting: (0<=p13)
states: 19,033,301 (7)
abstracting: (p13<=0)
states: 17,276,381 (7)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is TRUE
FORMULA DiscoveryGPU-PT-07a-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.376sec
checking: EF [[AG [AX [EX [[[p42<=0 & 0<=p42] | [p69<=0 & 0<=p69]]]]] | [[p48<=1 & 1<=p48] & [p70<=1 & 1<=p70]]]]
normalized: E [true U [~ [E [true U EX [~ [EX [[[p42<=0 & 0<=p42] | [p69<=0 & 0<=p69]]]]]]] | [[p70<=1 & 1<=p70] & [p48<=1 & 1<=p48]]]]
abstracting: (1<=p48)
states: 1,730,300 (6)
abstracting: (p48<=1)
states: 19,033,301 (7)
abstracting: (1<=p70)
states: 19,033,300 (7)
abstracting: (p70<=1)
states: 19,033,301 (7)
abstracting: (0<=p69)
states: 19,033,301 (7)
abstracting: (p69<=0)
states: 1
abstracting: (0<=p42)
states: 19,033,301 (7)
abstracting: (p42<=0)
states: 17,303,001 (7)
..-> the formula is TRUE
FORMULA DiscoveryGPU-PT-07a-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.370sec
checking: EF [AX [[[p48<=1 & 1<=p48] & [EG [[[p63<=1 & 1<=p63] & [p69<=1 & 1<=p69]]] | AX [[[p30<=1 & 1<=p30] & [p69<=1 & 1<=p69]]]]]]]
normalized: E [true U ~ [EX [~ [[[EG [[[p69<=1 & 1<=p69] & [p63<=1 & 1<=p63]]] | ~ [EX [~ [[[p69<=1 & 1<=p69] & [p30<=1 & 1<=p30]]]]]] & [p48<=1 & 1<=p48]]]]]]
abstracting: (1<=p48)
states: 1,730,300 (6)
abstracting: (p48<=1)
states: 19,033,301 (7)
abstracting: (1<=p30)
states: 1,730,300 (6)
abstracting: (p30<=1)
states: 19,033,301 (7)
abstracting: (1<=p69)
states: 19,033,300 (7)
abstracting: (p69<=1)
states: 19,033,301 (7)
.abstracting: (1<=p63)
states: 1,756,920 (6)
abstracting: (p63<=1)
states: 19,033,301 (7)
abstracting: (1<=p69)
states: 19,033,300 (7)
abstracting: (p69<=1)
states: 19,033,301 (7)
....................
EG iterations: 20
.-> the formula is TRUE
FORMULA DiscoveryGPU-PT-07a-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.290sec
checking: AX [AG [EX [[A [[[p33<=1 & 1<=p33] & [p70<=1 & 1<=p70]] U [[p46<=1 & 1<=p46] & [p69<=1 & 1<=p69]]] | [[p25<=0 & 0<=p25] | [p69<=0 & 0<=p69]]]]]]
normalized: ~ [EX [E [true U ~ [EX [[[[p69<=0 & 0<=p69] | [p25<=0 & 0<=p25]] | [~ [EG [~ [[[p69<=1 & 1<=p69] & [p46<=1 & 1<=p46]]]]] & ~ [E [~ [[[p69<=1 & 1<=p69] & [p46<=1 & 1<=p46]]] U [~ [[[p70<=1 & 1<=p70] & [p33<=1 & 1<=p33]]] & ~ [[[p69<=1 & 1<=p69] & [p46<=1 & 1<=p46]]]]]]]]]]]]]
abstracting: (1<=p46)
states: 1,730,300 (6)
abstracting: (p46<=1)
states: 19,033,301 (7)
abstracting: (1<=p69)
states: 19,033,300 (7)
abstracting: (p69<=1)
states: 19,033,301 (7)
abstracting: (1<=p33)
states: 1,730,300 (6)
abstracting: (p33<=1)
states: 19,033,301 (7)
abstracting: (1<=p70)
states: 19,033,300 (7)
abstracting: (p70<=1)
states: 19,033,301 (7)
abstracting: (1<=p46)
states: 1,730,300 (6)
abstracting: (p46<=1)
states: 19,033,301 (7)
abstracting: (1<=p69)
states: 19,033,300 (7)
abstracting: (p69<=1)
states: 19,033,301 (7)
abstracting: (1<=p46)
states: 1,730,300 (6)
abstracting: (p46<=1)
states: 19,033,301 (7)
abstracting: (1<=p69)
states: 19,033,300 (7)
abstracting: (p69<=1)
states: 19,033,301 (7)
....................
EG iterations: 20
abstracting: (0<=p25)
states: 19,033,301 (7)
abstracting: (p25<=0)
states: 17,303,001 (7)
abstracting: (0<=p69)
states: 19,033,301 (7)
abstracting: (p69<=0)
states: 1
..-> the formula is FALSE
FORMULA DiscoveryGPU-PT-07a-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.093sec
checking: EF [[EF [[EF [AG [[[p58<=1 & 1<=p58] & [p69<=1 & 1<=p69]]]] & [~ [A [[p14<=1 & 1<=p14] U [[p65<=1 & 1<=p65] & [p69<=1 & 1<=p69]]]] | AF [[[p23<=0 & 0<=p23] | [p70<=0 & 0<=p70]]]]]] & [p34<=1 & 1<=p34]]]
normalized: E [true U [E [true U [[~ [EG [~ [[[p70<=0 & 0<=p70] | [p23<=0 & 0<=p23]]]]] | ~ [[~ [EG [~ [[[p69<=1 & 1<=p69] & [p65<=1 & 1<=p65]]]]] & ~ [E [~ [[[p69<=1 & 1<=p69] & [p65<=1 & 1<=p65]]] U [~ [[p14<=1 & 1<=p14]] & ~ [[[p69<=1 & 1<=p69] & [p65<=1 & 1<=p65]]]]]]]]] & E [true U ~ [E [true U ~ [[[p69<=1 & 1<=p69] & [p58<=1 & 1<=p58]]]]]]]] & [p34<=1 & 1<=p34]]]
abstracting: (1<=p34)
states: 1,730,300 (6)
abstracting: (p34<=1)
states: 19,033,301 (7)
abstracting: (1<=p58)
states: 1,756,920 (6)
abstracting: (p58<=1)
states: 19,033,301 (7)
abstracting: (1<=p69)
states: 19,033,300 (7)
abstracting: (p69<=1)
states: 19,033,301 (7)
abstracting: (1<=p65)
states: 1,756,920 (6)
abstracting: (p65<=1)
states: 19,033,301 (7)
abstracting: (1<=p69)
states: 19,033,300 (7)
abstracting: (p69<=1)
states: 19,033,301 (7)
abstracting: (1<=p14)
states: 1,756,920 (6)
abstracting: (p14<=1)
states: 19,033,301 (7)
abstracting: (1<=p65)
states: 1,756,920 (6)
abstracting: (p65<=1)
states: 19,033,301 (7)
abstracting: (1<=p69)
states: 19,033,300 (7)
abstracting: (p69<=1)
states: 19,033,301 (7)
abstracting: (1<=p65)
states: 1,756,920 (6)
abstracting: (p65<=1)
states: 19,033,301 (7)
abstracting: (1<=p69)
states: 19,033,300 (7)
abstracting: (p69<=1)
states: 19,033,301 (7)
.
EG iterations: 1
abstracting: (0<=p23)
states: 19,033,301 (7)
abstracting: (p23<=0)
states: 17,303,001 (7)
abstracting: (0<=p70)
states: 19,033,301 (7)
abstracting: (p70<=0)
states: 1
....................
EG iterations: 20
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-07a-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.063sec
checking: AF [[A [[[p49<=1 & 1<=p49] & [p69<=1 & 1<=p69]] U [[p45<=1 & 1<=p45] & [p69<=1 & 1<=p69]]] & [EX [AF [[[p15<=0 & 0<=p15] | [p69<=0 & 0<=p69]]]] | [[p34<=0 & 0<=p34] | [p70<=0 & 0<=p70]]]]]
normalized: ~ [EG [~ [[[[[p70<=0 & 0<=p70] | [p34<=0 & 0<=p34]] | EX [~ [EG [~ [[[p69<=0 & 0<=p69] | [p15<=0 & 0<=p15]]]]]]] & [~ [EG [~ [[[p69<=1 & 1<=p69] & [p45<=1 & 1<=p45]]]]] & ~ [E [~ [[[p69<=1 & 1<=p69] & [p45<=1 & 1<=p45]]] U [~ [[[p69<=1 & 1<=p69] & [p49<=1 & 1<=p49]]] & ~ [[[p69<=1 & 1<=p69] & [p45<=1 & 1<=p45]]]]]]]]]]]
abstracting: (1<=p45)
states: 1,730,300 (6)
abstracting: (p45<=1)
states: 19,033,301 (7)
abstracting: (1<=p69)
states: 19,033,300 (7)
abstracting: (p69<=1)
states: 19,033,301 (7)
abstracting: (1<=p49)
states: 1,730,300 (6)
abstracting: (p49<=1)
states: 19,033,301 (7)
abstracting: (1<=p69)
states: 19,033,300 (7)
abstracting: (p69<=1)
states: 19,033,301 (7)
abstracting: (1<=p45)
states: 1,730,300 (6)
abstracting: (p45<=1)
states: 19,033,301 (7)
abstracting: (1<=p69)
states: 19,033,300 (7)
abstracting: (p69<=1)
states: 19,033,301 (7)
abstracting: (1<=p45)
states: 1,730,300 (6)
abstracting: (p45<=1)
states: 19,033,301 (7)
abstracting: (1<=p69)
states: 19,033,300 (7)
abstracting: (p69<=1)
states: 19,033,301 (7)
.
EG iterations: 1
abstracting: (0<=p15)
states: 19,033,301 (7)
abstracting: (p15<=0)
states: 17,276,381 (7)
abstracting: (0<=p69)
states: 19,033,301 (7)
abstracting: (p69<=0)
states: 1
....................
EG iterations: 20
.abstracting: (0<=p34)
states: 19,033,301 (7)
abstracting: (p34<=0)
states: 17,303,001 (7)
abstracting: (0<=p70)
states: 19,033,301 (7)
abstracting: (p70<=0)
states: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-07a-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.326sec
checking: AG [[EG [[~ [A [[[p24<=1 & 1<=p24] & [p70<=1 & 1<=p70]] U [[p18<=1 & 1<=p18] & [p70<=1 & 1<=p70]]]] | [[[p46<=0 & 0<=p46] & [[p3<=0 & 0<=p3] | [p70<=0 & 0<=p70]]] | EF [[[p40<=0 & 0<=p40] | [p69<=0 & 0<=p69]]]]]] | [p66<=0 & 0<=p66]]]
normalized: ~ [E [true U ~ [[[p66<=0 & 0<=p66] | EG [[[E [true U [[p69<=0 & 0<=p69] | [p40<=0 & 0<=p40]]] | [[[p70<=0 & 0<=p70] | [p3<=0 & 0<=p3]] & [p46<=0 & 0<=p46]]] | ~ [[~ [EG [~ [[[p70<=1 & 1<=p70] & [p18<=1 & 1<=p18]]]]] & ~ [E [~ [[[p70<=1 & 1<=p70] & [p18<=1 & 1<=p18]]] U [~ [[[p70<=1 & 1<=p70] & [p24<=1 & 1<=p24]]] & ~ [[[p70<=1 & 1<=p70] & [p18<=1 & 1<=p18]]]]]]]]]]]]]]
abstracting: (1<=p18)
states: 1,756,920 (6)
abstracting: (p18<=1)
states: 19,033,301 (7)
abstracting: (1<=p70)
states: 19,033,300 (7)
abstracting: (p70<=1)
states: 19,033,301 (7)
abstracting: (1<=p24)
states: 1,730,300 (6)
abstracting: (p24<=1)
states: 19,033,301 (7)
abstracting: (1<=p70)
states: 19,033,300 (7)
abstracting: (p70<=1)
states: 19,033,301 (7)
abstracting: (1<=p18)
states: 1,756,920 (6)
abstracting: (p18<=1)
states: 19,033,301 (7)
abstracting: (1<=p70)
states: 19,033,300 (7)
abstracting: (p70<=1)
states: 19,033,301 (7)
abstracting: (1<=p18)
states: 1,756,920 (6)
abstracting: (p18<=1)
states: 19,033,301 (7)
abstracting: (1<=p70)
states: 19,033,300 (7)
abstracting: (p70<=1)
states: 19,033,301 (7)
.....................
EG iterations: 21
abstracting: (0<=p46)
states: 19,033,301 (7)
abstracting: (p46<=0)
states: 17,303,001 (7)
abstracting: (0<=p3)
states: 19,033,301 (7)
abstracting: (p3<=0)
states: 17,303,001 (7)
abstracting: (0<=p70)
states: 19,033,301 (7)
abstracting: (p70<=0)
states: 1
abstracting: (0<=p40)
states: 19,033,301 (7)
abstracting: (p40<=0)
states: 17,303,001 (7)
abstracting: (0<=p69)
states: 19,033,301 (7)
abstracting: (p69<=0)
states: 1
EG iterations: 0
abstracting: (0<=p66)
states: 19,033,301 (7)
abstracting: (p66<=0)
states: 17,276,381 (7)
-> the formula is TRUE
FORMULA DiscoveryGPU-PT-07a-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.604sec
checking: AX [EX [[[[p61<=0 & 0<=p61] | [[p70<=0 & 0<=p70] | [p36<=0 & 0<=p36]]] | [[p41<=1 & 1<=p41] | [[~ [A [[[p37<=1 & 1<=p37] & [p69<=1 & 1<=p69]] U [p28<=1 & 1<=p28]]] & [[p53<=0 & 0<=p53] | [p36<=0 & 0<=p36]]] | [[p31<=0 & 0<=p31] & [[p16<=0 & 0<=p16] | [p69<=0 & 0<=p69]]]]]]]]
normalized: ~ [EX [~ [EX [[[[[[[p69<=0 & 0<=p69] | [p16<=0 & 0<=p16]] & [p31<=0 & 0<=p31]] | [[[p36<=0 & 0<=p36] | [p53<=0 & 0<=p53]] & ~ [[~ [EG [~ [[p28<=1 & 1<=p28]]]] & ~ [E [~ [[p28<=1 & 1<=p28]] U [~ [[[p69<=1 & 1<=p69] & [p37<=1 & 1<=p37]]] & ~ [[p28<=1 & 1<=p28]]]]]]]]] | [p41<=1 & 1<=p41]] | [[[p36<=0 & 0<=p36] | [p70<=0 & 0<=p70]] | [p61<=0 & 0<=p61]]]]]]]
abstracting: (0<=p61)
states: 19,033,301 (7)
abstracting: (p61<=0)
states: 17,276,381 (7)
abstracting: (0<=p70)
states: 19,033,301 (7)
abstracting: (p70<=0)
states: 1
abstracting: (0<=p36)
states: 19,033,301 (7)
abstracting: (p36<=0)
states: 17,303,001 (7)
abstracting: (1<=p41)
states: 1,730,300 (6)
abstracting: (p41<=1)
states: 19,033,301 (7)
abstracting: (1<=p28)
states: 1,730,300 (6)
abstracting: (p28<=1)
states: 19,033,301 (7)
abstracting: (1<=p37)
states: 1,730,300 (6)
abstracting: (p37<=1)
states: 19,033,301 (7)
abstracting: (1<=p69)
states: 19,033,300 (7)
abstracting: (p69<=1)
states: 19,033,301 (7)
abstracting: (1<=p28)
states: 1,730,300 (6)
abstracting: (p28<=1)
states: 19,033,301 (7)
abstracting: (1<=p28)
states: 1,730,300 (6)
abstracting: (p28<=1)
states: 19,033,301 (7)
.....................
EG iterations: 21
abstracting: (0<=p53)
states: 19,033,301 (7)
abstracting: (p53<=0)
states: 17,276,381 (7)
abstracting: (0<=p36)
states: 19,033,301 (7)
abstracting: (p36<=0)
states: 17,303,001 (7)
abstracting: (0<=p31)
states: 19,033,301 (7)
abstracting: (p31<=0)
states: 17,303,001 (7)
abstracting: (0<=p16)
states: 19,033,301 (7)
abstracting: (p16<=0)
states: 17,276,381 (7)
abstracting: (0<=p69)
states: 19,033,301 (7)
abstracting: (p69<=0)
states: 1
..-> the formula is TRUE
FORMULA DiscoveryGPU-PT-07a-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.453sec
checking: EF [[~ [A [[[p53<=1 & 1<=p53] & [p70<=1 & 1<=p70]] U [EF [[[p7<=1 & 1<=p7] & [p69<=1 & 1<=p69]]] & AG [[[p22<=1 & 1<=p22] & [p69<=1 & 1<=p69]]]]]] & [EF [AG [[p34<=0 & 0<=p34]]] & [[AX [EX [[[p68<=0 & 0<=p68] | [p69<=0 & 0<=p69]]]] | [p20<=0 & 0<=p20]] | [[p69<=0 & 0<=p69] | EX [[[p60<=0 & 0<=p60] | [p69<=0 & 0<=p69]]]]]]]]
normalized: E [true U [[[[EX [[[p69<=0 & 0<=p69] | [p60<=0 & 0<=p60]]] | [p69<=0 & 0<=p69]] | [[p20<=0 & 0<=p20] | ~ [EX [~ [EX [[[p69<=0 & 0<=p69] | [p68<=0 & 0<=p68]]]]]]]] & E [true U ~ [E [true U ~ [[p34<=0 & 0<=p34]]]]]] & ~ [[~ [EG [~ [[~ [E [true U ~ [[[p69<=1 & 1<=p69] & [p22<=1 & 1<=p22]]]]] & E [true U [[p69<=1 & 1<=p69] & [p7<=1 & 1<=p7]]]]]]] & ~ [E [~ [[~ [E [true U ~ [[[p69<=1 & 1<=p69] & [p22<=1 & 1<=p22]]]]] & E [true U [[p69<=1 & 1<=p69] & [p7<=1 & 1<=p7]]]]] U [~ [[[p70<=1 & 1<=p70] & [p53<=1 & 1<=p53]]] & ~ [[~ [E [true U ~ [[[p69<=1 & 1<=p69] & [p22<=1 & 1<=p22]]]]] & E [true U [[p69<=1 & 1<=p69] & [p7<=1 & 1<=p7]]]]]]]]]]]]
abstracting: (1<=p7)
states: 1,730,300 (6)
abstracting: (p7<=1)
states: 19,033,301 (7)
abstracting: (1<=p69)
states: 19,033,300 (7)
abstracting: (p69<=1)
states: 19,033,301 (7)
abstracting: (1<=p22)
states: 1,730,300 (6)
abstracting: (p22<=1)
states: 19,033,301 (7)
abstracting: (1<=p69)
states: 19,033,300 (7)
abstracting: (p69<=1)
states: 19,033,301 (7)
abstracting: (1<=p53)
states: 1,756,920 (6)
abstracting: (p53<=1)
states: 19,033,301 (7)
abstracting: (1<=p70)
states: 19,033,300 (7)
abstracting: (p70<=1)
states: 19,033,301 (7)
abstracting: (1<=p7)
states: 1,730,300 (6)
abstracting: (p7<=1)
states: 19,033,301 (7)
abstracting: (1<=p69)
states: 19,033,300 (7)
abstracting: (p69<=1)
states: 19,033,301 (7)
abstracting: (1<=p22)
states: 1,730,300 (6)
abstracting: (p22<=1)
states: 19,033,301 (7)
abstracting: (1<=p69)
states: 19,033,300 (7)
abstracting: (p69<=1)
states: 19,033,301 (7)
abstracting: (1<=p7)
states: 1,730,300 (6)
abstracting: (p7<=1)
states: 19,033,301 (7)
abstracting: (1<=p69)
states: 19,033,300 (7)
abstracting: (p69<=1)
states: 19,033,301 (7)
abstracting: (1<=p22)
states: 1,730,300 (6)
abstracting: (p22<=1)
states: 19,033,301 (7)
abstracting: (1<=p69)
states: 19,033,300 (7)
abstracting: (p69<=1)
states: 19,033,301 (7)
EG iterations: 0
abstracting: (0<=p34)
states: 19,033,301 (7)
abstracting: (p34<=0)
states: 17,303,001 (7)
abstracting: (0<=p68)
states: 19,033,301 (7)
abstracting: (p68<=0)
states: 17,276,381 (7)
abstracting: (0<=p69)
states: 19,033,301 (7)
abstracting: (p69<=0)
states: 1
..abstracting: (0<=p20)
states: 19,033,301 (7)
abstracting: (p20<=0)
states: 17,276,381 (7)
abstracting: (0<=p69)
states: 19,033,301 (7)
abstracting: (p69<=0)
states: 1
abstracting: (0<=p60)
states: 19,033,301 (7)
abstracting: (p60<=0)
states: 17,276,381 (7)
abstracting: (0<=p69)
states: 19,033,301 (7)
abstracting: (p69<=0)
states: 1
.-> the formula is TRUE
FORMULA DiscoveryGPU-PT-07a-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.429sec
checking: [AG [A [[EG [[p21<=1 & 1<=p21]] | A [~ [[[p55<=1 & 1<=p55] & [p69<=1 & 1<=p69]]] U [[p24<=1 & 1<=p24] & [p70<=1 & 1<=p70]]]] U EX [~ [[[p55<=1 & 1<=p55] & [[p38<=1 & 1<=p38] & [p70<=1 & 1<=p70]]]]]]] & [EG [[[[[p16<=0 & 0<=p16] | [p69<=0 & 0<=p69]] & [p3<=0 & 0<=p3]] | [[p64<=1 & 1<=p64] & [p69<=1 & 1<=p69]]]] | EF [[[p51<=1 & 1<=p51] & [p69<=1 & 1<=p69]]]]]
normalized: [[E [true U [[p69<=1 & 1<=p69] & [p51<=1 & 1<=p51]]] | EG [[[[p69<=1 & 1<=p69] & [p64<=1 & 1<=p64]] | [[p3<=0 & 0<=p3] & [[p69<=0 & 0<=p69] | [p16<=0 & 0<=p16]]]]]] & ~ [E [true U ~ [[~ [EG [~ [EX [~ [[[[p70<=1 & 1<=p70] & [p38<=1 & 1<=p38]] & [p55<=1 & 1<=p55]]]]]]] & ~ [E [~ [EX [~ [[[[p70<=1 & 1<=p70] & [p38<=1 & 1<=p38]] & [p55<=1 & 1<=p55]]]]] U [~ [[[~ [EG [~ [[[p70<=1 & 1<=p70] & [p24<=1 & 1<=p24]]]]] & ~ [E [~ [[[p70<=1 & 1<=p70] & [p24<=1 & 1<=p24]]] U [[[p69<=1 & 1<=p69] & [p55<=1 & 1<=p55]] & ~ [[[p70<=1 & 1<=p70] & [p24<=1 & 1<=p24]]]]]]] | EG [[p21<=1 & 1<=p21]]]] & ~ [EX [~ [[[[p70<=1 & 1<=p70] & [p38<=1 & 1<=p38]] & [p55<=1 & 1<=p55]]]]]]]]]]]]]
abstracting: (1<=p55)
states: 1,756,920 (6)
abstracting: (p55<=1)
states: 19,033,301 (7)
abstracting: (1<=p38)
states: 1,730,300 (6)
abstracting: (p38<=1)
states: 19,033,301 (7)
abstracting: (1<=p70)
states: 19,033,300 (7)
abstracting: (p70<=1)
states: 19,033,301 (7)
.abstracting: (1<=p21)
states: 1,730,300 (6)
abstracting: (p21<=1)
states: 19,033,301 (7)
....................
EG iterations: 20
abstracting: (1<=p24)
states: 1,730,300 (6)
abstracting: (p24<=1)
states: 19,033,301 (7)
abstracting: (1<=p70)
states: 19,033,300 (7)
abstracting: (p70<=1)
states: 19,033,301 (7)
abstracting: (1<=p55)
states: 1,756,920 (6)
abstracting: (p55<=1)
states: 19,033,301 (7)
abstracting: (1<=p69)
states: 19,033,300 (7)
abstracting: (p69<=1)
states: 19,033,301 (7)
abstracting: (1<=p24)
states: 1,730,300 (6)
abstracting: (p24<=1)
states: 19,033,301 (7)
abstracting: (1<=p70)
states: 19,033,300 (7)
abstracting: (p70<=1)
states: 19,033,301 (7)
abstracting: (1<=p24)
states: 1,730,300 (6)
abstracting: (p24<=1)
states: 19,033,301 (7)
abstracting: (1<=p70)
states: 19,033,300 (7)
abstracting: (p70<=1)
states: 19,033,301 (7)
....................
EG iterations: 20
abstracting: (1<=p55)
states: 1,756,920 (6)
abstracting: (p55<=1)
states: 19,033,301 (7)
abstracting: (1<=p38)
states: 1,730,300 (6)
abstracting: (p38<=1)
states: 19,033,301 (7)
abstracting: (1<=p70)
states: 19,033,300 (7)
abstracting: (p70<=1)
states: 19,033,301 (7)
.abstracting: (1<=p55)
states: 1,756,920 (6)
abstracting: (p55<=1)
states: 19,033,301 (7)
abstracting: (1<=p38)
states: 1,730,300 (6)
abstracting: (p38<=1)
states: 19,033,301 (7)
abstracting: (1<=p70)
states: 19,033,300 (7)
abstracting: (p70<=1)
states: 19,033,301 (7)
..
EG iterations: 1
abstracting: (0<=p16)
states: 19,033,301 (7)
abstracting: (p16<=0)
states: 17,276,381 (7)
abstracting: (0<=p69)
states: 19,033,301 (7)
abstracting: (p69<=0)
states: 1
abstracting: (0<=p3)
states: 19,033,301 (7)
abstracting: (p3<=0)
states: 17,303,001 (7)
abstracting: (1<=p64)
states: 1,756,920 (6)
abstracting: (p64<=1)
states: 19,033,301 (7)
abstracting: (1<=p69)
states: 19,033,300 (7)
abstracting: (p69<=1)
states: 19,033,301 (7)
...................
EG iterations: 19
abstracting: (1<=p51)
states: 1,756,920 (6)
abstracting: (p51<=1)
states: 19,033,301 (7)
abstracting: (1<=p69)
states: 19,033,300 (7)
abstracting: (p69<=1)
states: 19,033,301 (7)
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-07a-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.819sec
checking: AG [[AG [[EG [[[p67<=0 & 0<=p67] | [p69<=0 & 0<=p69]]] | ~ [A [[p34<=1 & 1<=p34] U [p43<=1 & 1<=p43]]]]] & [[[p65<=0 & 0<=p65] | [[p69<=0 & 0<=p69] | [p30<=0 & 0<=p30]]] | [E [~ [[p66<=1 & 1<=p66]] U EF [[[p8<=1 & 1<=p8] | [[p18<=1 & 1<=p18] & [p70<=1 & 1<=p70]]]]] | [[[p23<=1 & 1<=p23] & [[p70<=1 & 1<=p70] & [p57<=1 & 1<=p57]]] | [[p62<=0 & 0<=p62] & [p1<=0 & 0<=p1]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[p1<=0 & 0<=p1] & [p62<=0 & 0<=p62]] | [[[p57<=1 & 1<=p57] & [p70<=1 & 1<=p70]] & [p23<=1 & 1<=p23]]] | E [~ [[p66<=1 & 1<=p66]] U E [true U [[[p70<=1 & 1<=p70] & [p18<=1 & 1<=p18]] | [p8<=1 & 1<=p8]]]]] | [[[p30<=0 & 0<=p30] | [p69<=0 & 0<=p69]] | [p65<=0 & 0<=p65]]] & ~ [E [true U ~ [[~ [[~ [EG [~ [[p43<=1 & 1<=p43]]]] & ~ [E [~ [[p43<=1 & 1<=p43]] U [~ [[p34<=1 & 1<=p34]] & ~ [[p43<=1 & 1<=p43]]]]]]] | EG [[[p69<=0 & 0<=p69] | [p67<=0 & 0<=p67]]]]]]]]]]]
abstracting: (0<=p67)
states: 19,033,301 (7)
abstracting: (p67<=0)
states: 17,276,381 (7)
abstracting: (0<=p69)
states: 19,033,301 (7)
abstracting: (p69<=0)
states: 1
....................
EG iterations: 20
abstracting: (1<=p43)
states: 1,730,300 (6)
abstracting: (p43<=1)
states: 19,033,301 (7)
abstracting: (1<=p34)
states: 1,730,300 (6)
abstracting: (p34<=1)
states: 19,033,301 (7)
abstracting: (1<=p43)
states: 1,730,300 (6)
abstracting: (p43<=1)
states: 19,033,301 (7)
abstracting: (1<=p43)
states: 1,730,300 (6)
abstracting: (p43<=1)
states: 19,033,301 (7)
.
EG iterations: 1
abstracting: (0<=p65)
states: 19,033,301 (7)
abstracting: (p65<=0)
states: 17,276,381 (7)
abstracting: (0<=p69)
states: 19,033,301 (7)
abstracting: (p69<=0)
states: 1
abstracting: (0<=p30)
states: 19,033,301 (7)
abstracting: (p30<=0)
states: 17,303,001 (7)
abstracting: (1<=p8)
states: 1,730,300 (6)
abstracting: (p8<=1)
states: 19,033,301 (7)
abstracting: (1<=p18)
states: 1,756,920 (6)
abstracting: (p18<=1)
states: 19,033,301 (7)
abstracting: (1<=p70)
states: 19,033,300 (7)
abstracting: (p70<=1)
states: 19,033,301 (7)
abstracting: (1<=p66)
states: 1,756,920 (6)
abstracting: (p66<=1)
states: 19,033,301 (7)
abstracting: (1<=p23)
states: 1,730,300 (6)
abstracting: (p23<=1)
states: 19,033,301 (7)
abstracting: (1<=p70)
states: 19,033,300 (7)
abstracting: (p70<=1)
states: 19,033,301 (7)
abstracting: (1<=p57)
states: 1,756,920 (6)
abstracting: (p57<=1)
states: 19,033,301 (7)
abstracting: (0<=p62)
states: 19,033,301 (7)
abstracting: (p62<=0)
states: 17,276,381 (7)
abstracting: (0<=p1)
states: 19,033,301 (7)
abstracting: (p1<=0)
states: 17,303,001 (7)
-> the formula is FALSE
FORMULA DiscoveryGPU-PT-07a-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.795sec
totally nodes used: 3492136 (3.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 4033297 8683811 12717108
used/not used/entry size/cache size: 10297120 56811744 16 1024MB
basic ops cache: hits/miss/sum: 1840058 3731914 5571972
used/not used/entry size/cache size: 5773657 11003559 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: 21493 42672 64165
used/not used/entry size/cache size: 42545 8346063 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 63823334
1 3097272
2 171636
3 15118
4 1349
5 129
6 11
7 3
8 0
9 10
>= 10 2
Total processing time: 0m12.468sec
BK_STOP 1678738439368
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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:2246 (24), effective:71 (0)
initing FirstDep: 0m 0.000sec
iterations count:92 (1), effective:1 (0)
iterations count:2016 (22), effective:71 (0)
iterations count:159 (1), effective:1 (0)
iterations count:98 (1), effective:1 (0)
iterations count:296 (3), effective:8 (0)
iterations count:2382 (26), effective:79 (0)
iterations count:1978 (21), effective:70 (0)
iterations count:2016 (22), effective:71 (0)
iterations count:92 (1), effective:1 (0)
iterations count:2016 (22), effective:71 (0)
iterations count:117 (1), effective:1 (0)
iterations count:93 (1), effective:1 (0)
iterations count:114 (1), effective:1 (0)
iterations count:93 (1), effective:1 (0)
iterations count:110 (1), effective:1 (0)
iterations count:133 (1), effective:1 (0)
iterations count:213 (2), effective:4 (0)
iterations count:170 (1), effective:1 (0)
iterations count:213 (2), effective:4 (0)
iterations count:170 (1), effective:1 (0)
iterations count:143 (1), effective:1 (0)
iterations count:213 (2), effective:4 (0)
iterations count:170 (1), effective:1 (0)
iterations count:357 (3), effective:7 (0)
iterations count:346 (3), effective:8 (0)
iterations count:90 (1), effective:0 (0)
iterations count:286 (3), effective:5 (0)
iterations count:90 (1), effective:0 (0)
iterations count:2016 (22), effective:71 (0)
iterations count:474 (5), effective:9 (0)
iterations count:93 (1), effective:1 (0)
iterations count:446 (4), effective:12 (0)
iterations count:184 (2), effective:5 (0)
iterations count:90 (1), effective:0 (0)
iterations count:416 (4), effective:15 (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="DiscoveryGPU-PT-07a"
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 DiscoveryGPU-PT-07a, 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 r138-smll-167819420200298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-07a.tgz
mv DiscoveryGPU-PT-07a 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 '
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 ;