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-167856419800074.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856419800074
=====================================================================

--------------------
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-CTLFireability-00
FORMULA_NAME IBM319-PT-none-CTLFireability-01
FORMULA_NAME IBM319-PT-none-CTLFireability-02
FORMULA_NAME IBM319-PT-none-CTLFireability-03
FORMULA_NAME IBM319-PT-none-CTLFireability-04
FORMULA_NAME IBM319-PT-none-CTLFireability-05
FORMULA_NAME IBM319-PT-none-CTLFireability-06
FORMULA_NAME IBM319-PT-none-CTLFireability-07
FORMULA_NAME IBM319-PT-none-CTLFireability-08
FORMULA_NAME IBM319-PT-none-CTLFireability-09
FORMULA_NAME IBM319-PT-none-CTLFireability-10
FORMULA_NAME IBM319-PT-none-CTLFireability-11
FORMULA_NAME IBM319-PT-none-CTLFireability-12
FORMULA_NAME IBM319-PT-none-CTLFireability-13
FORMULA_NAME IBM319-PT-none-CTLFireability-14
FORMULA_NAME IBM319-PT-none-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679447603977

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM319-PT-none
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 01:13:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 01:13:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 01:13:25] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-22 01:13:25] [INFO ] Transformed 253 places.
[2023-03-22 01:13:25] [INFO ] Transformed 178 transitions.
[2023-03-22 01:13:25] [INFO ] Found NUPN structural information;
[2023-03-22 01:13:25] [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:25] [INFO ] Parsed PT model containing 253 places and 178 transitions and 526 arcs in 122 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Support contains 101 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 48 places
Reduce places removed 56 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 196 transition count 178
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 193 transition count 175
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 193 transition count 175
Applied a total of 63 rules in 31 ms. Remains 193 /253 variables (removed 60) and now considering 175/178 (removed 3) transitions.
// Phase 1: matrix 175 rows 193 cols
[2023-03-22 01:13:25] [INFO ] Computed 31 place invariants in 17 ms
[2023-03-22 01:13:26] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-22 01:13:26] [INFO ] Invariant cache hit.
[2023-03-22 01:13:26] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2023-03-22 01:13:26] [INFO ] Invariant cache hit.
[2023-03-22 01:13:26] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 193/253 places, 175/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 682 ms. Remains : 193/253 places, 175/178 transitions.
Support contains 101 out of 193 places after structural reductions.
[2023-03-22 01:13:26] [INFO ] Flatten gal took : 36 ms
[2023-03-22 01:13:26] [INFO ] Flatten gal took : 13 ms
[2023-03-22 01:13:26] [INFO ] Input system was already deterministic with 175 transitions.
Incomplete random walk after 10000 steps, including 209 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 62) seen :49
Incomplete Best-First random walk after 10001 steps, including 333 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 107 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 100 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 115 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 333 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-22 01:13:28] [INFO ] Invariant cache hit.
[2023-03-22 01:13:29] [INFO ] [Real]Absence check using 0 positive and 31 generalized place invariants in 5 ms returned sat
[2023-03-22 01:13:29] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-22 01:13:29] [INFO ] [Nat]Absence check using 0 positive and 31 generalized place invariants in 6 ms returned sat
[2023-03-22 01:13:29] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :0
Fused 12 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
FORMULA IBM319-PT-none-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 01:13:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 11 ms
FORMULA IBM319-PT-none-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 9 ms
[2023-03-22 01:13:29] [INFO ] Input system was already deterministic with 175 transitions.
Support contains 52 out of 193 places (down from 61) after GAL structural reductions.
Computed a total of 193 stabilizing places and 175 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 193 transition count 175
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 175/175 transitions.
Graph (complete) has 240 edges and 193 vertex of which 52 are kept as prefixes of interest. Removing 141 places using SCC suffix rule.2 ms
Discarding 141 places :
Also discarding 129 output transitions
Drop transitions removed 129 transitions
Ensure Unique test removed 9 places
Reduce places removed 10 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 42 transition count 14
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 33 rules applied. Total rules applied 65 place count 12 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 10 transition count 11
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 67 place count 10 transition count 8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 73 place count 7 transition count 8
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 75 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 78 place count 5 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 79 place count 4 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 79 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 6 with 2 rules applied. Total rules applied 81 place count 3 transition count 4
Applied a total of 81 rules in 11 ms. Remains 3 /193 variables (removed 190) and now considering 4/175 (removed 171) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 3/193 places, 4/175 transitions.
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 0 ms
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 01:13:29] [INFO ] Input system was already deterministic with 4 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 175/175 transitions.
Graph (complete) has 240 edges and 193 vertex of which 51 are kept as prefixes of interest. Removing 142 places using SCC suffix rule.1 ms
Discarding 142 places :
Also discarding 131 output transitions
Drop transitions removed 131 transitions
Ensure Unique test removed 5 places
Reduce places removed 6 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 45 transition count 22
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 24 rules applied. Total rules applied 46 place count 24 transition count 19
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 50 place count 22 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 20 transition count 17
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 52 place count 20 transition count 14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 58 place count 17 transition count 14
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 60 place count 16 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 63 place count 15 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 64 place count 14 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 64 place count 14 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 66 place count 13 transition count 10
Applied a total of 66 rules in 6 ms. Remains 13 /193 variables (removed 180) and now considering 10/175 (removed 165) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 13/193 places, 10/175 transitions.
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 0 ms
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 01:13:29] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 175/175 transitions.
Graph (complete) has 240 edges and 193 vertex of which 160 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.1 ms
Discarding 33 places :
Also discarding 26 output transitions
Drop transitions removed 26 transitions
Ensure Unique test removed 23 places
Reduce places removed 24 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 92 rules applied. Total rules applied 93 place count 136 transition count 56
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 98 rules applied. Total rules applied 191 place count 45 transition count 49
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 196 place count 41 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 197 place count 40 transition count 48
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 197 place count 40 transition count 34
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 29 rules applied. Total rules applied 226 place count 25 transition count 34
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 24 transition count 33
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 231 place count 23 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 232 place count 22 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 232 place count 22 transition count 30
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 234 place count 21 transition count 30
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 241 place count 21 transition count 23
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 2 rules applied. Total rules applied 243 place count 21 transition count 21
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 245 place count 19 transition count 21
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 4 Pre rules applied. Total rules applied 245 place count 19 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 253 place count 15 transition count 17
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 254 place count 15 transition count 17
Applied a total of 254 rules in 11 ms. Remains 15 /193 variables (removed 178) and now considering 17/175 (removed 158) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 15/193 places, 17/175 transitions.
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 01:13:29] [INFO ] Input system was already deterministic with 17 transitions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 175/175 transitions.
Ensure Unique test removed 28 places
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 165 transition count 175
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 38 place count 155 transition count 165
Iterating global reduction 1 with 10 rules applied. Total rules applied 48 place count 155 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 155 transition count 164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 153 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 153 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 152 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 152 transition count 161
Applied a total of 55 rules in 30 ms. Remains 152 /193 variables (removed 41) and now considering 161/175 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 152/193 places, 161/175 transitions.
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 11 ms
[2023-03-22 01:13:29] [INFO ] Input system was already deterministic with 161 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 175/175 transitions.
Graph (complete) has 240 edges and 193 vertex of which 144 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.1 ms
Discarding 49 places :
Also discarding 44 output transitions
Drop transitions removed 44 transitions
Ensure Unique test removed 20 places
Reduce places removed 21 places and 1 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 123 transition count 66
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 67 rules applied. Total rules applied 132 place count 59 transition count 63
Reduce places removed 1 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 10 rules applied. Total rules applied 142 place count 58 transition count 54
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 13 rules applied. Total rules applied 155 place count 49 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 157 place count 47 transition count 50
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 157 place count 47 transition count 38
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 181 place count 35 transition count 38
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 182 place count 34 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 182 place count 34 transition count 37
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 184 place count 33 transition count 37
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 187 place count 33 transition count 34
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 187 place count 33 transition count 32
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 191 place count 31 transition count 32
Applied a total of 191 rules in 10 ms. Remains 31 /193 variables (removed 162) and now considering 32/175 (removed 143) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 31/193 places, 32/175 transitions.
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 2 ms
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 01:13:29] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 175/175 transitions.
Ensure Unique test removed 25 places
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 168 transition count 175
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 35 place count 158 transition count 165
Iterating global reduction 1 with 10 rules applied. Total rules applied 45 place count 158 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 158 transition count 164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 156 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 156 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 155 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 155 transition count 161
Applied a total of 52 rules in 13 ms. Remains 155 /193 variables (removed 38) and now considering 161/175 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 155/193 places, 161/175 transitions.
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 5 ms
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:13:29] [INFO ] Input system was already deterministic with 161 transitions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 175/175 transitions.
Ensure Unique test removed 27 places
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 166 transition count 175
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 36 place count 157 transition count 166
Iterating global reduction 1 with 9 rules applied. Total rules applied 45 place count 157 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 46 place count 157 transition count 165
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 155 transition count 163
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 155 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 154 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 154 transition count 162
Applied a total of 52 rules in 18 ms. Remains 154 /193 variables (removed 39) and now considering 162/175 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 154/193 places, 162/175 transitions.
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:13:29] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 175/175 transitions.
Ensure Unique test removed 28 places
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 165 transition count 175
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 38 place count 155 transition count 165
Iterating global reduction 1 with 10 rules applied. Total rules applied 48 place count 155 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 155 transition count 164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 153 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 153 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 152 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 152 transition count 161
Applied a total of 55 rules in 12 ms. Remains 152 /193 variables (removed 41) and now considering 161/175 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 152/193 places, 161/175 transitions.
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 5 ms
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:13:29] [INFO ] Input system was already deterministic with 161 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 175/175 transitions.
Graph (complete) has 240 edges and 193 vertex of which 99 are kept as prefixes of interest. Removing 94 places using SCC suffix rule.0 ms
Discarding 94 places :
Also discarding 89 output transitions
Drop transitions removed 89 transitions
Ensure Unique test removed 17 places
Reduce places removed 18 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 81 transition count 31
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 63 rules applied. Total rules applied 118 place count 27 transition count 22
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 124 place count 21 transition count 22
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 124 place count 21 transition count 15
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 140 place count 12 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 142 place count 11 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 145 place count 10 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 146 place count 9 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 146 place count 9 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 148 place count 8 transition count 11
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 150 place count 8 transition count 9
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 151 place count 8 transition count 9
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 152 place count 8 transition count 8
Applied a total of 152 rules in 6 ms. Remains 8 /193 variables (removed 185) and now considering 8/175 (removed 167) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 8/193 places, 8/175 transitions.
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 01:13:29] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 175/175 transitions.
Ensure Unique test removed 28 places
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 165 transition count 175
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 38 place count 155 transition count 165
Iterating global reduction 1 with 10 rules applied. Total rules applied 48 place count 155 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 155 transition count 164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 153 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 153 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 152 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 152 transition count 161
Applied a total of 55 rules in 12 ms. Remains 152 /193 variables (removed 41) and now considering 161/175 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 152/193 places, 161/175 transitions.
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 5 ms
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 5 ms
[2023-03-22 01:13:29] [INFO ] Input system was already deterministic with 161 transitions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 175/175 transitions.
Ensure Unique test removed 27 places
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 166 transition count 175
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 37 place count 156 transition count 165
Iterating global reduction 1 with 10 rules applied. Total rules applied 47 place count 156 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 156 transition count 164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 154 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 154 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 153 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 153 transition count 161
Applied a total of 54 rules in 12 ms. Remains 153 /193 variables (removed 40) and now considering 161/175 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 153/193 places, 161/175 transitions.
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 5 ms
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 5 ms
[2023-03-22 01:13:29] [INFO ] Input system was already deterministic with 161 transitions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 175/175 transitions.
Ensure Unique test removed 28 places
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 165 transition count 175
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 38 place count 155 transition count 165
Iterating global reduction 1 with 10 rules applied. Total rules applied 48 place count 155 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 155 transition count 164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 153 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 153 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 152 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 152 transition count 161
Applied a total of 55 rules in 20 ms. Remains 152 /193 variables (removed 41) and now considering 161/175 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 152/193 places, 161/175 transitions.
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 5 ms
[2023-03-22 01:13:29] [INFO ] Input system was already deterministic with 161 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 175/175 transitions.
Graph (complete) has 240 edges and 193 vertex of which 150 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.1 ms
Discarding 43 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Ensure Unique test removed 24 places
Reduce places removed 25 places and 1 transitions.
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 125 transition count 47
Reduce places removed 88 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 98 rules applied. Total rules applied 187 place count 37 transition count 37
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 193 place count 31 transition count 37
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 193 place count 31 transition count 24
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 221 place count 16 transition count 24
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 223 place count 15 transition count 23
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 226 place count 14 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 227 place count 13 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 227 place count 13 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 229 place count 12 transition count 20
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 12 transition count 15
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 236 place count 12 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 238 place count 10 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 238 place count 10 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 242 place count 8 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 243 place count 8 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 243 place count 8 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 245 place count 7 transition count 9
Applied a total of 245 rules in 6 ms. Remains 7 /193 variables (removed 186) and now considering 9/175 (removed 166) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 7/193 places, 9/175 transitions.
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 0 ms
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 0 ms
[2023-03-22 01:13:29] [INFO ] Input system was already deterministic with 9 transitions.
Finished random walk after 36 steps, including 11 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
FORMULA IBM319-PT-none-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 175/175 transitions.
Graph (complete) has 240 edges and 193 vertex of which 158 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.1 ms
Discarding 35 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Ensure Unique test removed 23 places
Reduce places removed 24 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 134 transition count 61
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 91 rules applied. Total rules applied 178 place count 49 transition count 55
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 8 rules applied. Total rules applied 186 place count 45 transition count 51
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 191 place count 41 transition count 50
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 191 place count 41 transition count 36
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 4 with 30 rules applied. Total rules applied 221 place count 25 transition count 36
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 223 place count 24 transition count 35
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 226 place count 23 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 227 place count 22 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 227 place count 22 transition count 32
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 229 place count 21 transition count 32
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 235 place count 21 transition count 26
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 236 place count 21 transition count 25
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 238 place count 20 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 239 place count 19 transition count 24
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 3 Pre rules applied. Total rules applied 239 place count 19 transition count 21
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 245 place count 16 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 246 place count 16 transition count 20
Applied a total of 246 rules in 8 ms. Remains 16 /193 variables (removed 177) and now considering 20/175 (removed 155) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 16/193 places, 20/175 transitions.
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 1 ms
[2023-03-22 01:13:29] [INFO ] Input system was already deterministic with 20 transitions.
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:13:29] [INFO ] Flatten gal took : 7 ms
[2023-03-22 01:13:29] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-22 01:13:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 193 places, 175 transitions and 415 arcs took 2 ms.
Total runtime 4283 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: Petri
(NrP: 193 NrTr: 175 NrArc: 415)

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

