Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813696100697.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is CANInsertWithFailure-PT-005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696100697
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 8.7K Feb 26 00:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 00:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 00:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 00:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 00:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 26 00:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 00:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 00:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 202K 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 CANInsertWithFailure-PT-005-CTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678742903653

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=CANInsertWithFailure-PT-005
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 21:28:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 21:28:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 21:28:25] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2023-03-13 21:28:25] [INFO ] Transformed 114 places.
[2023-03-13 21:28:25] [INFO ] Transformed 180 transitions.
[2023-03-13 21:28:25] [INFO ] Parsed PT model containing 114 places and 180 transitions and 500 arcs in 108 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Support contains 80 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Applied a total of 0 rules in 12 ms. Remains 114 /114 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 114 cols
[2023-03-13 21:28:25] [INFO ] Computed 8 place invariants in 13 ms
[2023-03-13 21:28:25] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-13 21:28:25] [INFO ] Invariant cache hit.
[2023-03-13 21:28:25] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-13 21:28:25] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2023-03-13 21:28:25] [INFO ] Invariant cache hit.
[2023-03-13 21:28:26] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 420 ms. Remains : 114/114 places, 180/180 transitions.
Support contains 80 out of 114 places after structural reductions.
[2023-03-13 21:28:26] [INFO ] Flatten gal took : 29 ms
[2023-03-13 21:28:26] [INFO ] Flatten gal took : 12 ms
[2023-03-13 21:28:26] [INFO ] Input system was already deterministic with 180 transitions.
Support contains 79 out of 114 places (down from 80) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 108 resets, run finished after 480 ms. (steps per millisecond=20 ) properties (out of 83) seen :71
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-13 21:28:27] [INFO ] Invariant cache hit.
[2023-03-13 21:28:27] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-13 21:28:27] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-13 21:28:27] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:11
[2023-03-13 21:28:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-13 21:28:27] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 21:28:27] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :7
[2023-03-13 21:28:27] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-13 21:28:27] [INFO ] After 51ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :6 sat :6
[2023-03-13 21:28:27] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :6
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-13 21:28:27] [INFO ] After 320ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :6
Fused 12 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 11 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 180/180 transitions.
Graph (complete) has 276 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 113 transition count 147
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 80 transition count 147
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 95 place count 66 transition count 133
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 102 place count 66 transition count 126
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 105 place count 66 transition count 123
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 108 place count 63 transition count 123
Partial Free-agglomeration rule applied 33 times.
Drop transitions removed 33 transitions
Iterating global reduction 3 with 33 rules applied. Total rules applied 141 place count 63 transition count 123
Applied a total of 141 rules in 23 ms. Remains 63 /114 variables (removed 51) and now considering 123/180 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 63/114 places, 123/180 transitions.
Incomplete random walk after 10000 steps, including 287 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 57 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Probably explored full state space saw : 14421 states, properties seen :0
Probabilistic random walk after 81291 steps, saw 14421 distinct states, run finished after 341 ms. (steps per millisecond=238 ) properties seen :0
Explored full state space saw : 14421 states, properties seen :0
Exhaustive walk after 81291 steps, saw 14421 distinct states, run finished after 303 ms. (steps per millisecond=268 ) properties seen :0
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
FORMULA CANInsertWithFailure-PT-005-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-005-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 21:28:28] [INFO ] Flatten gal took : 8 ms
[2023-03-13 21:28:28] [INFO ] Flatten gal took : 7 ms
[2023-03-13 21:28:28] [INFO ] Input system was already deterministic with 180 transitions.
Computed a total of 23 stabilizing places and 35 stable transitions
Graph (complete) has 327 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 2 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 113/114 places, 180/180 transitions.
[2023-03-13 21:28:28] [INFO ] Flatten gal took : 8 ms
[2023-03-13 21:28:28] [INFO ] Flatten gal took : 8 ms
[2023-03-13 21:28:28] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 3 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 113/114 places, 180/180 transitions.
[2023-03-13 21:28:28] [INFO ] Flatten gal took : 7 ms
[2023-03-13 21:28:28] [INFO ] Flatten gal took : 7 ms
[2023-03-13 21:28:28] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Graph (complete) has 327 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 113 transition count 156
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 89 transition count 154
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 87 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 53 place count 87 transition count 153
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 86 transition count 153
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 61 place count 83 transition count 150
Partial Post-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 75 place count 83 transition count 150
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 81 place count 77 transition count 144
Iterating global reduction 3 with 6 rules applied. Total rules applied 87 place count 77 transition count 144
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 77 transition count 141
Applied a total of 90 rules in 21 ms. Remains 77 /114 variables (removed 37) and now considering 141/180 (removed 39) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 77/114 places, 141/180 transitions.
[2023-03-13 21:28:29] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:28:29] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:28:29] [INFO ] Input system was already deterministic with 141 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 2 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 113/114 places, 180/180 transitions.
[2023-03-13 21:28:29] [INFO ] Flatten gal took : 6 ms
[2023-03-13 21:28:29] [INFO ] Flatten gal took : 6 ms
[2023-03-13 21:28:29] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 2 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 113/114 places, 180/180 transitions.
[2023-03-13 21:28:29] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:28:29] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:28:29] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 2 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 113/114 places, 180/180 transitions.
[2023-03-13 21:28:29] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:28:29] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:28:29] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 2 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 113/114 places, 180/180 transitions.
[2023-03-13 21:28:29] [INFO ] Flatten gal took : 6 ms
[2023-03-13 21:28:29] [INFO ] Flatten gal took : 6 ms
[2023-03-13 21:28:29] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Graph (complete) has 327 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 113 transition count 148
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 81 transition count 148
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 65 place count 81 transition count 146
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 79 transition count 146
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 75 place count 76 transition count 143
Partial Post-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 83 place count 76 transition count 143
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 86 place count 73 transition count 140
Iterating global reduction 2 with 3 rules applied. Total rules applied 89 place count 73 transition count 140
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 73 transition count 137
Applied a total of 92 rules in 16 ms. Remains 73 /114 variables (removed 41) and now considering 137/180 (removed 43) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 73/114 places, 137/180 transitions.
[2023-03-13 21:28:29] [INFO ] Flatten gal took : 4 ms
[2023-03-13 21:28:29] [INFO ] Flatten gal took : 4 ms
[2023-03-13 21:28:29] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 1 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 113/114 places, 180/180 transitions.
[2023-03-13 21:28:29] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:28:29] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:28:29] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 114 /114 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 114/114 places, 180/180 transitions.
[2023-03-13 21:28:29] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:28:29] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:28:29] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 1 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 113/114 places, 180/180 transitions.
[2023-03-13 21:28:29] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:28:29] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:28:29] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Graph (complete) has 327 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 113 transition count 149
Reduce places removed 31 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 82 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 80 transition count 147
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 77 place count 75 transition count 142
Partial Post-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 91 place count 75 transition count 142
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 97 place count 69 transition count 136
Iterating global reduction 3 with 6 rules applied. Total rules applied 103 place count 69 transition count 136
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 106 place count 69 transition count 133
Applied a total of 106 rules in 14 ms. Remains 69 /114 variables (removed 45) and now considering 133/180 (removed 47) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 69/114 places, 133/180 transitions.
[2023-03-13 21:28:29] [INFO ] Flatten gal took : 3 ms
[2023-03-13 21:28:29] [INFO ] Flatten gal took : 3 ms
[2023-03-13 21:28:29] [INFO ] Input system was already deterministic with 133 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 1 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 113/114 places, 180/180 transitions.
[2023-03-13 21:28:29] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:28:29] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:28:29] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 1 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 113/114 places, 180/180 transitions.
[2023-03-13 21:28:29] [INFO ] Flatten gal took : 4 ms
[2023-03-13 21:28:29] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:28:29] [INFO ] Input system was already deterministic with 180 transitions.
[2023-03-13 21:28:29] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:28:29] [INFO ] Flatten gal took : 6 ms
[2023-03-13 21:28:29] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-13 21:28:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 114 places, 180 transitions and 500 arcs took 2 ms.
Total runtime 3965 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: 114 NrTr: 180 NrArc: 500)

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

