About the Execution of Marcie+red for IBM319-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5483.556 | 11500.00 | 20177.00 | 300.40 | TFFFTFFFFFTFTFTT | 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.r234-tall-167856419800073.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 IBM319-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856419800073
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 740K
-rw-r--r-- 1 mcc users 16K Feb 26 18:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 18:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 18:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 18:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 18:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 18:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Feb 26 18:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Feb 26 18:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 184K 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 IBM319-PT-none-CTLCardinality-00
FORMULA_NAME IBM319-PT-none-CTLCardinality-01
FORMULA_NAME IBM319-PT-none-CTLCardinality-02
FORMULA_NAME IBM319-PT-none-CTLCardinality-03
FORMULA_NAME IBM319-PT-none-CTLCardinality-04
FORMULA_NAME IBM319-PT-none-CTLCardinality-05
FORMULA_NAME IBM319-PT-none-CTLCardinality-06
FORMULA_NAME IBM319-PT-none-CTLCardinality-07
FORMULA_NAME IBM319-PT-none-CTLCardinality-08
FORMULA_NAME IBM319-PT-none-CTLCardinality-09
FORMULA_NAME IBM319-PT-none-CTLCardinality-10
FORMULA_NAME IBM319-PT-none-CTLCardinality-11
FORMULA_NAME IBM319-PT-none-CTLCardinality-12
FORMULA_NAME IBM319-PT-none-CTLCardinality-13
FORMULA_NAME IBM319-PT-none-CTLCardinality-14
FORMULA_NAME IBM319-PT-none-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679447581127
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM319-PT-none
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 01:13:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 01:13:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 01:13:02] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-22 01:13:02] [INFO ] Transformed 253 places.
[2023-03-22 01:13:02] [INFO ] Transformed 178 transitions.
[2023-03-22 01:13:02] [INFO ] Found NUPN structural information;
[2023-03-22 01:13:02] [INFO ] Completing missing partition info from NUPN : creating a component with [alpha, merge_s00002239_activated, join_s00001164_input_s00001127, join_s00001163_input_s00001128, callToProcess_s00002943_inputCriterion_s00001053_used, merge_s00002240_input_s00001052, merge_s00001162_input_s00001052, callToProcess_s00002802_inputCriterion_s00001053_used, merge_s00002241_input_s00001127, callToProcess_s00002121_inputCriterion_s00001053_used, callToTask_s00002869_inputCriterion_s00001053_used, callToTask_s00002896_inputCriterion_s00001053_used, callToTask_s00002949_inputCriterion_s00001053_used, callToTask_s00002958_inputCriterion_s00001053_used, callToTask_s00002966_inputCriterion_s00001053_used, decision_s00002055_activated, decision_s00002760_activated, decision_s00002948_activated, join_s00001163_activated_s00001062, fork_s00001071_activated_s00001073, fork_s00001298_activated_s00001073, fork_s00001298_activated_s00001078, decision_s00001123_input_s00001052, callToTask_s00002929_inputCriterion_s00001053_used, callToTask_s00002965_inputCriterion_s00001053_used, callToTask_s00002063_input_s00001052, callToTask_s00002931_input_s00001052, callToTask_s00002932_input_s00001052, callToTask_s00002954_inputCriterion_s00001053_used, callToTask_s00002951_input_s00001052, callToTask_s00002962_input_s00001052, callToTask_s00002963_inputCriterion_s00001053_used, callToTask_s00002954_input_s00001052, callToTask_s00002962_inputCriterion_s00001053_used, callToTask_s00002961_inputCriterion_s00001053_used, callToTask_s00001168_input_s00001066, callToTask_s00002965_input_s00001052, callToTask_s00002956_input_s00001052, callToTask_s00002929_input_s00001052, callToTask_s00002960_inputCriterion_s00001053_used, callToTask_s00001168_inputCriterion_s00001053_used, callToTask_s00001168_input_s00001068, callToTask_s00002950_inputCriterion_s00001053_used, callToTask_s00002930_inputCriterion_s00001053_used, callToTask_s00002254_inputCriterion_s00001053_used, callToTask_s00002063_inputCriterion_s00001053_used, callToProcess_s00002499_output_s00001054, callToProcess_s00002038_output_s00001077, callToTask_s00002063_output_s00001054, callToTask_s00002931_output_s00001054, callToTask_s00002044_output_s00001077, callToProcess_s00002802_output_s00001054, callToTask_s00002951_output_s00001054, callToTask_s00002952_output_s00001054, callToTask_s00002963_output_s00001054, callToTask_s00002955_output_s00001054, callToProcess_s00001108_input_s00001052, callToTask_s00002869_output_s00001054, callToTask_s00002965_output_s00001054, callToTask_s00002959_output_s00001054, callToTask_s00002966_output_s00001054, callToTask_s00002958_output_s00001054, callToTask_s00002961_output_s00001077, callToTask_s00002951_output_s00001077, callToTask_s00001852_output_s00001077, callToTask_s00002965_output_s00001077, callToTask_s00002966_output_s00001077, callToTask_s00002959_output_s00001077, callToTask_s00002869_output_s00001077, callToProcess_s00002499_input_s00001066, callToTask_s00001406_output_s00001077, callToProcess_s00002802_output_s00001077, callToTask_s00002966_input_s00001066, process_s00000343__s00003019_output_s00001249, callToProcess_s00002944_output_s00001077, callToProcess_s00002499_output_s00001083, callToTask_s00002964_input_s00001066, callToTask_s00002954_input_s00001066, callToTask_s00002931_inputCriterion_s00001053_used, callToTask_s00002952_input_s00001066, callToTask_s00002950_input_s00001066, callToTask_s00002960_input_s00001128, callToTask_s00001406_input_s00001066, callToTask_s00002063_input_s00001066, merge_s00002239_input_s00001066, merge_s00001162_input_s00001068, merge_s00001161_input_s00001068, merge_s00002241_input_s00001066]
[2023-03-22 01:13:02] [INFO ] Parsed PT model containing 253 places and 178 transitions and 526 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Support contains 118 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 178/178 transitions.
Ensure Unique test removed 55 places
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 192 transition count 178
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 190 transition count 176
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 190 transition count 176
Applied a total of 65 rules in 30 ms. Remains 190 /253 variables (removed 63) and now considering 176/178 (removed 2) transitions.
// Phase 1: matrix 176 rows 190 cols
[2023-03-22 01:13:03] [INFO ] Computed 25 place invariants in 22 ms
[2023-03-22 01:13:03] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-22 01:13:03] [INFO ] Invariant cache hit.
[2023-03-22 01:13:03] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2023-03-22 01:13:03] [INFO ] Invariant cache hit.
[2023-03-22 01:13:03] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 190/253 places, 176/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 475 ms. Remains : 190/253 places, 176/178 transitions.
Support contains 118 out of 190 places after structural reductions.
[2023-03-22 01:13:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-22 01:13:03] [INFO ] Flatten gal took : 43 ms
FORMULA IBM319-PT-none-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 01:13:03] [INFO ] Flatten gal took : 13 ms
[2023-03-22 01:13:03] [INFO ] Input system was already deterministic with 176 transitions.
Support contains 111 out of 190 places (down from 118) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 215 resets, run finished after 551 ms. (steps per millisecond=18 ) properties (out of 82) seen :75
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 110 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 110 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 124 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-22 01:13:05] [INFO ] Invariant cache hit.
[2023-03-22 01:13:05] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 01:13:05] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 4 ms returned sat
[2023-03-22 01:13:05] [INFO ] After 265ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 3 ms.
Successfully simplified 7 atomic propositions for a total of 15 simplifications.
[2023-03-22 01:13:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-22 01:13:05] [INFO ] Flatten gal took : 20 ms
FORMULA IBM319-PT-none-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 01:13:05] [INFO ] Flatten gal took : 16 ms
[2023-03-22 01:13:05] [INFO ] Input system was already deterministic with 176 transitions.
Support contains 99 out of 190 places (down from 100) after GAL structural reductions.
Computed a total of 190 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 190 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 176/176 transitions.
Ensure Unique test removed 21 places
Reduce places removed 23 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 166 transition count 176
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 160 transition count 170
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 160 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 160 transition count 169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 159 transition count 168
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 159 transition count 168
Applied a total of 39 rules in 26 ms. Remains 159 /190 variables (removed 31) and now considering 168/176 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 159/190 places, 168/176 transitions.
[2023-03-22 01:13:05] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:13:05] [INFO ] Flatten gal took : 7 ms
[2023-03-22 01:13:05] [INFO ] Input system was already deterministic with 168 transitions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 176/176 transitions.
Ensure Unique test removed 21 places
Reduce places removed 23 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 166 transition count 176
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 158 transition count 168
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 158 transition count 168
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 157 transition count 167
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 157 transition count 167
Applied a total of 42 rules in 24 ms. Remains 157 /190 variables (removed 33) and now considering 167/176 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 157/190 places, 167/176 transitions.
[2023-03-22 01:13:05] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:13:05] [INFO ] Flatten gal took : 7 ms
[2023-03-22 01:13:05] [INFO ] Input system was already deterministic with 167 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 190/190 places, 176/176 transitions.
Graph (complete) has 234 edges and 190 vertex of which 148 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 37 output transitions
Drop transitions removed 37 transitions
Ensure Unique test removed 19 places
Reduce places removed 20 places and 1 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 90 place count 128 transition count 49
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 99 rules applied. Total rules applied 189 place count 39 transition count 39
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 195 place count 33 transition count 39
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 195 place count 33 transition count 25
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 225 place count 17 transition count 25
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 rules applied. Total rules applied 227 place count 16 transition count 24
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 229 place count 15 transition count 23
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 229 place count 15 transition count 21
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 234 place count 12 transition count 21
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 239 place count 12 transition count 16
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 241 place count 12 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 243 place count 10 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 243 place count 10 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 247 place count 8 transition count 12
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 248 place count 8 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 248 place count 8 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 250 place count 7 transition count 10
Applied a total of 250 rules in 37 ms. Remains 7 /190 variables (removed 183) and now considering 10/176 (removed 166) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 7/190 places, 10/176 transitions.
[2023-03-22 01:13:05] [INFO ] Flatten gal took : 1 ms
[2023-03-22 01:13:05] [INFO ] Flatten gal took : 1 ms
[2023-03-22 01:13:05] [INFO ] Input system was already deterministic with 10 transitions.
Finished random walk after 114 steps, including 37 resets, run visited all 1 properties in 1 ms. (steps per millisecond=114 )
FORMULA IBM319-PT-none-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 176/176 transitions.
Ensure Unique test removed 21 places
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 167 transition count 176
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 32 place count 158 transition count 167
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 158 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 158 transition count 166
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 156 transition count 164
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 156 transition count 164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 155 transition count 163
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 155 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 154 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 154 transition count 162
Applied a total of 50 rules in 31 ms. Remains 154 /190 variables (removed 36) and now considering 162/176 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 154/190 places, 162/176 transitions.
[2023-03-22 01:13:05] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:13:05] [INFO ] Flatten gal took : 10 ms
[2023-03-22 01:13:05] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 176/176 transitions.
Ensure Unique test removed 21 places
Reduce places removed 23 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 166 transition count 176
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 158 transition count 168
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 158 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 158 transition count 167
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 156 transition count 165
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 156 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 155 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 155 transition count 164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 154 transition count 163
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 154 transition count 163
Applied a total of 49 rules in 29 ms. Remains 154 /190 variables (removed 36) and now considering 163/176 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 154/190 places, 163/176 transitions.
[2023-03-22 01:13:05] [INFO ] Flatten gal took : 5 ms
[2023-03-22 01:13:05] [INFO ] Flatten gal took : 13 ms
[2023-03-22 01:13:05] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 176/176 transitions.
Ensure Unique test removed 21 places
Reduce places removed 23 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 166 transition count 176
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 158 transition count 168
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 158 transition count 168
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 156 transition count 166
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 156 transition count 166
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 155 transition count 165
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 155 transition count 165
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 154 transition count 164
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 154 transition count 164
Applied a total of 48 rules in 26 ms. Remains 154 /190 variables (removed 36) and now considering 164/176 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 154/190 places, 164/176 transitions.
[2023-03-22 01:13:05] [INFO ] Flatten gal took : 10 ms
[2023-03-22 01:13:05] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:13:05] [INFO ] Input system was already deterministic with 164 transitions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 176/176 transitions.
Ensure Unique test removed 21 places
Reduce places removed 23 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 166 transition count 176
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 33 place count 157 transition count 167
Iterating global reduction 1 with 9 rules applied. Total rules applied 42 place count 157 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 157 transition count 166
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 155 transition count 164
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 155 transition count 164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 154 transition count 163
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 154 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 153 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 153 transition count 162
Applied a total of 51 rules in 15 ms. Remains 153 /190 variables (removed 37) and now considering 162/176 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 153/190 places, 162/176 transitions.
[2023-03-22 01:13:05] [INFO ] Flatten gal took : 5 ms
[2023-03-22 01:13:05] [INFO ] Flatten gal took : 21 ms
[2023-03-22 01:13:05] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 176/176 transitions.
Ensure Unique test removed 21 places
Reduce places removed 23 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 166 transition count 176
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 159 transition count 169
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 159 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 159 transition count 168
Applied a total of 39 rules in 12 ms. Remains 159 /190 variables (removed 31) and now considering 168/176 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 159/190 places, 168/176 transitions.
[2023-03-22 01:13:06] [INFO ] Flatten gal took : 14 ms
[2023-03-22 01:13:06] [INFO ] Flatten gal took : 5 ms
[2023-03-22 01:13:06] [INFO ] Input system was already deterministic with 168 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 190/190 places, 176/176 transitions.
Graph (complete) has 234 edges and 190 vertex of which 109 are kept as prefixes of interest. Removing 81 places using SCC suffix rule.1 ms
Discarding 81 places :
Also discarding 79 output transitions
Drop transitions removed 79 transitions
Ensure Unique test removed 18 places
Reduce places removed 19 places and 1 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 90 transition count 34
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 72 rules applied. Total rules applied 135 place count 28 transition count 24
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 141 place count 22 transition count 24
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 141 place count 22 transition count 15
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 161 place count 11 transition count 15
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 rules applied. Total rules applied 163 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 165 place count 9 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 165 place count 9 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 170 place count 6 transition count 11
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 173 place count 6 transition count 8
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 175 place count 6 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 177 place count 4 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 178 place count 4 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 178 place count 4 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 180 place count 3 transition count 4
Applied a total of 180 rules in 6 ms. Remains 3 /190 variables (removed 187) and now considering 4/176 (removed 172) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 3/190 places, 4/176 transitions.
[2023-03-22 01:13:06] [INFO ] Flatten gal took : 0 ms
[2023-03-22 01:13:06] [INFO ] Flatten gal took : 1 ms
[2023-03-22 01:13:06] [INFO ] Input system was already deterministic with 4 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 190/190 places, 176/176 transitions.
Graph (complete) has 234 edges and 190 vertex of which 163 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.3 ms
Discarding 27 places :
Also discarding 21 output transitions
Drop transitions removed 21 transitions
Ensure Unique test removed 21 places
Reduce places removed 22 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 141 transition count 66
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 96 rules applied. Total rules applied 185 place count 54 transition count 57
Reduce places removed 5 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 10 rules applied. Total rules applied 195 place count 49 transition count 52
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 200 place count 44 transition count 52
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 200 place count 44 transition count 42
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 220 place count 34 transition count 42
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 222 place count 33 transition count 41
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 224 place count 32 transition count 40
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 224 place count 32 transition count 38
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 229 place count 29 transition count 38
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 234 place count 29 transition count 33
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 235 place count 29 transition count 32
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 237 place count 28 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 238 place count 27 transition count 31
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 238 place count 27 transition count 29
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 242 place count 25 transition count 29
Applied a total of 242 rules in 26 ms. Remains 25 /190 variables (removed 165) and now considering 29/176 (removed 147) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 25/190 places, 29/176 transitions.
[2023-03-22 01:13:06] [INFO ] Flatten gal took : 3 ms
[2023-03-22 01:13:06] [INFO ] Flatten gal took : 1 ms
[2023-03-22 01:13:06] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 176/176 transitions.
Ensure Unique test removed 20 places
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 169 transition count 176
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 30 place count 160 transition count 167
Iterating global reduction 1 with 9 rules applied. Total rules applied 39 place count 160 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 160 transition count 166
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 159 transition count 165
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 159 transition count 165
Applied a total of 42 rules in 21 ms. Remains 159 /190 variables (removed 31) and now considering 165/176 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 159/190 places, 165/176 transitions.
[2023-03-22 01:13:06] [INFO ] Flatten gal took : 5 ms
[2023-03-22 01:13:06] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:13:06] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 190/190 places, 176/176 transitions.
Graph (complete) has 234 edges and 190 vertex of which 163 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.1 ms
Discarding 27 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Ensure Unique test removed 19 places
Reduce places removed 20 places and 1 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 91 place count 143 transition count 66
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 94 rules applied. Total rules applied 185 place count 53 transition count 62
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 190 place count 51 transition count 59
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 193 place count 48 transition count 59
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 193 place count 48 transition count 43
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 33 rules applied. Total rules applied 226 place count 31 transition count 43
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 228 place count 30 transition count 42
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 230 place count 29 transition count 41
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 230 place count 29 transition count 39
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 235 place count 26 transition count 39
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 239 place count 24 transition count 37
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 244 place count 24 transition count 32
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 245 place count 24 transition count 31
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 247 place count 23 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 248 place count 22 transition count 30
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 248 place count 22 transition count 28
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 252 place count 20 transition count 28
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 254 place count 20 transition count 28
Applied a total of 254 rules in 10 ms. Remains 20 /190 variables (removed 170) and now considering 28/176 (removed 148) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 20/190 places, 28/176 transitions.
[2023-03-22 01:13:06] [INFO ] Flatten gal took : 1 ms
[2023-03-22 01:13:06] [INFO ] Flatten gal took : 1 ms
[2023-03-22 01:13:06] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 176/176 transitions.
Ensure Unique test removed 21 places
Reduce places removed 23 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 166 transition count 176
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 156 transition count 166
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 156 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 156 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 155 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 155 transition count 164
Applied a total of 47 rules in 8 ms. Remains 155 /190 variables (removed 35) and now considering 164/176 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 155/190 places, 164/176 transitions.
[2023-03-22 01:13:06] [INFO ] Flatten gal took : 7 ms
[2023-03-22 01:13:06] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:13:06] [INFO ] Input system was already deterministic with 164 transitions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 176/176 transitions.
Ensure Unique test removed 20 places
Reduce places removed 22 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 167 transition count 176
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 31 place count 159 transition count 168
Iterating global reduction 1 with 8 rules applied. Total rules applied 39 place count 159 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 159 transition count 167
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 157 transition count 165
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 157 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 156 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 156 transition count 164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 155 transition count 163
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 155 transition count 163
Applied a total of 48 rules in 11 ms. Remains 155 /190 variables (removed 35) and now considering 163/176 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 155/190 places, 163/176 transitions.
[2023-03-22 01:13:06] [INFO ] Flatten gal took : 10 ms
[2023-03-22 01:13:06] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:13:06] [INFO ] Input system was already deterministic with 163 transitions.
[2023-03-22 01:13:06] [INFO ] Flatten gal took : 7 ms
[2023-03-22 01:13:06] [INFO ] Flatten gal took : 21 ms
[2023-03-22 01:13:06] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-22 01:13:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 190 places, 176 transitions and 406 arcs took 1 ms.
Total runtime 3789 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 190 NrTr: 176 NrArc: 406)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec
net check time: 0m 0.000sec
init dd package: 0m 2.748sec
RS generation: 0m 0.018sec
-> reachability set: #nodes 724 (7.2e+02) #states 2,431 (3)
starting MCC model checker
--------------------------
checking: EF [EG [AG [[p138<=1 & 1<=p138]]]]
normalized: E [true U EG [~ [E [true U ~ [[p138<=1 & 1<=p138]]]]]]
abstracting: (1<=p138)
states: 3
abstracting: (p138<=1)
states: 2,431 (3)
.
EG iterations: 1
-> the formula is FALSE
FORMULA IBM319-PT-none-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.031sec
checking: [EX [[AG [[p86<=1 & 1<=p86]] & [EG [[[p81<=1 & 1<=p81] | [p14<=1 & 1<=p14]]] & [p132<=1 & 1<=p132]]]] | AX [AX [AF [EG [[p163<=0 & 0<=p163]]]]]]
normalized: [~ [EX [EX [EG [~ [EG [[p163<=0 & 0<=p163]]]]]]] | EX [[[[p132<=1 & 1<=p132] & EG [[[p14<=1 & 1<=p14] | [p81<=1 & 1<=p81]]]] & ~ [E [true U ~ [[p86<=1 & 1<=p86]]]]]]]
abstracting: (1<=p86)
states: 3
abstracting: (p86<=1)
states: 2,431 (3)
abstracting: (1<=p81)
states: 3
abstracting: (p81<=1)
states: 2,431 (3)
abstracting: (1<=p14)
states: 42
abstracting: (p14<=1)
states: 2,431 (3)
...............
EG iterations: 15
abstracting: (1<=p132)
states: 3
abstracting: (p132<=1)
states: 2,431 (3)
.abstracting: (0<=p163)
states: 2,431 (3)
abstracting: (p163<=0)
states: 2,426 (3)
..
EG iterations: 2
......
EG iterations: 6
..-> the formula is TRUE
FORMULA IBM319-PT-none-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.076sec
checking: EX [AF [[AF [[p179<=1 & 1<=p179]] & [AF [[[p1<=0 & 0<=p1] | [p168<=1 & 1<=p168]]] & AX [[[p33<=0 & 0<=p33] & [p139<=1 & 1<=p139]]]]]]]
normalized: EX [~ [EG [~ [[[~ [EX [~ [[[p139<=1 & 1<=p139] & [p33<=0 & 0<=p33]]]]] & ~ [EG [~ [[[p168<=1 & 1<=p168] | [p1<=0 & 0<=p1]]]]]] & ~ [EG [~ [[p179<=1 & 1<=p179]]]]]]]]]
abstracting: (1<=p179)
states: 150
abstracting: (p179<=1)
states: 2,431 (3)
.
EG iterations: 1
abstracting: (0<=p1)
states: 2,431 (3)
abstracting: (p1<=0)
states: 2,389 (3)
abstracting: (1<=p168)
states: 150
abstracting: (p168<=1)
states: 2,431 (3)
...............
EG iterations: 15
abstracting: (0<=p33)
states: 2,431 (3)
abstracting: (p33<=0)
states: 2,389 (3)
abstracting: (1<=p139)
states: 3
abstracting: (p139<=1)
states: 2,431 (3)
.
EG iterations: 0
.-> the formula is FALSE
FORMULA IBM319-PT-none-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.046sec
checking: [AF [[EX [EF [[p50<=1 & 1<=p50]]] & [[p33<=0 & 0<=p33] & [p58<=1 & 1<=p58]]]] | EF [EG [[[p181<=1 & 1<=p181] & ~ [E [[p169<=1 & 1<=p169] U [p136<=0 & 0<=p136]]]]]]]
normalized: [E [true U EG [[~ [E [[p169<=1 & 1<=p169] U [p136<=0 & 0<=p136]]] & [p181<=1 & 1<=p181]]]] | ~ [EG [~ [[[[p58<=1 & 1<=p58] & [p33<=0 & 0<=p33]] & EX [E [true U [p50<=1 & 1<=p50]]]]]]]]
abstracting: (1<=p50)
states: 42
abstracting: (p50<=1)
states: 2,431 (3)
.abstracting: (0<=p33)
states: 2,431 (3)
abstracting: (p33<=0)
states: 2,389 (3)
abstracting: (1<=p58)
states: 45
abstracting: (p58<=1)
states: 2,431 (3)
.
EG iterations: 1
abstracting: (1<=p181)
states: 2
abstracting: (p181<=1)
states: 2,431 (3)
abstracting: (0<=p136)
states: 2,431 (3)
abstracting: (p136<=0)
states: 2,281 (3)
abstracting: (1<=p169)
states: 300
abstracting: (p169<=1)
states: 2,431 (3)
.
EG iterations: 1
-> the formula is FALSE
FORMULA IBM319-PT-none-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.041sec
checking: [A [0<=0 U ~ [A [[[p115<=0 & 0<=p115] | [[p166<=1 & 1<=p166] | [p141<=1 & 1<=p141]]] U [p135<=1 & 1<=p135]]]] & EG [EF [AG [[[p77<=0 & 0<=p77] | [p29<=1 & 1<=p29]]]]]]
normalized: [EG [E [true U ~ [E [true U ~ [[[p29<=1 & 1<=p29] | [p77<=0 & 0<=p77]]]]]]] & [~ [EG [[~ [EG [~ [[p135<=1 & 1<=p135]]]] & ~ [E [~ [[p135<=1 & 1<=p135]] U [~ [[[[p141<=1 & 1<=p141] | [p166<=1 & 1<=p166]] | [p115<=0 & 0<=p115]]] & ~ [[p135<=1 & 1<=p135]]]]]]]] & ~ [E [[~ [EG [~ [[p135<=1 & 1<=p135]]]] & ~ [E [~ [[p135<=1 & 1<=p135]] U [~ [[[[p141<=1 & 1<=p141] | [p166<=1 & 1<=p166]] | [p115<=0 & 0<=p115]]] & ~ [[p135<=1 & 1<=p135]]]]]] U [~ [0<=0] & [~ [EG [~ [[p135<=1 & 1<=p135]]]] & ~ [E [~ [[p135<=1 & 1<=p135]] U [~ [[[[p141<=1 & 1<=p141] | [p166<=1 & 1<=p166]] | [p115<=0 & 0<=p115]]] & ~ [[p135<=1 & 1<=p135]]]]]]]]]]]
abstracting: (1<=p135)
states: 3
abstracting: (p135<=1)
states: 2,431 (3)
abstracting: (0<=p115)
states: 2,431 (3)
abstracting: (p115<=0)
states: 2,428 (3)
abstracting: (1<=p166)
states: 150
abstracting: (p166<=1)
states: 2,431 (3)
abstracting: (1<=p141)
states: 3
abstracting: (p141<=1)
states: 2,431 (3)
abstracting: (1<=p135)
states: 3
abstracting: (p135<=1)
states: 2,431 (3)
abstracting: (1<=p135)
states: 3
abstracting: (p135<=1)
states: 2,431 (3)
....
EG iterations: 4
abstracting: (0<=0)
states: 2,431 (3)
abstracting: (1<=p135)
states: 3
abstracting: (p135<=1)
states: 2,431 (3)
abstracting: (0<=p115)
states: 2,431 (3)
abstracting: (p115<=0)
states: 2,428 (3)
abstracting: (1<=p166)
states: 150
abstracting: (p166<=1)
states: 2,431 (3)
abstracting: (1<=p141)
states: 3
abstracting: (p141<=1)
states: 2,431 (3)
abstracting: (1<=p135)
states: 3
abstracting: (p135<=1)
states: 2,431 (3)
abstracting: (1<=p135)
states: 3
abstracting: (p135<=1)
states: 2,431 (3)
....
EG iterations: 4
abstracting: (1<=p135)
states: 3
abstracting: (p135<=1)
states: 2,431 (3)
abstracting: (0<=p115)
states: 2,431 (3)
abstracting: (p115<=0)
states: 2,428 (3)
abstracting: (1<=p166)
states: 150
abstracting: (p166<=1)
states: 2,431 (3)
abstracting: (1<=p141)
states: 3
abstracting: (p141<=1)
states: 2,431 (3)
abstracting: (1<=p135)
states: 3
abstracting: (p135<=1)
states: 2,431 (3)
abstracting: (1<=p135)
states: 3
abstracting: (p135<=1)
states: 2,431 (3)
....
EG iterations: 4
.....
EG iterations: 5
abstracting: (0<=p77)
states: 2,431 (3)
abstracting: (p77<=0)
states: 2,386 (3)
abstracting: (1<=p29)
states: 3
abstracting: (p29<=1)
states: 2,431 (3)
EG iterations: 0
-> the formula is TRUE
FORMULA IBM319-PT-none-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.079sec
checking: AG [[[EF [[p43<=1 & 1<=p43]] | EG [[p23<=1 & 1<=p23]]] | [~ [E [[[p54<=0 & 0<=p54] | [p155<=1 & 1<=p155]] U [[p64<=0 & 0<=p64] | [p125<=1 & 1<=p125]]]] | ~ [E [[p173<=1 & 1<=p173] U [p52<=1 & 1<=p52]]]]]]
normalized: ~ [E [true U ~ [[[~ [E [[p173<=1 & 1<=p173] U [p52<=1 & 1<=p52]]] | ~ [E [[[p155<=1 & 1<=p155] | [p54<=0 & 0<=p54]] U [[p125<=1 & 1<=p125] | [p64<=0 & 0<=p64]]]]] | [EG [[p23<=1 & 1<=p23]] | E [true U [p43<=1 & 1<=p43]]]]]]]
abstracting: (1<=p43)
states: 45
abstracting: (p43<=1)
states: 2,431 (3)
abstracting: (1<=p23)
states: 3
abstracting: (p23<=1)
states: 2,431 (3)
...
EG iterations: 3
abstracting: (0<=p64)
states: 2,431 (3)
abstracting: (p64<=0)
states: 2,428 (3)
abstracting: (1<=p125)
states: 3
abstracting: (p125<=1)
states: 2,431 (3)
abstracting: (0<=p54)
states: 2,431 (3)
abstracting: (p54<=0)
states: 2,386 (3)
abstracting: (1<=p155)
states: 3
abstracting: (p155<=1)
states: 2,431 (3)
abstracting: (1<=p52)
states: 300
abstracting: (p52<=1)
states: 2,431 (3)
abstracting: (1<=p173)
states: 150
abstracting: (p173<=1)
states: 2,431 (3)
-> the formula is TRUE
FORMULA IBM319-PT-none-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.030sec
checking: AF [~ [E [EX [~ [EG [[[p94<=0 & 0<=p94] | [p47<=1 & 1<=p47]]]]] U [[EG [[[[p70<=0 & 0<=p70] | [p82<=1 & 1<=p82]] & [[p72<=0 & 0<=p72] | [p18<=1 & 1<=p18]]]] | [p13<=0 & 0<=p13]] | [[p107<=1 & 1<=p107] | [p71<=1 & 1<=p71]]]]]]
normalized: ~ [EG [E [EX [~ [EG [[[p47<=1 & 1<=p47] | [p94<=0 & 0<=p94]]]]] U [[[p71<=1 & 1<=p71] | [p107<=1 & 1<=p107]] | [[p13<=0 & 0<=p13] | EG [[[[p18<=1 & 1<=p18] | [p72<=0 & 0<=p72]] & [[p82<=1 & 1<=p82] | [p70<=0 & 0<=p70]]]]]]]]]
abstracting: (0<=p70)
states: 2,431 (3)
abstracting: (p70<=0)
states: 2,428 (3)
abstracting: (1<=p82)
states: 45
abstracting: (p82<=1)
states: 2,431 (3)
abstracting: (0<=p72)
states: 2,431 (3)
abstracting: (p72<=0)
states: 2,428 (3)
abstracting: (1<=p18)
states: 42
abstracting: (p18<=1)
states: 2,431 (3)
...
EG iterations: 3
abstracting: (0<=p13)
states: 2,431 (3)
abstracting: (p13<=0)
states: 2,428 (3)
abstracting: (1<=p107)
states: 0
abstracting: (p107<=1)
states: 2,431 (3)
abstracting: (1<=p71)
states: 3
abstracting: (p71<=1)
states: 2,431 (3)
abstracting: (0<=p94)
states: 2,431 (3)
abstracting: (p94<=0)
states: 2,428 (3)
abstracting: (1<=p47)
states: 42
abstracting: (p47<=1)
states: 2,431 (3)
.......
EG iterations: 7
.
EG iterations: 0
-> the formula is FALSE
FORMULA IBM319-PT-none-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.027sec
checking: E [~ [[EX [E [[p109<=1 & 1<=p109] U [p111<=0 & 0<=p111]]] & [[~ [[[p169<=0 & 0<=p169] & [[p46<=0 & 0<=p46] | [p26<=1 & 1<=p26]]]] | [[p80<=0 & 0<=p80] | [p17<=1 & 1<=p17]]] & EX [AG [[[p121<=0 & 0<=p121] | [p11<=1 & 1<=p11]]]]]]] U EX [AG [~ [[[p156<=0 & 0<=p156] | [p37<=1 & 1<=p37]]]]]]
normalized: E [~ [[[EX [~ [E [true U ~ [[[p11<=1 & 1<=p11] | [p121<=0 & 0<=p121]]]]]] & [[[p17<=1 & 1<=p17] | [p80<=0 & 0<=p80]] | ~ [[[[p26<=1 & 1<=p26] | [p46<=0 & 0<=p46]] & [p169<=0 & 0<=p169]]]]] & EX [E [[p109<=1 & 1<=p109] U [p111<=0 & 0<=p111]]]]] U EX [~ [E [true U [[p37<=1 & 1<=p37] | [p156<=0 & 0<=p156]]]]]]
abstracting: (0<=p156)
states: 2,431 (3)
abstracting: (p156<=0)
states: 2,428 (3)
abstracting: (1<=p37)
states: 3
abstracting: (p37<=1)
states: 2,431 (3)
.abstracting: (0<=p111)
states: 2,431 (3)
abstracting: (p111<=0)
states: 2,428 (3)
abstracting: (1<=p109)
states: 3
abstracting: (p109<=1)
states: 2,431 (3)
.abstracting: (0<=p169)
states: 2,431 (3)
abstracting: (p169<=0)
states: 2,131 (3)
abstracting: (0<=p46)
states: 2,431 (3)
abstracting: (p46<=0)
states: 2,281 (3)
abstracting: (1<=p26)
states: 3
abstracting: (p26<=1)
states: 2,431 (3)
abstracting: (0<=p80)
states: 2,431 (3)
abstracting: (p80<=0)
states: 2,428 (3)
abstracting: (1<=p17)
states: 150
abstracting: (p17<=1)
states: 2,431 (3)
abstracting: (0<=p121)
states: 2,431 (3)
abstracting: (p121<=0)
states: 2,428 (3)
abstracting: (1<=p11)
states: 2
abstracting: (p11<=1)
states: 2,431 (3)
.-> the formula is FALSE
FORMULA IBM319-PT-none-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.033sec
checking: EG [[AX [[[p65<=0 & 0<=p65] | [[p179<=0 & 0<=p179] & [p90<=1 & 1<=p90]]]] & [EF [[[p124<=0 & 0<=p124] | [p38<=1 & 1<=p38]]] & AF [[[[p82<=0 & 0<=p82] | [p147<=1 & 1<=p147]] & [[[p144<=0 & 0<=p144] | [p113<=1 & 1<=p113]] & [[p83<=0 & 0<=p83] | [p183<=1 & 1<=p183]]]]]]]]
normalized: EG [[[~ [EG [~ [[[[[p183<=1 & 1<=p183] | [p83<=0 & 0<=p83]] & [[p113<=1 & 1<=p113] | [p144<=0 & 0<=p144]]] & [[p147<=1 & 1<=p147] | [p82<=0 & 0<=p82]]]]]] & E [true U [[p38<=1 & 1<=p38] | [p124<=0 & 0<=p124]]]] & ~ [EX [~ [[[[p90<=1 & 1<=p90] & [p179<=0 & 0<=p179]] | [p65<=0 & 0<=p65]]]]]]]
abstracting: (0<=p65)
states: 2,431 (3)
abstracting: (p65<=0)
states: 2,428 (3)
abstracting: (0<=p179)
states: 2,431 (3)
abstracting: (p179<=0)
states: 2,281 (3)
abstracting: (1<=p90)
states: 3
abstracting: (p90<=1)
states: 2,431 (3)
.abstracting: (0<=p124)
states: 2,431 (3)
abstracting: (p124<=0)
states: 2,428 (3)
abstracting: (1<=p38)
states: 150
abstracting: (p38<=1)
states: 2,431 (3)
abstracting: (0<=p82)
states: 2,431 (3)
abstracting: (p82<=0)
states: 2,386 (3)
abstracting: (1<=p147)
states: 3
abstracting: (p147<=1)
states: 2,431 (3)
abstracting: (0<=p144)
states: 2,431 (3)
abstracting: (p144<=0)
states: 2,428 (3)
abstracting: (1<=p113)
states: 3
abstracting: (p113<=1)
states: 2,431 (3)
abstracting: (0<=p83)
states: 2,431 (3)
abstracting: (p83<=0)
states: 2,428 (3)
abstracting: (1<=p183)
states: 3
abstracting: (p183<=1)
states: 2,431 (3)
...
EG iterations: 3
....
EG iterations: 4
-> the formula is TRUE
FORMULA IBM319-PT-none-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.038sec
checking: [AG [[EX [[p168<=1 & 1<=p168]] | [EF [[p68<=1 & 1<=p68]] | EX [[p98<=0 & 0<=p98]]]]] | E [EG [[[[~ [[[p4<=0 & 0<=p4] | [p100<=1 & 1<=p100]]] & AX [[p126<=0 & 0<=p126]]] | ~ [AX [[[p122<=0 & 0<=p122] | [p153<=1 & 1<=p153]]]]] & [[p153<=1 & 1<=p153] | ~ [[[p187<=0 & 0<=p187] | [p69<=1 & 1<=p69]]]]]] U EG [[p102<=0 & 0<=p102]]]]
normalized: [E [EG [[[~ [[[p69<=1 & 1<=p69] | [p187<=0 & 0<=p187]]] | [p153<=1 & 1<=p153]] & [EX [~ [[[p153<=1 & 1<=p153] | [p122<=0 & 0<=p122]]]] | [~ [EX [~ [[p126<=0 & 0<=p126]]]] & ~ [[[p100<=1 & 1<=p100] | [p4<=0 & 0<=p4]]]]]]] U EG [[p102<=0 & 0<=p102]]] | ~ [E [true U ~ [[[EX [[p98<=0 & 0<=p98]] | E [true U [p68<=1 & 1<=p68]]] | EX [[p168<=1 & 1<=p168]]]]]]]
abstracting: (1<=p168)
states: 150
abstracting: (p168<=1)
states: 2,431 (3)
.abstracting: (1<=p68)
states: 2
abstracting: (p68<=1)
states: 2,431 (3)
abstracting: (0<=p98)
states: 2,431 (3)
abstracting: (p98<=0)
states: 2,389 (3)
.abstracting: (0<=p102)
states: 2,431 (3)
abstracting: (p102<=0)
states: 2,428 (3)
......
EG iterations: 6
abstracting: (0<=p4)
states: 2,431 (3)
abstracting: (p4<=0)
states: 2,386 (3)
abstracting: (1<=p100)
states: 2
abstracting: (p100<=1)
states: 2,431 (3)
abstracting: (0<=p126)
states: 2,431 (3)
abstracting: (p126<=0)
states: 2,428 (3)
.abstracting: (0<=p122)
states: 2,431 (3)
abstracting: (p122<=0)
states: 2,428 (3)
abstracting: (1<=p153)
states: 3
abstracting: (p153<=1)
states: 2,431 (3)
.abstracting: (1<=p153)
states: 3
abstracting: (p153<=1)
states: 2,431 (3)
abstracting: (0<=p187)
states: 2,431 (3)
abstracting: (p187<=0)
states: 2,281 (3)
abstracting: (1<=p69)
states: 3
abstracting: (p69<=1)
states: 2,431 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA IBM319-PT-none-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.047sec
checking: EF [[[EX [A [[[p184<=0 & 0<=p184] | [p95<=1 & 1<=p95]] U [p178<=1 & 1<=p178]]] & ~ [[p77<=0 & 0<=p77]]] & [~ [[p95<=1 & 1<=p95]] & [~ [A [[p3<=0 & 0<=p3] U [[p4<=0 & 0<=p4] | [p95<=1 & 1<=p95]]]] | [EF [[[p180<=0 & 0<=p180] | [p159<=1 & 1<=p159]]] & [[p44<=0 & 0<=p44] | [[p23<=1 & 1<=p23] | [p148<=1 & 1<=p148]]]]]]]]
normalized: E [true U [[[[[[[p148<=1 & 1<=p148] | [p23<=1 & 1<=p23]] | [p44<=0 & 0<=p44]] & E [true U [[p159<=1 & 1<=p159] | [p180<=0 & 0<=p180]]]] | ~ [[~ [EG [~ [[[p95<=1 & 1<=p95] | [p4<=0 & 0<=p4]]]]] & ~ [E [~ [[[p95<=1 & 1<=p95] | [p4<=0 & 0<=p4]]] U [~ [[p3<=0 & 0<=p3]] & ~ [[[p95<=1 & 1<=p95] | [p4<=0 & 0<=p4]]]]]]]]] & ~ [[p95<=1 & 1<=p95]]] & [~ [[p77<=0 & 0<=p77]] & EX [[~ [EG [~ [[p178<=1 & 1<=p178]]]] & ~ [E [~ [[p178<=1 & 1<=p178]] U [~ [[[p95<=1 & 1<=p95] | [p184<=0 & 0<=p184]]] & ~ [[p178<=1 & 1<=p178]]]]]]]]]]
abstracting: (1<=p178)
states: 3
abstracting: (p178<=1)
states: 2,431 (3)
abstracting: (0<=p184)
states: 2,431 (3)
abstracting: (p184<=0)
states: 2,389 (3)
abstracting: (1<=p95)
states: 812
abstracting: (p95<=1)
states: 2,431 (3)
abstracting: (1<=p178)
states: 3
abstracting: (p178<=1)
states: 2,431 (3)
abstracting: (1<=p178)
states: 3
abstracting: (p178<=1)
states: 2,431 (3)
.
EG iterations: 1
.abstracting: (0<=p77)
states: 2,431 (3)
abstracting: (p77<=0)
states: 2,386 (3)
abstracting: (1<=p95)
states: 812
abstracting: (p95<=1)
states: 2,431 (3)
abstracting: (0<=p4)
states: 2,431 (3)
abstracting: (p4<=0)
states: 2,386 (3)
abstracting: (1<=p95)
states: 812
abstracting: (p95<=1)
states: 2,431 (3)
abstracting: (0<=p3)
states: 2,431 (3)
abstracting: (p3<=0)
states: 2,428 (3)
abstracting: (0<=p4)
states: 2,431 (3)
abstracting: (p4<=0)
states: 2,386 (3)
abstracting: (1<=p95)
states: 812
abstracting: (p95<=1)
states: 2,431 (3)
abstracting: (0<=p4)
states: 2,431 (3)
abstracting: (p4<=0)
states: 2,386 (3)
abstracting: (1<=p95)
states: 812
abstracting: (p95<=1)
states: 2,431 (3)
..............
EG iterations: 14
abstracting: (0<=p180)
states: 2,431 (3)
abstracting: (p180<=0)
states: 2,281 (3)
abstracting: (1<=p159)
states: 3
abstracting: (p159<=1)
states: 2,431 (3)
abstracting: (0<=p44)
states: 2,431 (3)
abstracting: (p44<=0)
states: 2,428 (3)
abstracting: (1<=p23)
states: 3
abstracting: (p23<=1)
states: 2,431 (3)
abstracting: (1<=p148)
states: 3
abstracting: (p148<=1)
states: 2,431 (3)
-> the formula is FALSE
FORMULA IBM319-PT-none-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.073sec
checking: E [EG [[EG [~ [[[p50<=0 & 0<=p50] & [p130<=1 & 1<=p130]]]] | [[E [[[p59<=0 & 0<=p59] | [p32<=1 & 1<=p32]] U [[p158<=0 & 0<=p158] | [p155<=1 & 1<=p155]]] & EX [[p182<=0 & 0<=p182]]] & [~ [[p57<=0 & 0<=p57]] & [[p55<=0 & 0<=p55] | [[p67<=1 & 1<=p67] | [p183<=1 & 1<=p183]]]]]]] U [EX [~ [[[[p99<=0 & 0<=p99] | [p153<=1 & 1<=p153]] & ~ [AF [[[p23<=0 & 0<=p23] | [p65<=1 & 1<=p65]]]]]]] & [p114<=1 & 1<=p114]]]
normalized: E [EG [[[[[[[p183<=1 & 1<=p183] | [p67<=1 & 1<=p67]] | [p55<=0 & 0<=p55]] & ~ [[p57<=0 & 0<=p57]]] & [EX [[p182<=0 & 0<=p182]] & E [[[p32<=1 & 1<=p32] | [p59<=0 & 0<=p59]] U [[p155<=1 & 1<=p155] | [p158<=0 & 0<=p158]]]]] | EG [~ [[[p130<=1 & 1<=p130] & [p50<=0 & 0<=p50]]]]]] U [[p114<=1 & 1<=p114] & EX [~ [[EG [~ [[[p65<=1 & 1<=p65] | [p23<=0 & 0<=p23]]]] & [[p153<=1 & 1<=p153] | [p99<=0 & 0<=p99]]]]]]]
abstracting: (0<=p99)
states: 2,431 (3)
abstracting: (p99<=0)
states: 2,428 (3)
abstracting: (1<=p153)
states: 3
abstracting: (p153<=1)
states: 2,431 (3)
abstracting: (0<=p23)
states: 2,431 (3)
abstracting: (p23<=0)
states: 2,428 (3)
abstracting: (1<=p65)
states: 3
abstracting: (p65<=1)
states: 2,431 (3)
...
EG iterations: 3
.abstracting: (1<=p114)
states: 3
abstracting: (p114<=1)
states: 2,431 (3)
abstracting: (0<=p50)
states: 2,431 (3)
abstracting: (p50<=0)
states: 2,389 (3)
abstracting: (1<=p130)
states: 45
abstracting: (p130<=1)
states: 2,431 (3)
...............
EG iterations: 15
abstracting: (0<=p158)
states: 2,431 (3)
abstracting: (p158<=0)
states: 2,428 (3)
abstracting: (1<=p155)
states: 3
abstracting: (p155<=1)
states: 2,431 (3)
abstracting: (0<=p59)
states: 2,431 (3)
abstracting: (p59<=0)
states: 2,428 (3)
abstracting: (1<=p32)
states: 0
abstracting: (p32<=1)
states: 2,431 (3)
abstracting: (0<=p182)
states: 2,431 (3)
abstracting: (p182<=0)
states: 2,389 (3)
.abstracting: (0<=p57)
states: 2,431 (3)
abstracting: (p57<=0)
states: 2,131 (3)
abstracting: (0<=p55)
states: 2,431 (3)
abstracting: (p55<=0)
states: 2,281 (3)
abstracting: (1<=p67)
states: 42
abstracting: (p67<=1)
states: 2,431 (3)
abstracting: (1<=p183)
states: 3
abstracting: (p183<=1)
states: 2,431 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA IBM319-PT-none-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.104sec
checking: A [A [[[~ [A [[p74<=0 & 0<=p74] U [[p160<=0 & 0<=p160] | [p75<=1 & 1<=p75]]]] | E [[p124<=1 & 1<=p124] U [[p36<=0 & 0<=p36] | [p122<=1 & 1<=p122]]]] | [EG [[p44<=1 & 1<=p44]] | [AF [[p160<=1 & 1<=p160]] | [~ [EX [[[p154<=0 & 0<=p154] | [p101<=1 & 1<=p101]]]] & EF [[[p64<=1 & 1<=p64] | [p73<=1 & 1<=p73]]]]]]] U ~ [AG [EF [[p132<=1 & 1<=p132]]]]] U ~ [A [~ [[AG [[p27<=1 & 1<=p27]] & ~ [EF [[p31<=1 & 1<=p31]]]]] U [[EX [[p120<=1 & 1<=p120]] | AX [[p144<=1 & 1<=p144]]] | [EF [[p19<=0 & 0<=p19]] | [[p165<=0 & 0<=p165] | EX [0<=0]]]]]]]
normalized: [~ [E [[~ [EG [~ [[[EX [[p120<=1 & 1<=p120]] | ~ [EX [~ [[p144<=1 & 1<=p144]]]]] | [E [true U [p19<=0 & 0<=p19]] | [EX [0<=0] | [p165<=0 & 0<=p165]]]]]]] & ~ [E [~ [[[EX [[p120<=1 & 1<=p120]] | ~ [EX [~ [[p144<=1 & 1<=p144]]]]] | [E [true U [p19<=0 & 0<=p19]] | [EX [0<=0] | [p165<=0 & 0<=p165]]]]] U [[~ [E [true U ~ [[p27<=1 & 1<=p27]]]] & ~ [E [true U [p31<=1 & 1<=p31]]]] & ~ [[[EX [[p120<=1 & 1<=p120]] | ~ [EX [~ [[p144<=1 & 1<=p144]]]]] | [E [true U [p19<=0 & 0<=p19]] | [EX [0<=0] | [p165<=0 & 0<=p165]]]]]]]]] U [[~ [EG [~ [[[EX [[p120<=1 & 1<=p120]] | ~ [EX [~ [[p144<=1 & 1<=p144]]]]] | [E [true U [p19<=0 & 0<=p19]] | [EX [0<=0] | [p165<=0 & 0<=p165]]]]]]] & ~ [E [~ [[[EX [[p120<=1 & 1<=p120]] | ~ [EX [~ [[p144<=1 & 1<=p144]]]]] | [E [true U [p19<=0 & 0<=p19]] | [EX [0<=0] | [p165<=0 & 0<=p165]]]]] U [[~ [E [true U ~ [[p27<=1 & 1<=p27]]]] & ~ [E [true U [p31<=1 & 1<=p31]]]] & ~ [[[EX [[p120<=1 & 1<=p120]] | ~ [EX [~ [[p144<=1 & 1<=p144]]]]] | [E [true U [p19<=0 & 0<=p19]] | [EX [0<=0] | [p165<=0 & 0<=p165]]]]]]]]] & ~ [[~ [EG [~ [E [true U ~ [E [true U [p132<=1 & 1<=p132]]]]]]] & ~ [E [~ [E [true U ~ [E [true U [p132<=1 & 1<=p132]]]]] U [~ [E [true U ~ [E [true U [p132<=1 & 1<=p132]]]]] & ~ [[[~ [[~ [E [~ [[[p75<=1 & 1<=p75] | [p160<=0 & 0<=p160]]] U [~ [[[p75<=1 & 1<=p75] | [p160<=0 & 0<=p160]]] & ~ [[p74<=0 & 0<=p74]]]]] & ~ [EG [~ [[[p75<=1 & 1<=p75] | [p160<=0 & 0<=p160]]]]]]] | E [[p124<=1 & 1<=p124] U [[p122<=1 & 1<=p122] | [p36<=0 & 0<=p36]]]] | [EG [[p44<=1 & 1<=p44]] | [~ [EG [~ [[p160<=1 & 1<=p160]]]] | [E [true U [[p73<=1 & 1<=p73] | [p64<=1 & 1<=p64]]] & ~ [EX [[[p101<=1 & 1<=p101] | [p154<=0 & 0<=p154]]]]]]]]]]]]]]]]] & ~ [EG [[~ [EG [~ [[[EX [[p120<=1 & 1<=p120]] | ~ [EX [~ [[p144<=1 & 1<=p144]]]]] | [E [true U [p19<=0 & 0<=p19]] | [EX [0<=0] | [p165<=0 & 0<=p165]]]]]]] & ~ [E [~ [[[EX [[p120<=1 & 1<=p120]] | ~ [EX [~ [[p144<=1 & 1<=p144]]]]] | [E [true U [p19<=0 & 0<=p19]] | [EX [0<=0] | [p165<=0 & 0<=p165]]]]] U [[~ [E [true U ~ [[p27<=1 & 1<=p27]]]] & ~ [E [true U [p31<=1 & 1<=p31]]]] & ~ [[[EX [[p120<=1 & 1<=p120]] | ~ [EX [~ [[p144<=1 & 1<=p144]]]]] | [E [true U [p19<=0 & 0<=p19]] | [EX [0<=0] | [p165<=0 & 0<=p165]]]]]]]]]]]]
abstracting: (0<=p165)
states: 2,431 (3)
abstracting: (p165<=0)
states: 2,428 (3)
abstracting: (0<=0)
states: 2,431 (3)
.abstracting: (0<=p19)
states: 2,431 (3)
abstracting: (p19<=0)
states: 2,428 (3)
abstracting: (1<=p144)
states: 3
abstracting: (p144<=1)
states: 2,431 (3)
.abstracting: (1<=p120)
states: 3
abstracting: (p120<=1)
states: 2,431 (3)
.abstracting: (1<=p31)
states: 3
abstracting: (p31<=1)
states: 2,431 (3)
abstracting: (1<=p27)
states: 3
abstracting: (p27<=1)
states: 2,431 (3)
abstracting: (0<=p165)
states: 2,431 (3)
abstracting: (p165<=0)
states: 2,428 (3)
abstracting: (0<=0)
states: 2,431 (3)
.abstracting: (0<=p19)
states: 2,431 (3)
abstracting: (p19<=0)
states: 2,428 (3)
abstracting: (1<=p144)
states: 3
abstracting: (p144<=1)
states: 2,431 (3)
.abstracting: (1<=p120)
states: 3
abstracting: (p120<=1)
states: 2,431 (3)
.abstracting: (0<=p165)
states: 2,431 (3)
abstracting: (p165<=0)
states: 2,428 (3)
abstracting: (0<=0)
states: 2,431 (3)
.abstracting: (0<=p19)
states: 2,431 (3)
abstracting: (p19<=0)
states: 2,428 (3)
abstracting: (1<=p144)
states: 3
abstracting: (p144<=1)
states: 2,431 (3)
.abstracting: (1<=p120)
states: 3
abstracting: (p120<=1)
states: 2,431 (3)
..
EG iterations: 1
EG iterations: 0
abstracting: (0<=p154)
states: 2,431 (3)
abstracting: (p154<=0)
states: 2,428 (3)
abstracting: (1<=p101)
states: 3
abstracting: (p101<=1)
states: 2,431 (3)
.abstracting: (1<=p64)
states: 3
abstracting: (p64<=1)
states: 2,431 (3)
abstracting: (1<=p73)
states: 3
abstracting: (p73<=1)
states: 2,431 (3)
abstracting: (1<=p160)
states: 3
abstracting: (p160<=1)
states: 2,431 (3)
.
EG iterations: 1
abstracting: (1<=p44)
states: 3
abstracting: (p44<=1)
states: 2,431 (3)
...
EG iterations: 3
abstracting: (0<=p36)
states: 2,431 (3)
abstracting: (p36<=0)
states: 2,428 (3)
abstracting: (1<=p122)
states: 3
abstracting: (p122<=1)
states: 2,431 (3)
abstracting: (1<=p124)
states: 3
abstracting: (p124<=1)
states: 2,431 (3)
abstracting: (0<=p160)
states: 2,431 (3)
abstracting: (p160<=0)
states: 2,428 (3)
abstracting: (1<=p75)
states: 5
abstracting: (p75<=1)
states: 2,431 (3)
...
EG iterations: 3
abstracting: (0<=p74)
states: 2,431 (3)
abstracting: (p74<=0)
states: 2,428 (3)
abstracting: (0<=p160)
states: 2,431 (3)
abstracting: (p160<=0)
states: 2,428 (3)
abstracting: (1<=p75)
states: 5
abstracting: (p75<=1)
states: 2,431 (3)
abstracting: (0<=p160)
states: 2,431 (3)
abstracting: (p160<=0)
states: 2,428 (3)
abstracting: (1<=p75)
states: 5
abstracting: (p75<=1)
states: 2,431 (3)
abstracting: (1<=p132)
states: 3
abstracting: (p132<=1)
states: 2,431 (3)
abstracting: (1<=p132)
states: 3
abstracting: (p132<=1)
states: 2,431 (3)
abstracting: (1<=p132)
states: 3
abstracting: (p132<=1)
states: 2,431 (3)
.
EG iterations: 1
abstracting: (0<=p165)
states: 2,431 (3)
abstracting: (p165<=0)
states: 2,428 (3)
abstracting: (0<=0)
states: 2,431 (3)
.abstracting: (0<=p19)
states: 2,431 (3)
abstracting: (p19<=0)
states: 2,428 (3)
abstracting: (1<=p144)
states: 3
abstracting: (p144<=1)
states: 2,431 (3)
.abstracting: (1<=p120)
states: 3
abstracting: (p120<=1)
states: 2,431 (3)
.abstracting: (1<=p31)
states: 3
abstracting: (p31<=1)
states: 2,431 (3)
abstracting: (1<=p27)
states: 3
abstracting: (p27<=1)
states: 2,431 (3)
abstracting: (0<=p165)
states: 2,431 (3)
abstracting: (p165<=0)
states: 2,428 (3)
abstracting: (0<=0)
states: 2,431 (3)
.abstracting: (0<=p19)
states: 2,431 (3)
abstracting: (p19<=0)
states: 2,428 (3)
abstracting: (1<=p144)
states: 3
abstracting: (p144<=1)
states: 2,431 (3)
.abstracting: (1<=p120)
states: 3
abstracting: (p120<=1)
states: 2,431 (3)
.abstracting: (0<=p165)
states: 2,431 (3)
abstracting: (p165<=0)
states: 2,428 (3)
abstracting: (0<=0)
states: 2,431 (3)
.abstracting: (0<=p19)
states: 2,431 (3)
abstracting: (p19<=0)
states: 2,428 (3)
abstracting: (1<=p144)
states: 3
abstracting: (p144<=1)
states: 2,431 (3)
.abstracting: (1<=p120)
states: 3
abstracting: (p120<=1)
states: 2,431 (3)
..
EG iterations: 1
abstracting: (0<=p165)
states: 2,431 (3)
abstracting: (p165<=0)
states: 2,428 (3)
abstracting: (0<=0)
states: 2,431 (3)
.abstracting: (0<=p19)
states: 2,431 (3)
abstracting: (p19<=0)
states: 2,428 (3)
abstracting: (1<=p144)
states: 3
abstracting: (p144<=1)
states: 2,431 (3)
.abstracting: (1<=p120)
states: 3
abstracting: (p120<=1)
states: 2,431 (3)
.abstracting: (1<=p31)
states: 3
abstracting: (p31<=1)
states: 2,431 (3)
abstracting: (1<=p27)
states: 3
abstracting: (p27<=1)
states: 2,431 (3)
abstracting: (0<=p165)
states: 2,431 (3)
abstracting: (p165<=0)
states: 2,428 (3)
abstracting: (0<=0)
states: 2,431 (3)
.abstracting: (0<=p19)
states: 2,431 (3)
abstracting: (p19<=0)
states: 2,428 (3)
abstracting: (1<=p144)
states: 3
abstracting: (p144<=1)
states: 2,431 (3)
.abstracting: (1<=p120)
states: 3
abstracting: (p120<=1)
states: 2,431 (3)
.abstracting: (0<=p165)
states: 2,431 (3)
abstracting: (p165<=0)
states: 2,428 (3)
abstracting: (0<=0)
states: 2,431 (3)
.abstracting: (0<=p19)
states: 2,431 (3)
abstracting: (p19<=0)
states: 2,428 (3)
abstracting: (1<=p144)
states: 3
abstracting: (p144<=1)
states: 2,431 (3)
.abstracting: (1<=p120)
states: 3
abstracting: (p120<=1)
states: 2,431 (3)
..
EG iterations: 1
-> the formula is FALSE
FORMULA IBM319-PT-none-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.089sec
totally nodes used: 505536 (5.1e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 600993 2104906 2705899
used/not used/entry size/cache size: 2595787 64513077 16 1024MB
basic ops cache: hits/miss/sum: 45713 255833 301546
used/not used/entry size/cache size: 453481 16323735 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: 4751 12098 16849
used/not used/entry size/cache size: 12089 8376519 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 66621440
1 470292
2 16166
3 953
4 12
5 1
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.150sec
BK_STOP 1679447592627
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:1022 (5), effective:158 (0)
initing FirstDep: 0m 0.000sec
iterations count:178 (1), effective:1 (0)
iterations count:178 (1), effective:1 (0)
iterations count:446 (2), effective:89 (0)
iterations count:179 (1), effective:1 (0)
iterations count:243 (1), effective:27 (0)
iterations count:243 (1), effective:27 (0)
iterations count:243 (1), effective:27 (0)
iterations count:453 (2), effective:92 (0)
iterations count:469 (2), effective:93 (0)
iterations count:463 (2), effective:97 (0)
iterations count:178 (1), effective:1 (0)
iterations count:204 (1), effective:4 (0)
iterations count:176 (1), effective:0 (0)
iterations count:178 (1), effective:1 (0)
iterations count:176 (1), effective:0 (0)
iterations count:269 (1), effective:38 (0)
iterations count:178 (1), effective:1 (0)
iterations count:181 (1), effective:3 (0)
iterations count:750 (4), effective:169 (0)
iterations count:176 (1), effective:0 (0)
iterations count:482 (2), effective:100 (0)
iterations count:179 (1), effective:1 (0)
iterations count:178 (1), effective:1 (0)
iterations count:397 (2), effective:74 (0)
iterations count:178 (1), effective:1 (0)
iterations count:563 (3), effective:128 (0)
iterations count:181 (1), effective:1 (0)
iterations count:178 (1), effective:1 (0)
iterations count:178 (1), effective:1 (0)
iterations count:508 (2), effective:83 (0)
iterations count:176 (1), effective:0 (0)
iterations count:261 (1), effective:34 (0)
iterations count:263 (1), effective:35 (0)
iterations count:261 (1), effective:34 (0)
iterations count:263 (1), effective:35 (0)
iterations count:261 (1), effective:34 (0)
iterations count:263 (1), effective:35 (0)
iterations count:178 (1), effective:1 (0)
iterations count:563 (3), effective:128 (0)
iterations count:181 (1), effective:1 (0)
iterations count:178 (1), effective:1 (0)
iterations count:178 (1), effective:1 (0)
iterations count:178 (1), effective:1 (0)
iterations count:563 (3), effective:128 (0)
iterations count:181 (1), effective:1 (0)
iterations count:178 (1), effective:1 (0)
iterations count:178 (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="IBM319-PT-none"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is IBM319-PT-none, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856419800073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/IBM319-PT-none.tgz
mv IBM319-PT-none execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;