net check time: 0m 0.000sec

init dd package: 0m 2.766sec


RS generation: 0m 0.026sec


-> reachability set: #nodes 763 (7.6e+02) #states 2,470 (3)



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

checking: EX [0<=0]
normalized: EX [0<=0]

abstracting: (0<=0)
states: 2,470 (3)
.-> the formula is TRUE

FORMULA IBM319-PT-none-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

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

abstracting: (1<=p34)
states: 150
abstracting: (p34<=1)
states: 2,470 (3)
-> the formula is FALSE

FORMULA IBM319-PT-none-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

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

abstracting: (1<=p5)
states: 150
abstracting: (p5<=1)
states: 2,470 (3)
...
EG iterations: 2
.-> the formula is FALSE

FORMULA IBM319-PT-none-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: AX [EG [[p4<=0 & 0<=p4]]]
normalized: ~ [EX [~ [EG [[p4<=0 & 0<=p4]]]]]

abstracting: (0<=p4)
states: 2,470 (3)
abstracting: (p4<=0)
states: 2,425 (3)
...............
EG iterations: 15
.-> the formula is TRUE

FORMULA IBM319-PT-none-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.089sec

checking: EX [EF [EX [EG [[[p106<=1 & 1<=p106] & [p120<=1 & 1<=p120]]]]]]
normalized: EX [E [true U EX [EG [[[p120<=1 & 1<=p120] & [p106<=1 & 1<=p106]]]]]]