net check time: 0m 0.000sec

init dd package: 0m 3.632sec


RS generation: 0m 1.682sec


-> reachability set: #nodes 22576 (2.3e+04) #states 200,157 (5)



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

checking: EX [EG [EX [p12<=p25]]]
normalized: EX [EG [EX [p12<=p25]]]

abstracting: (p12<=p25)
states: 188,504 (5)
..........
EG iterations: 9
.-> the formula is TRUE

FORMULA CANInsertWithFailure-PT-005-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.092sec

checking: EG [[EF [EG [1<=p44]] | 1<=p20]]
normalized: EG [[1<=p20 | E [true U EG [1<=p44]]]]

abstracting: (1<=p44)
states: 22,128 (4)
.....
EG iterations: 5
abstracting: (1<=p20)
states: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA CANInsertWithFailure-PT-005-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.766sec

checking: EF [AX [[EG [1<=p48] & [1<=p53 & p18<=1]]]]
normalized: E [true U ~ [EX [~ [[[1<=p53 & p18<=1] & EG [1<=p48]]]]]]

abstracting: (1<=p48)
states: 1
..
EG iterations: 2
abstracting: (p18<=1)
states: 200,157 (5)
abstracting: (1<=p53)
states: 10,784 (4)
.-> the formula is TRUE