abstracting: (1<=p106)
states: 3
abstracting: (p106<=1)
states: 2,470 (3)
abstracting: (1<=p120)
states: 3
abstracting: (p120<=1)
states: 2,470 (3)
...
EG iterations: 3
..-> the formula is FALSE

FORMULA IBM319-PT-none-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

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

abstracting: (0<=p44)
states: 2,470 (3)
abstracting: (p44<=0)
states: 2,467 (3)
.abstracting: (1<=p55)
states: 150
abstracting: (p55<=1)
states: 2,470 (3)
...............
EG iterations: 15
-> the formula is FALSE

FORMULA IBM319-PT-none-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.053sec

checking: EG [[[p25<=0 & 0<=p25] | [[p180<=0 & 0<=p180] | [[p69<=1 & 1<=p69] & [p165<=1 & 1<=p165]]]]]
normalized: EG [[[[[p165<=1 & 1<=p165] & [p69<=1 & 1<=p69]] | [p180<=0 & 0<=p180]] | [p25<=0 & 0<=p25]]]

abstracting: (0<=p25)
states: 2,470 (3)
abstracting: (p25<=0)
states: 2,467 (3)
abstracting: (0<=p180)
states: 2,470 (3)
abstracting: (p180<=0)
states: 2,467 (3)
abstracting: (1<=p69)
states: 3
abstracting: (p69<=1)
states: 2,470 (3)
abstracting: (1<=p165)
states: 3
abstracting: (p165<=1)
states: 2,470 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA IBM319-PT-none-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EG [[[p88<=1 & 1<=p88] | EX [[[[p64<=0 & 0<=p64] | [p171<=0 & 0<=p171]] & [p53<=0 & 0<=p53]]]]]
normalized: EG [[EX [[[p53<=0 & 0<=p53] & [[p171<=0 & 0<=p171] | [p64<=0 & 0<=p64]]]] | [p88<=1 & 1<=p88]]]