FORMULA CANInsertWithFailure-PT-005-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.737sec

checking: AG [[~ [p13<=p41] | EF [EG [p36<=p43]]]]
normalized: ~ [E [true U ~ [[E [true U EG [p36<=p43]] | ~ [p13<=p41]]]]]

abstracting: (p13<=p41)
states: 188,504 (5)
abstracting: (p36<=p43)
states: 156,744 (5)
.....
EG iterations: 5
-> the formula is FALSE

FORMULA CANInsertWithFailure-PT-005-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.269sec

checking: [EG [~ [p2<=p3]] | AG [EX [A [EG [p15<=p32] U 1<=p60]]]]
normalized: [~ [E [true U ~ [EX [[~ [EG [~ [1<=p60]]] & ~ [E [~ [1<=p60] U [~ [EG [p15<=p32]] & ~ [1<=p60]]]]]]]]] | EG [~ [p2<=p3]]]

abstracting: (p2<=p3)
states: 128,327 (5)
.
EG iterations: 1
abstracting: (1<=p60)
states: 8,342 (3)
abstracting: (p15<=p32)
states: 188,504 (5)
.
EG iterations: 1
abstracting: (1<=p60)
states: 8,342 (3)
abstracting: (1<=p60)
states: 8,342 (3)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA CANInsertWithFailure-PT-005-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.771sec

checking: AF [[EG [[EX [~ [1<=p19]] & [~ [p79<=0] & AG [~ [p26<=p20]]]]] & AG [~ [p98<=p49]]]]
normalized: ~ [EG [~ [[~ [E [true U p98<=p49]] & EG [[[~ [E [true U p26<=p20]] & ~ [p79<=0]] & EX [~ [1<=p19]]]]]]]]

abstracting: (1<=p19)
states: 1
.abstracting: (p79<=0)
states: 197,441 (5)
abstracting: (p26<=p20)
states: 187,732 (5)
.
EG iterations: 1
abstracting: (p98<=p49)
states: 197,441 (5)

EG iterations: 0
-> the formula is FALSE

FORMULA CANInsertWithFailure-PT-005-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.139sec

checking: A [~ [[p102<=p1 | EX [p26<=p61]]] U EG [E [1<=p87 U p38<=p14]]]
normalized: [~ [EG [~ [EG [E [1<=p87 U p38<=p14]]]]] & ~ [E [~ [EG [E [1<=p87 U p38<=p14]]] U [[p102<=p1 | EX [p26<=p61]] & ~ [EG [E [1<=p87 U p38<=p14]]]]]]]