abstracting: (1<=p88)
states: 45
abstracting: (p88<=1)
states: 2,470 (3)
abstracting: (0<=p64)
states: 2,470 (3)
abstracting: (p64<=0)
states: 2,320 (3)
abstracting: (0<=p171)
states: 2,470 (3)
abstracting: (p171<=0)
states: 2,320 (3)
abstracting: (0<=p53)
states: 2,470 (3)
abstracting: (p53<=0)
states: 2,425 (3)
..................................................................................................................................
EG iterations: 129
-> the formula is FALSE

FORMULA IBM319-PT-none-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.835sec

checking: AF [[EF [~ [A [[p22<=1 & 1<=p22] U [[p114<=1 & 1<=p114] & [p131<=1 & 1<=p131]]]]] & [[p16<=1 & 1<=p16] & [p183<=1 & 1<=p183]]]]
normalized: ~ [EG [~ [[[[p183<=1 & 1<=p183] & [p16<=1 & 1<=p16]] & E [true U ~ [[~ [E [~ [[[p131<=1 & 1<=p131] & [p114<=1 & 1<=p114]]] U [~ [[p22<=1 & 1<=p22]] & ~ [[[p131<=1 & 1<=p131] & [p114<=1 & 1<=p114]]]]]] & ~ [EG [~ [[[p131<=1 & 1<=p131] & [p114<=1 & 1<=p114]]]]]]]]]]]]