abstracting: (p38<=p14)
states: 192,630 (5)
abstracting: (1<=p87)
states: 2,716 (3)
.......
EG iterations: 7
abstracting: (p26<=p61)
states: 187,732 (5)
.abstracting: (p102<=p1)
states: 199,691 (5)
abstracting: (p38<=p14)
states: 192,630 (5)
abstracting: (1<=p87)
states: 2,716 (3)
.......
EG iterations: 7
abstracting: (p38<=p14)
states: 192,630 (5)
abstracting: (1<=p87)
states: 2,716 (3)
.......
EG iterations: 7
........
EG iterations: 8
-> the formula is TRUE

FORMULA CANInsertWithFailure-PT-005-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.206sec

checking: AX [AX [[E [[p44<=p14 | p22<=p90] U EG [p47<=0]] & p31<=p4]]]
normalized: ~ [EX [EX [~ [[p31<=p4 & E [[p44<=p14 | p22<=p90] U EG [p47<=0]]]]]]]

abstracting: (p47<=0)
states: 200,156 (5)
.
EG iterations: 1
abstracting: (p22<=p90)
states: 157,037 (5)
abstracting: (p44<=p14)
states: 188,011 (5)
abstracting: (p31<=p4)
states: 188,504 (5)
..-> the formula is TRUE

FORMULA CANInsertWithFailure-PT-005-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.661sec

checking: EG [~ [A [[~ [p79<=1] | [1<=p104 & p98<=p97]] U [[1<=p59 & 1<=p40] | AX [1<=p110]]]]]
normalized: EG [~ [[~ [EG [~ [[~ [EX [~ [1<=p110]]] | [1<=p59 & 1<=p40]]]]] & ~ [E [~ [[~ [EX [~ [1<=p110]]] | [1<=p59 & 1<=p40]]] U [~ [[[1<=p104 & p98<=p97] | ~ [p79<=1]]] & ~ [[~ [EX [~ [1<=p110]]] | [1<=p59 & 1<=p40]]]]]]]]]

abstracting: (1<=p40)
states: 12,425 (4)
abstracting: (1<=p59)
states: 10,784 (4)
abstracting: (1<=p110)
states: 2,716 (3)
.abstracting: (p79<=1)
states: 200,157 (5)
abstracting: (p98<=p97)
states: 197,457 (5)
abstracting: (1<=p104)
states: 4,910 (3)
abstracting: (1<=p40)
states: 12,425 (4)
abstracting: (1<=p59)
states: 10,784 (4)
abstracting: (1<=p110)
states: 2,716 (3)
.abstracting: (1<=p40)
states: 12,425 (4)
abstracting: (1<=p59)
states: 10,784 (4)
abstracting: (1<=p110)
states: 2,716 (3)
..........
EG iterations: 9
.........
EG iterations: 9
-> the formula is TRUE

FORMULA CANInsertWithFailure-PT-005-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.674sec

checking: EG [A [EF [~ [EX [p64<=p30]]] U ~ [[[A [1<=p106 U p4<=p13] & EF [p0<=p111]] | [EF [p38<=0] | p49<=p6]]]]]
normalized: EG [[~ [EG [[[[~ [EG [~ [p4<=p13]]] & ~ [E [~ [p4<=p13] U [~ [1<=p106] & ~ [p4<=p13]]]]] & E [true U p0<=p111]] | [p49<=p6 | E [true U p38<=0]]]]] & ~ [E [[[[~ [EG [~ [p4<=p13]]] & ~ [E [~ [p4<=p13] U [~ [1<=p106] & ~ [p4<=p13]]]]] & E [true U p0<=p111]] | [p49<=p6 | E [true U p38<=0]]] U [[[[~ [EG [~ [p4<=p13]]] & ~ [E [~ [p4<=p13] U [~ [1<=p106] & ~ [p4<=p13]]]]] & E [true U p0<=p111]] | [p49<=p6 | E [true U p38<=0]]] & ~ [E [true U ~ [EX [p64<=p30]]]]]]]]]