abstracting: (1<=p114)
states: 3
abstracting: (p114<=1)
states: 2,470 (3)
abstracting: (1<=p131)
states: 3
abstracting: (p131<=1)
states: 2,470 (3)
....
EG iterations: 4
abstracting: (1<=p114)
states: 3
abstracting: (p114<=1)
states: 2,470 (3)
abstracting: (1<=p131)
states: 3
abstracting: (p131<=1)
states: 2,470 (3)
abstracting: (1<=p22)
states: 3
abstracting: (p22<=1)
states: 2,470 (3)
abstracting: (1<=p114)
states: 3
abstracting: (p114<=1)
states: 2,470 (3)
abstracting: (1<=p131)
states: 3
abstracting: (p131<=1)
states: 2,470 (3)
abstracting: (1<=p16)
states: 150
abstracting: (p16<=1)
states: 2,470 (3)
abstracting: (1<=p183)
states: 150
abstracting: (p183<=1)
states: 2,470 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA IBM319-PT-none-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

checking: AG [[AF [[AG [[p192<=1 & 1<=p192]] | [[p112<=0 & 0<=p112] | [p136<=0 & 0<=p136]]]] | EG [E [[p36<=1 & 1<=p36] U [p28<=1 & 1<=p28]]]]]
normalized: ~ [E [true U ~ [[EG [E [[p36<=1 & 1<=p36] U [p28<=1 & 1<=p28]]] | ~ [EG [~ [[[[p136<=0 & 0<=p136] | [p112<=0 & 0<=p112]] | ~ [E [true U ~ [[p192<=1 & 1<=p192]]]]]]]]]]]]

abstracting: (1<=p192)
states: 3
abstracting: (p192<=1)
states: 2,470 (3)
abstracting: (0<=p112)
states: 2,470 (3)
abstracting: (p112<=0)
states: 2,467 (3)
abstracting: (0<=p136)
states: 2,470 (3)
abstracting: (p136<=0)
states: 2,467 (3)
...
EG iterations: 3
abstracting: (1<=p28)
states: 3
abstracting: (p28<=1)
states: 2,470 (3)
abstracting: (1<=p36)
states: 3
abstracting: (p36<=1)
states: 2,470 (3)
...
EG iterations: 3
-> the formula is TRUE

FORMULA IBM319-PT-none-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: EG [[[~ [E [[[p58<=1 & 1<=p58] & [p177<=1 & 1<=p177]] U [[p111<=1 & 1<=p111] & [p128<=1 & 1<=p128]]]] | ~ [[p103<=1 & 1<=p103]]] | [~ [[p123<=1 & 1<=p123]] | [[p80<=1 & 1<=p80] & [p157<=1 & 1<=p157]]]]]
normalized: EG [[[[[p157<=1 & 1<=p157] & [p80<=1 & 1<=p80]] | ~ [[p123<=1 & 1<=p123]]] | [~ [[p103<=1 & 1<=p103]] | ~ [E [[[p177<=1 & 1<=p177] & [p58<=1 & 1<=p58]] U [[p128<=1 & 1<=p128] & [p111<=1 & 1<=p111]]]]]]]

abstracting: (1<=p111)
states: 3
abstracting: (p111<=1)
states: 2,470 (3)
abstracting: (1<=p128)
states: 3
abstracting: (p128<=1)
states: 2,470 (3)
abstracting: (1<=p58)
states: 150
abstracting: (p58<=1)
states: 2,470 (3)
abstracting: (1<=p177)
states: 150
abstracting: (p177<=1)
states: 2,470 (3)
abstracting: (1<=p103)
states: 2
abstracting: (p103<=1)
states: 2,470 (3)
abstracting: (1<=p123)
states: 2
abstracting: (p123<=1)
states: 2,470 (3)
abstracting: (1<=p80)
states: 3
abstracting: (p80<=1)
states: 2,470 (3)
abstracting: (1<=p157)
states: 3
abstracting: (p157<=1)
states: 2,470 (3)