abstracting: (p64<=p30)
states: 136,490 (5)
.abstracting: (p38<=0)
states: 187,732 (5)
abstracting: (p49<=p6)
states: 200,156 (5)
abstracting: (p0<=p111)
states: 3,328 (3)
abstracting: (p4<=p13)
states: 187,720 (5)
abstracting: (1<=p106)
states: 2,716 (3)
abstracting: (p4<=p13)
states: 187,720 (5)
abstracting: (p4<=p13)
states: 187,720 (5)
.....
EG iterations: 5
abstracting: (p38<=0)
states: 187,732 (5)
abstracting: (p49<=p6)
states: 200,156 (5)
abstracting: (p0<=p111)
states: 3,328 (3)
abstracting: (p4<=p13)
states: 187,720 (5)
abstracting: (1<=p106)
states: 2,716 (3)
abstracting: (p4<=p13)
states: 187,720 (5)
abstracting: (p4<=p13)
states: 187,720 (5)
.....
EG iterations: 5
abstracting: (p38<=0)
states: 187,732 (5)
abstracting: (p49<=p6)
states: 200,156 (5)
abstracting: (p0<=p111)
states: 3,328 (3)
abstracting: (p4<=p13)
states: 187,720 (5)
abstracting: (1<=p106)
states: 2,716 (3)
abstracting: (p4<=p13)
states: 187,720 (5)
abstracting: (p4<=p13)
states: 187,720 (5)
.....
EG iterations: 5

EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA CANInsertWithFailure-PT-005-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.752sec

checking: AG [A [[p87<=p106 | [~ [AF [1<=p67]] & p51<=p99]] U [EX [A [p99<=p59 U p72<=p55]] | [p24<=p15 | 1<=p22]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[[p24<=p15 | 1<=p22] | EX [[~ [EG [~ [p72<=p55]]] & ~ [E [~ [p72<=p55] U [~ [p99<=p59] & ~ [p72<=p55]]]]]]]]]] & ~ [E [~ [[[p24<=p15 | 1<=p22] | EX [[~ [EG [~ [p72<=p55]]] & ~ [E [~ [p72<=p55] U [~ [p99<=p59] & ~ [p72<=p55]]]]]]]] U [~ [[p87<=p106 | [p51<=p99 & EG [~ [1<=p67]]]]] & ~ [[[p24<=p15 | 1<=p22] | EX [[~ [EG [~ [p72<=p55]]] & ~ [E [~ [p72<=p55] U [~ [p99<=p59] & ~ [p72<=p55]]]]]]]]]]]]]]]

abstracting: (p72<=p55)
states: 175,812 (5)
abstracting: (p99<=p59)
states: 195,627 (5)
abstracting: (p72<=p55)
states: 175,812 (5)
abstracting: (p72<=p55)
states: 175,812 (5)
...........
EG iterations: 11
.abstracting: (1<=p22)
states: 43,413 (4)
abstracting: (p24<=p15)
states: 188,504 (5)
abstracting: (1<=p67)
states: 10,784 (4)
........
EG iterations: 8
abstracting: (p51<=p99)
states: 189,373 (5)
abstracting: (p87<=p106)
states: 197,457 (5)
abstracting: (p72<=p55)
states: 175,812 (5)
abstracting: (p99<=p59)
states: 195,627 (5)
abstracting: (p72<=p55)
states: 175,812 (5)
abstracting: (p72<=p55)
states: 175,812 (5)
...........
EG iterations: 11
.abstracting: (1<=p22)
states: 43,413 (4)
abstracting: (p24<=p15)
states: 188,504 (5)
abstracting: (p72<=p55)
states: 175,812 (5)
abstracting: (p99<=p59)
states: 195,627 (5)
abstracting: (p72<=p55)
states: 175,812 (5)
abstracting: (p72<=p55)
states: 175,812 (5)
...........
EG iterations: 11
.abstracting: (1<=p22)
states: 43,413 (4)
abstracting: (p24<=p15)
states: 188,504 (5)
.........
EG iterations: 9
-> the formula is FALSE

FORMULA CANInsertWithFailure-PT-005-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.332sec

checking: A [E [[EF [~ [EF [1<=p92]]] & p30<=1] U AG [[1<=p53 | ~ [[1<=p74 | p50<=p40]]]]] U AF [[[~ [AF [p76<=p8]] & AG [1<=p51]] & [p71<=p55 & p54<=p47]]]]
normalized: [~ [EG [EG [~ [[[p71<=p55 & p54<=p47] & [~ [E [true U ~ [1<=p51]]] & EG [~ [p76<=p8]]]]]]]] & ~ [E [EG [~ [[[p71<=p55 & p54<=p47] & [~ [E [true U ~ [1<=p51]]] & EG [~ [p76<=p8]]]]]] U [~ [E [[p30<=1 & E [true U ~ [E [true U 1<=p92]]]] U ~ [E [true U ~ [[1<=p53 | ~ [[1<=p74 | p50<=p40]]]]]]]] & EG [~ [[[p71<=p55 & p54<=p47] & [~ [E [true U ~ [1<=p51]]] & EG [~ [p76<=p8]]]]]]]]]]

abstracting: (p76<=p8)
states: 197,262 (5)
.....
EG iterations: 5
abstracting: (1<=p51)
states: 10,784 (4)
abstracting: (p54<=p47)
states: 189,373 (5)
abstracting: (p71<=p55)
states: 189,851 (5)

EG iterations: 0
abstracting: (p50<=p40)
states: 138,137 (5)
abstracting: (1<=p74)
states: 2,895 (3)
abstracting: (1<=p53)
states: 10,784 (4)
abstracting: (1<=p92)
states: 2,895 (3)
abstracting: (p30<=1)
states: 199,160 (5)
abstracting: (p76<=p8)
states: 197,262 (5)
.....
EG iterations: 5
abstracting: (1<=p51)
states: 10,784 (4)
abstracting: (p54<=p47)
states: 189,373 (5)
abstracting: (p71<=p55)
states: 189,851 (5)

EG iterations: 0
abstracting: (p76<=p8)
states: 197,262 (5)
.....
EG iterations: 5
abstracting: (1<=p51)
states: 10,784 (4)
abstracting: (p54<=p47)
states: 189,373 (5)
abstracting: (p71<=p55)
states: 189,851 (5)

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA CANInsertWithFailure-PT-005-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.756sec

checking: [[AF [~ [A [~ [1<=p1] U [p100<=1 & p96<=p27]]]] | AF [~ [p31<=p23]]] | [AF [[EX [[1<=p98 & [p35<=1 & [p1<=p90 | p111<=p106]]]] & p25<=0]] | EG [EF [1<=p75]]]]
normalized: [[~ [EG [[~ [EG [~ [[p100<=1 & p96<=p27]]]] & ~ [E [~ [[p100<=1 & p96<=p27]] U [1<=p1 & ~ [[p100<=1 & p96<=p27]]]]]]]] | ~ [EG [p31<=p23]]] | [EG [E [true U 1<=p75]] | ~ [EG [~ [[p25<=0 & EX [[1<=p98 & [p35<=1 & [p1<=p90 | p111<=p106]]]]]]]]]]

abstracting: (p111<=p106)
states: 195,420 (5)
abstracting: (p1<=p90)
states: 74,065 (4)
abstracting: (p35<=1)
states: 200,157 (5)
abstracting: (1<=p98)
states: 2,716 (3)
.abstracting: (p25<=0)
states: 187,732 (5)
..........
EG iterations: 10
abstracting: (1<=p75)
states: 2,895 (3)
.
EG iterations: 1
abstracting: (p31<=p23)
states: 187,732 (5)
.....
EG iterations: 5
abstracting: (p96<=p27)
states: 195,757 (5)
abstracting: (p100<=1)
states: 200,157 (5)
abstracting: (1<=p1)
states: 128,327 (5)
abstracting: (p96<=p27)
states: 195,757 (5)
abstracting: (p100<=1)
states: 200,157 (5)
abstracting: (p96<=p27)
states: 195,757 (5)
abstracting: (p100<=1)
states: 200,157 (5)
...........
EG iterations: 11
.
EG iterations: 1
-> the formula is TRUE

FORMULA CANInsertWithFailure-PT-005-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.633sec