EG iterations: 0
-> the formula is TRUE

FORMULA IBM319-PT-none-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: A [EF [~ [E [[E [[p1<=1 & 1<=p1] U [[p72<=1 & 1<=p72] & [p160<=1 & 1<=p160]]] & AX [[[p83<=1 & 1<=p83] & [p150<=1 & 1<=p150]]]] U AF [[p22<=1 & 1<=p22]]]]] U [[p78<=1 & 1<=p78] & [p158<=1 & 1<=p158]]]
normalized: [~ [EG [~ [[[p158<=1 & 1<=p158] & [p78<=1 & 1<=p78]]]]] & ~ [E [~ [[[p158<=1 & 1<=p158] & [p78<=1 & 1<=p78]]] U [~ [E [true U ~ [E [[~ [EX [~ [[[p150<=1 & 1<=p150] & [p83<=1 & 1<=p83]]]]] & E [[p1<=1 & 1<=p1] U [[p160<=1 & 1<=p160] & [p72<=1 & 1<=p72]]]] U ~ [EG [~ [[p22<=1 & 1<=p22]]]]]]]] & ~ [[[p158<=1 & 1<=p158] & [p78<=1 & 1<=p78]]]]]]]

abstracting: (1<=p78)
states: 3
abstracting: (p78<=1)
states: 2,470 (3)
abstracting: (1<=p158)
states: 3
abstracting: (p158<=1)
states: 2,470 (3)
abstracting: (1<=p22)
states: 3
abstracting: (p22<=1)
states: 2,470 (3)
...............
EG iterations: 15
abstracting: (1<=p72)
states: 3
abstracting: (p72<=1)
states: 2,470 (3)
abstracting: (1<=p160)
states: 3
abstracting: (p160<=1)
states: 2,470 (3)
abstracting: (1<=p1)
states: 45
abstracting: (p1<=1)
states: 2,470 (3)
abstracting: (1<=p83)
states: 3
abstracting: (p83<=1)
states: 2,470 (3)
abstracting: (1<=p150)
states: 3
abstracting: (p150<=1)
states: 2,470 (3)
.abstracting: (1<=p78)
states: 3
abstracting: (p78<=1)
states: 2,470 (3)
abstracting: (1<=p158)
states: 3
abstracting: (p158<=1)
states: 2,470 (3)
abstracting: (1<=p78)
states: 3
abstracting: (p78<=1)
states: 2,470 (3)
abstracting: (1<=p158)
states: 3
abstracting: (p158<=1)
states: 2,470 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA IBM319-PT-none-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.149sec

checking: [AG [EF [[[p78<=1 & 1<=p78] & [p158<=1 & 1<=p158]]]] & A [EF [[[EF [[p90<=1 & 1<=p90]] | [[p40<=1 & 1<=p40] | ~ [[p43<=1 & 1<=p43]]]] & [A [[p9<=1 & 1<=p9] U [[p60<=1 & 1<=p60] & [p176<=1 & 1<=p176]]] | [[p20<=1 & 1<=p20] | [[p21<=1 & 1<=p21] & [p34<=1 & 1<=p34]]]]]] U [[p104<=1 & 1<=p104] & [p121<=1 & 1<=p121]]]]
normalized: [[~ [EG [~ [[[p121<=1 & 1<=p121] & [p104<=1 & 1<=p104]]]]] & ~ [E [~ [[[p121<=1 & 1<=p121] & [p104<=1 & 1<=p104]]] U [~ [E [true U [[[[[p34<=1 & 1<=p34] & [p21<=1 & 1<=p21]] | [p20<=1 & 1<=p20]] | [~ [EG [~ [[[p176<=1 & 1<=p176] & [p60<=1 & 1<=p60]]]]] & ~ [E [~ [[[p176<=1 & 1<=p176] & [p60<=1 & 1<=p60]]] U [~ [[p9<=1 & 1<=p9]] & ~ [[[p176<=1 & 1<=p176] & [p60<=1 & 1<=p60]]]]]]]] & [[~ [[p43<=1 & 1<=p43]] | [p40<=1 & 1<=p40]] | E [true U [p90<=1 & 1<=p90]]]]]] & ~ [[[p121<=1 & 1<=p121] & [p104<=1 & 1<=p104]]]]]]] & ~ [E [true U ~ [E [true U [[p158<=1 & 1<=p158] & [p78<=1 & 1<=p78]]]]]]]