checking: E [[E [[AX [[p53<=0 & 1<=p90]] & ~ [p54<=0]] U EF [~ [[p6<=0 & 1<=p32]]]] & [p77<=0 | [EG [AX [p12<=p27]] | [EG [[p76<=1 & [p45<=p109 & 1<=p112]]] & ~ [1<=p91]]]]] U AG [[[EF [~ [1<=p97]] & 1<=p0] | [EF [[p93<=0 & p97<=1]] & ~ [[p31<=p92 & p17<=1]]]]]]
normalized: E [[[p77<=0 | [[~ [1<=p91] & EG [[p76<=1 & [p45<=p109 & 1<=p112]]]] | EG [~ [EX [~ [p12<=p27]]]]]] & E [[~ [p54<=0] & ~ [EX [~ [[p53<=0 & 1<=p90]]]]] U E [true U ~ [[p6<=0 & 1<=p32]]]]] U ~ [E [true U ~ [[[~ [[p31<=p92 & p17<=1]] & E [true U [p93<=0 & p97<=1]]] | [1<=p0 & E [true U ~ [1<=p97]]]]]]]]

abstracting: (1<=p97)
states: 2,716 (3)
abstracting: (1<=p0)
states: 200,141 (5)
abstracting: (p97<=1)
states: 200,157 (5)
abstracting: (p93<=0)
states: 197,262 (5)
abstracting: (p17<=1)
states: 200,157 (5)
abstracting: (p31<=p92)
states: 187,732 (5)
abstracting: (1<=p32)
states: 12,437 (4)
abstracting: (p6<=0)
states: 200,156 (5)
abstracting: (1<=p90)
states: 2,895 (3)
abstracting: (p53<=0)
states: 189,373 (5)
.abstracting: (p54<=0)
states: 189,373 (5)
abstracting: (p12<=p27)
states: 188,504 (5)
.........
EG iterations: 8
abstracting: (1<=p112)
states: 4,910 (3)
abstracting: (p45<=p109)
states: 188,069 (5)
abstracting: (p76<=1)
states: 200,157 (5)
.............
EG iterations: 13
abstracting: (1<=p91)
states: 2,895 (3)
abstracting: (p77<=0)
states: 197,262 (5)
-> the formula is TRUE

FORMULA CANInsertWithFailure-PT-005-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.870sec

totally nodes used: 16585599 (1.7e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 16107398 54474045 70581443
used/not used/entry size/cache size: 43705747 23403117 16 1024MB
basic ops cache: hits/miss/sum: 2935689 10901001 13836690
used/not used/entry size/cache size: 11128898 5648318 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: 60551 207124 267675
used/not used/entry size/cache size: 204703 8183905 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 53731602
1 10760080
2 2124031
3 413114
4 68054
5 9655
6 1437
7 270
8 197
9 109
>= 10 315

Total processing time: 0m40.466sec


BK_STOP 1678742950082

--------------------
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:18104 (100), effective:508 (2)

initing FirstDep: 0m 0.000sec


iterations count:5972 (33), effective:222 (1)

iterations count:6857 (38), effective:317 (1)

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

iterations count:5013 (27), effective:243 (1)

iterations count:1098 (6), effective:51 (0)

iterations count:439 (2), effective:14 (0)

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

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

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

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

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

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

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

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

iterations count:6999 (38), effective:329 (1)

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

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

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

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

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

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

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

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

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

iterations count:1585 (8), effective:50 (0)

iterations count:1585 (8), effective:50 (0)

iterations count:1585 (8), effective:50 (0)

iterations count:3516 (19), effective:108 (0)

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

iterations count:2193 (12), effective:83 (0)

iterations count:2082 (11), effective:81 (0)

iterations count:2295 (12), effective:108 (0)

iterations count:4608 (25), effective:219 (1)

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

iterations count:5029 (27), effective:201 (1)

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

iterations count:1303 (7), effective:60 (0)

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

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

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

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

iterations count:452 (2), effective:13 (0)

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

iterations count:521 (2), effective:16 (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="CANInsertWithFailure-PT-005"
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 CANInsertWithFailure-PT-005, 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 r042-tajo-167813696100697"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-005.tgz
mv CANInsertWithFailure-PT-005 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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