abstracting: (1<=p78)
states: 3
abstracting: (p78<=1)
states: 2,470 (3)
abstracting: (1<=p158)
states: 3
abstracting: (p158<=1)
states: 2,470 (3)
abstracting: (1<=p104)
states: 3
abstracting: (p104<=1)
states: 2,470 (3)
abstracting: (1<=p121)
states: 3
abstracting: (p121<=1)
states: 2,470 (3)
abstracting: (1<=p90)
states: 300
abstracting: (p90<=1)
states: 2,470 (3)
abstracting: (1<=p40)
states: 45
abstracting: (p40<=1)
states: 2,470 (3)
abstracting: (1<=p43)
states: 3
abstracting: (p43<=1)
states: 2,470 (3)
abstracting: (1<=p60)
states: 150
abstracting: (p60<=1)
states: 2,470 (3)
abstracting: (1<=p176)
states: 150
abstracting: (p176<=1)
states: 2,470 (3)
abstracting: (1<=p9)
states: 3
abstracting: (p9<=1)
states: 2,470 (3)
abstracting: (1<=p60)
states: 150
abstracting: (p60<=1)
states: 2,470 (3)
abstracting: (1<=p176)
states: 150
abstracting: (p176<=1)
states: 2,470 (3)
abstracting: (1<=p60)
states: 150
abstracting: (p60<=1)
states: 2,470 (3)
abstracting: (1<=p176)
states: 150
abstracting: (p176<=1)
states: 2,470 (3)
................................
EG iterations: 32
abstracting: (1<=p20)
states: 3
abstracting: (p20<=1)
states: 2,470 (3)
abstracting: (1<=p21)
states: 1
abstracting: (p21<=1)
states: 2,470 (3)
abstracting: (1<=p34)
states: 150
abstracting: (p34<=1)
states: 2,470 (3)
abstracting: (1<=p104)
states: 3
abstracting: (p104<=1)
states: 2,470 (3)
abstracting: (1<=p121)
states: 3
abstracting: (p121<=1)
states: 2,470 (3)
abstracting: (1<=p104)
states: 3
abstracting: (p104<=1)
states: 2,470 (3)
abstracting: (1<=p121)
states: 3
abstracting: (p121<=1)
states: 2,470 (3)
...........
EG iterations: 11
-> the formula is FALSE

FORMULA IBM319-PT-none-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.362sec

totally nodes used: 1804637 (1.8e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1391898 4362635 5754533
used/not used/entry size/cache size: 6109556 60999308 16 1024MB
basic ops cache: hits/miss/sum: 36402 285714 322116
used/not used/entry size/cache size: 527192 16250024 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: 1070 5355 6425
used/not used/entry size/cache size: 5354 8383254 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 65468293
1 1499066
2 121469
3 17626
4 2298
5 110
6 1
7 1
8 0
9 0
>= 10 0

Total processing time: 0m 6.220sec


BK_STOP 1679447617024

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:1231 (7), effective:156 (0)

initing FirstDep: 0m 0.000sec


iterations count:274 (1), effective:41 (0)

iterations count:276 (1), effective:42 (0)

iterations count:860 (4), effective:176 (1)

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

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

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

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

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

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

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

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

iterations count:230 (1), effective:22 (0)

iterations count:232 (1), effective:23 (0)

iterations count:272 (1), effective:41 (0)

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

iterations count:437 (2), effective:78 (0)

iterations count:431 (2), effective:80 (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="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is IBM319-PT-none, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856419800074"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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