Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r138-smll-167819420700449.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 DoubleExponent-PT-002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819420700449
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.7K Feb 26 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 13:30 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 3.4K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 26 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 13:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 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 33K 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 DoubleExponent-PT-002-CTLCardinality-00
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-01
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-02
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-03
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-04
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-05
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-06
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-07
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-08
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-09
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-10
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-11
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-12
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-13
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-14
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678840161640

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=DoubleExponent-PT-002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-15 00:29:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 00:29:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 00:29:24] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2023-03-15 00:29:24] [INFO ] Transformed 110 places.
[2023-03-15 00:29:24] [INFO ] Transformed 98 transitions.
[2023-03-15 00:29:24] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
Support contains 82 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Applied a total of 0 rules in 151 ms. Remains 110 /110 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 110 cols
[2023-03-15 00:29:25] [INFO ] Computed 14 place invariants in 18 ms
[2023-03-15 00:29:25] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-15 00:29:25] [INFO ] Invariant cache hit.
[2023-03-15 00:29:25] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
[2023-03-15 00:29:25] [INFO ] Invariant cache hit.
[2023-03-15 00:29:26] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1098 ms. Remains : 110/110 places, 98/98 transitions.
Support contains 82 out of 110 places after structural reductions.
[2023-03-15 00:29:26] [INFO ] Flatten gal took : 65 ms
[2023-03-15 00:29:26] [INFO ] Flatten gal took : 27 ms
[2023-03-15 00:29:26] [INFO ] Input system was already deterministic with 98 transitions.
Support contains 81 out of 110 places (down from 82) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 331 resets, run finished after 1093 ms. (steps per millisecond=9 ) properties (out of 83) seen :34
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 32 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 49) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 49) seen :0
Running SMT prover for 49 properties.
[2023-03-15 00:29:29] [INFO ] Invariant cache hit.
[2023-03-15 00:29:29] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-15 00:29:29] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 8 ms returned sat
[2023-03-15 00:29:29] [INFO ] After 377ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:48
[2023-03-15 00:29:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2023-03-15 00:29:30] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 11 ms returned sat
[2023-03-15 00:29:30] [INFO ] After 312ms SMT Verify possible using state equation in natural domain returned unsat :21 sat :28
[2023-03-15 00:29:30] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 6 ms to minimize.
[2023-03-15 00:29:30] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2023-03-15 00:29:30] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2023-03-15 00:29:30] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2023-03-15 00:29:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 352 ms
[2023-03-15 00:29:31] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2023-03-15 00:29:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-15 00:29:31] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2023-03-15 00:29:31] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2023-03-15 00:29:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2023-03-15 00:29:31] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 2 ms to minimize.
[2023-03-15 00:29:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-15 00:29:31] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2023-03-15 00:29:31] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2023-03-15 00:29:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
[2023-03-15 00:29:31] [INFO ] After 1591ms SMT Verify possible using trap constraints in natural domain returned unsat :22 sat :27
Attempting to minimize the solution found.
Minimization took 262 ms.
[2023-03-15 00:29:32] [INFO ] After 2296ms SMT Verify possible using all constraints in natural domain returned unsat :22 sat :27
Fused 49 Parikh solutions to 24 different solutions.
Parikh walk visited 0 properties in 293 ms.
Support contains 30 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 98/98 transitions.
Graph (complete) has 178 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output 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 0 with 6 rules applied. Total rules applied 7 place count 109 transition count 92
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 103 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 101 transition count 90
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 17 place count 101 transition count 87
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 98 transition count 87
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 47 place count 86 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 51 place count 84 transition count 75
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 56 place count 84 transition count 70
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 61 place count 79 transition count 70
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 66 place count 79 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 67 place count 78 transition count 69
Applied a total of 67 rules in 67 ms. Remains 78 /110 variables (removed 32) and now considering 69/98 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 78/110 places, 69/98 transitions.
Incomplete random walk after 10000 steps, including 658 resets, run finished after 480 ms. (steps per millisecond=20 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 27) seen :23
Running SMT prover for 4 properties.
// Phase 1: matrix 69 rows 78 cols
[2023-03-15 00:29:33] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-15 00:29:33] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 00:29:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-15 00:29:33] [INFO ] [Nat]Absence check using 4 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-15 00:29:33] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 00:29:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-15 00:29:33] [INFO ] After 31ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-15 00:29:33] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2023-03-15 00:29:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-15 00:29:33] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2023-03-15 00:29:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-15 00:29:33] [INFO ] After 182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-15 00:29:33] [INFO ] After 344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 51 ms.
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 69/69 transitions.
Graph (complete) has 160 edges and 78 vertex of which 76 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 76 transition count 59
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 66 transition count 59
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 21 place count 66 transition count 58
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 65 transition count 58
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 37 place count 58 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 57 transition count 51
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 57 transition count 48
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 45 place count 54 transition count 48
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 47 place count 54 transition count 48
Applied a total of 47 rules in 35 ms. Remains 54 /78 variables (removed 24) and now considering 48/69 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 54/78 places, 48/69 transitions.
Incomplete random walk after 10000 steps, including 950 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 657 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 638 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 658 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 662 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 4) seen :0
Finished probabilistic random walk after 2514 steps, run visited all 4 properties in 21 ms. (steps per millisecond=119 )
Probabilistic random walk after 2514 steps, saw 1287 distinct states, run finished after 22 ms. (steps per millisecond=114 ) properties seen :4
Successfully simplified 22 atomic propositions for a total of 16 simplifications.
FORMULA DoubleExponent-PT-002-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 00:29:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-15 00:29:34] [INFO ] Flatten gal took : 13 ms
[2023-03-15 00:29:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DoubleExponent-PT-002-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-15 00:29:34] [INFO ] Flatten gal took : 11 ms
[2023-03-15 00:29:34] [INFO ] Input system was already deterministic with 98 transitions.
Support contains 54 out of 110 places (down from 55) after GAL structural reductions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 178 edges and 110 vertex of which 104 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 98
Applied a total of 2 rules in 5 ms. Remains 108 /110 variables (removed 2) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 108/110 places, 98/98 transitions.
[2023-03-15 00:29:34] [INFO ] Flatten gal took : 8 ms
[2023-03-15 00:29:34] [INFO ] Flatten gal took : 9 ms
[2023-03-15 00:29:34] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 98
Applied a total of 4 rules in 7 ms. Remains 106 /110 variables (removed 4) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 106/110 places, 98/98 transitions.
[2023-03-15 00:29:34] [INFO ] Flatten gal took : 8 ms
[2023-03-15 00:29:34] [INFO ] Flatten gal took : 8 ms
[2023-03-15 00:29:34] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 98
Applied a total of 4 rules in 5 ms. Remains 106 /110 variables (removed 4) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 106/110 places, 98/98 transitions.
[2023-03-15 00:29:34] [INFO ] Flatten gal took : 7 ms
[2023-03-15 00:29:34] [INFO ] Flatten gal took : 8 ms
[2023-03-15 00:29:34] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 98
Applied a total of 4 rules in 6 ms. Remains 106 /110 variables (removed 4) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 106/110 places, 98/98 transitions.
[2023-03-15 00:29:34] [INFO ] Flatten gal took : 8 ms
[2023-03-15 00:29:34] [INFO ] Flatten gal took : 8 ms
[2023-03-15 00:29:34] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Graph (complete) has 178 edges and 110 vertex of which 106 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 105 transition count 75
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 83 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 82 transition count 74
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 47 place count 82 transition count 70
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 55 place count 78 transition count 70
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 85 place count 63 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 62 transition count 54
Applied a total of 86 rules in 25 ms. Remains 62 /110 variables (removed 48) and now considering 54/98 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 62/110 places, 54/98 transitions.
[2023-03-15 00:29:34] [INFO ] Flatten gal took : 5 ms
[2023-03-15 00:29:34] [INFO ] Flatten gal took : 5 ms
[2023-03-15 00:29:34] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 98
Applied a total of 4 rules in 5 ms. Remains 106 /110 variables (removed 4) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 106/110 places, 98/98 transitions.
[2023-03-15 00:29:34] [INFO ] Flatten gal took : 7 ms
[2023-03-15 00:29:34] [INFO ] Flatten gal took : 8 ms
[2023-03-15 00:29:34] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 98
Applied a total of 2 rules in 3 ms. Remains 108 /110 variables (removed 2) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 108/110 places, 98/98 transitions.
[2023-03-15 00:29:34] [INFO ] Flatten gal took : 7 ms
[2023-03-15 00:29:34] [INFO ] Flatten gal took : 7 ms
[2023-03-15 00:29:34] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Graph (complete) has 178 edges and 110 vertex of which 106 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 105 transition count 75
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 83 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 82 transition count 74
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 47 place count 82 transition count 70
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 55 place count 78 transition count 70
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 85 place count 63 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 62 transition count 54
Applied a total of 86 rules in 21 ms. Remains 62 /110 variables (removed 48) and now considering 54/98 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 62/110 places, 54/98 transitions.
[2023-03-15 00:29:34] [INFO ] Flatten gal took : 4 ms
[2023-03-15 00:29:34] [INFO ] Flatten gal took : 5 ms
[2023-03-15 00:29:34] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 98
Applied a total of 4 rules in 3 ms. Remains 106 /110 variables (removed 4) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 106/110 places, 98/98 transitions.
[2023-03-15 00:29:34] [INFO ] Flatten gal took : 6 ms
[2023-03-15 00:29:34] [INFO ] Flatten gal took : 7 ms
[2023-03-15 00:29:34] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Graph (complete) has 178 edges and 110 vertex of which 106 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 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 105 transition count 73
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 81 transition count 73
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 49 place count 81 transition count 69
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 57 place count 77 transition count 69
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 87 place count 62 transition count 54
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 62 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 61 transition count 53
Applied a total of 90 rules in 21 ms. Remains 61 /110 variables (removed 49) and now considering 53/98 (removed 45) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 61/110 places, 53/98 transitions.
[2023-03-15 00:29:34] [INFO ] Flatten gal took : 4 ms
[2023-03-15 00:29:34] [INFO ] Flatten gal took : 5 ms
[2023-03-15 00:29:34] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 98
Applied a total of 4 rules in 2 ms. Remains 106 /110 variables (removed 4) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 106/110 places, 98/98 transitions.
[2023-03-15 00:29:35] [INFO ] Flatten gal took : 6 ms
[2023-03-15 00:29:35] [INFO ] Flatten gal took : 6 ms
[2023-03-15 00:29:35] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 98
Applied a total of 3 rules in 2 ms. Remains 107 /110 variables (removed 3) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 107/110 places, 98/98 transitions.
[2023-03-15 00:29:35] [INFO ] Flatten gal took : 5 ms
[2023-03-15 00:29:35] [INFO ] Flatten gal took : 7 ms
[2023-03-15 00:29:35] [INFO ] Input system was already deterministic with 98 transitions.
[2023-03-15 00:29:35] [INFO ] Flatten gal took : 7 ms
[2023-03-15 00:29:35] [INFO ] Flatten gal took : 7 ms
[2023-03-15 00:29:35] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-15 00:29:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 110 places, 98 transitions and 276 arcs took 2 ms.
Total runtime 10480 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: 110 NrTr: 98 NrArc: 276)

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

net check time: 0m 0.000sec

init dd package: 0m 3.490sec


RS generation: 0m 0.512sec


-> reachability set: #nodes 3013 (3.0e+03) #states 3,708 (3)



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

checking: EG [~ [1<=p58]]
normalized: EG [~ [1<=p58]]

abstracting: (1<=p58)
states: 184
...
EG iterations: 3
-> the formula is TRUE

FORMULA DoubleExponent-PT-002-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.137sec

checking: ~ [A [1<=p54 U EG [AF [~ [p108<=0]]]]]
normalized: ~ [[~ [EG [~ [EG [~ [EG [p108<=0]]]]]] & ~ [E [~ [EG [~ [EG [p108<=0]]]] U [~ [1<=p54] & ~ [EG [~ [EG [p108<=0]]]]]]]]]

abstracting: (p108<=0)
states: 3,628 (3)
.....
EG iterations: 5
......
EG iterations: 6
abstracting: (1<=p54)
states: 6
abstracting: (p108<=0)
states: 3,628 (3)
.....
EG iterations: 5
......
EG iterations: 6
abstracting: (p108<=0)
states: 3,628 (3)
.....
EG iterations: 5
......
EG iterations: 6

EG iterations: 0
-> the formula is TRUE

FORMULA DoubleExponent-PT-002-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.168sec

checking: E [p53<=0 U ~ [p92<=0]]
normalized: E [p53<=0 U ~ [p92<=0]]

abstracting: (p92<=0)
states: 1,240 (3)
abstracting: (p53<=0)
states: 3,567 (3)
-> the formula is FALSE

FORMULA DoubleExponent-PT-002-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: AX [E [p53<=0 U ~ [EF [p37<=p33]]]]
normalized: ~ [EX [~ [E [p53<=0 U ~ [E [true U p37<=p33]]]]]]

abstracting: (p37<=p33)
states: 3,567 (3)
abstracting: (p53<=0)
states: 3,567 (3)
.-> the formula is FALSE

FORMULA DoubleExponent-PT-002-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [EX [AF [~ [E [p52<=0 U p21<=p96]]]]]
normalized: E [true U EX [~ [EG [E [p52<=0 U p21<=p96]]]]]

abstracting: (p21<=p96)
states: 3,704 (3)
abstracting: (p52<=0)
states: 3,665 (3)

EG iterations: 0
.-> the formula is FALSE

FORMULA DoubleExponent-PT-002-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EG [[AF [[~ [1<=p75] & ~ [p54<=p84]]] | EX [~ [1<=p53]]]]
normalized: EG [[EX [~ [1<=p53]] | ~ [EG [~ [[~ [p54<=p84] & ~ [1<=p75]]]]]]]

abstracting: (1<=p75)
states: 16
abstracting: (p54<=p84)
states: 3,702 (3)
......
EG iterations: 6
abstracting: (1<=p53)
states: 141
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 886
-> the formula is FALSE

FORMULA DoubleExponent-PT-002-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.386sec

checking: [E [EX [EF [1<=p7]] U [EG [EX [~ [p43<=0]]] & [p73<=0 | [~ [EG [p69<=0]] & 1<=p63]]]] & AF [1<=p84]]
normalized: [E [EX [E [true U 1<=p7]] U [[p73<=0 | [1<=p63 & ~ [EG [p69<=0]]]] & EG [EX [~ [p43<=0]]]]] & ~ [EG [~ [1<=p84]]]]

abstracting: (1<=p84)
states: 12
..
EG iterations: 2
abstracting: (p43<=0)
states: 3,671 (3)
...
EG iterations: 2
abstracting: (p69<=0)
states: 3,704 (3)
.........
EG iterations: 9
abstracting: (1<=p63)
states: 3,654 (3)
abstracting: (p73<=0)
states: 3,692 (3)
abstracting: (1<=p7)
states: 35
.-> the formula is FALSE

FORMULA DoubleExponent-PT-002-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.221sec

checking: EG [AX [EF [[~ [A [p0<=p52 U 1<=p15]] | [~ [p25<=p98] | ~ [1<=p36]]]]]]
normalized: EG [~ [EX [~ [E [true U [[~ [1<=p36] | ~ [p25<=p98]] | ~ [[~ [EG [~ [1<=p15]]] & ~ [E [~ [1<=p15] U [~ [p0<=p52] & ~ [1<=p15]]]]]]]]]]]]

abstracting: (1<=p15)
states: 3,533 (3)
abstracting: (p0<=p52)
states: 3,707 (3)
abstracting: (1<=p15)
states: 3,533 (3)
abstracting: (1<=p15)
states: 3,533 (3)
....
EG iterations: 4
abstracting: (p25<=p98)
states: 3,634 (3)
abstracting: (1<=p36)
states: 141
.
EG iterations: 0
-> the formula is TRUE

FORMULA DoubleExponent-PT-002-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.049sec

checking: EG [[EG [[A [p61<=p21 U 1<=p73] & [AF [p15<=1] | [1<=p75 | [AX [1<=p8] & [p20<=p19 & 1<=p71]]]]]] | AF [[1<=p87 & EX [EG [p28<=p101]]]]]]
normalized: EG [[~ [EG [~ [[1<=p87 & EX [EG [p28<=p101]]]]]] | EG [[[[1<=p75 | [[p20<=p19 & 1<=p71] & ~ [EX [~ [1<=p8]]]]] | ~ [EG [~ [p15<=1]]]] & [~ [EG [~ [1<=p73]]] & ~ [E [~ [1<=p73] U [~ [p61<=p21] & ~ [1<=p73]]]]]]]]]

abstracting: (1<=p73)
states: 16
abstracting: (p61<=p21)
states: 735
abstracting: (1<=p73)
states: 16
abstracting: (1<=p73)
states: 16
.............
EG iterations: 13
abstracting: (p15<=1)
states: 957
.....
EG iterations: 5
abstracting: (1<=p8)
states: 535
.abstracting: (1<=p71)
states: 16
abstracting: (p20<=p19)
states: 3,704 (3)
abstracting: (1<=p75)
states: 16
.
EG iterations: 1
abstracting: (p28<=p101)
states: 3,707 (3)
.......
EG iterations: 7
.abstracting: (1<=p87)
states: 40
..
EG iterations: 2
...
EG iterations: 3
-> the formula is FALSE

FORMULA DoubleExponent-PT-002-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.310sec

checking: AG [[EG [E [EX [p80<=p21] U p49<=0]] & [[EF [1<=p109] | [E [AF [p54<=0] U p35<=p5] | AX [p21<=p98]]] | [AF [1<=p22] | [EG [[p101<=0 | 1<=p39]] | [EX [p13<=p34] & EF [p67<=0]]]]]]]
normalized: ~ [E [true U ~ [[[[[[E [true U p67<=0] & EX [p13<=p34]] | EG [[p101<=0 | 1<=p39]]] | ~ [EG [~ [1<=p22]]]] | [[~ [EX [~ [p21<=p98]]] | E [~ [EG [~ [p54<=0]]] U p35<=p5]] | E [true U 1<=p109]]] & EG [E [EX [p80<=p21] U p49<=0]]]]]]

abstracting: (p49<=0)
states: 3,665 (3)
abstracting: (p80<=p21)
states: 3,707 (3)
.
EG iterations: 0
abstracting: (1<=p109)
states: 145
abstracting: (p35<=p5)
states: 3,463 (3)
abstracting: (p54<=0)
states: 3,702 (3)
..
EG iterations: 2
abstracting: (p21<=p98)
states: 3,704 (3)
.abstracting: (1<=p22)
states: 1
..
EG iterations: 2
abstracting: (1<=p39)
states: 141
abstracting: (p101<=0)
states: 3,698 (3)
..
EG iterations: 2
abstracting: (p13<=p34)
states: 157
.abstracting: (p67<=0)
states: 1,908 (3)
-> the formula is TRUE

FORMULA DoubleExponent-PT-002-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.290sec

checking: AF [[EG [~ [p13<=p87]] | [AG [[~ [p25<=1] | ~ [p11<=0]]] & [AX [[[~ [p101<=p63] | ~ [p18<=p73]] | [~ [p90<=p3] | ~ [p96<=1]]]] & [[EX [~ [p45<=0]] | ~ [p75<=1]] | [~ [1<=p38] | [~ [p5<=p7] & ~ [p33<=0]]]]]]]]
normalized: ~ [EG [~ [[[[[[[~ [p33<=0] & ~ [p5<=p7]] | ~ [1<=p38]] | [~ [p75<=1] | EX [~ [p45<=0]]]] & ~ [EX [~ [[[~ [p96<=1] | ~ [p90<=p3]] | [~ [p18<=p73] | ~ [p101<=p63]]]]]]] & ~ [E [true U ~ [[~ [p11<=0] | ~ [p25<=1]]]]]] | EG [~ [p13<=p87]]]]]]

abstracting: (p13<=p87)
states: 157
..
EG iterations: 2
abstracting: (p25<=1)
states: 3,708 (3)
abstracting: (p11<=0)
states: 155
abstracting: (p101<=p63)
states: 3,708 (3)
abstracting: (p18<=p73)
states: 3,704 (3)
abstracting: (p90<=p3)
states: 3,668 (3)
abstracting: (p96<=1)
states: 3,708 (3)
.abstracting: (p45<=0)
states: 3,671 (3)
.abstracting: (p75<=1)
states: 3,708 (3)
abstracting: (1<=p38)
states: 141
abstracting: (p5<=p7)
states: 3,608 (3)
abstracting: (p33<=0)
states: 3,707 (3)
...............
EG iterations: 15
-> the formula is FALSE

FORMULA DoubleExponent-PT-002-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.061sec

checking: E [E [~ [A [~ [1<=p82] U ~ [A [p71<=p5 U p39<=p109]]]] U [E [AF [1<=p59] U EG [1<=p42]] & E [1<=p74 U AX [p44<=0]]]] U AG [AF [[p33<=p8 | [p52<=p68 & [p46<=p84 & p76<=p13]]]]]]
normalized: E [E [~ [[~ [EG [[~ [EG [~ [p39<=p109]]] & ~ [E [~ [p39<=p109] U [~ [p71<=p5] & ~ [p39<=p109]]]]]]] & ~ [E [[~ [EG [~ [p39<=p109]]] & ~ [E [~ [p39<=p109] U [~ [p71<=p5] & ~ [p39<=p109]]]]] U [1<=p82 & [~ [EG [~ [p39<=p109]]] & ~ [E [~ [p39<=p109] U [~ [p71<=p5] & ~ [p39<=p109]]]]]]]]]] U [E [1<=p74 U ~ [EX [~ [p44<=0]]]] & E [~ [EG [~ [1<=p59]]] U EG [1<=p42]]]] U ~ [E [true U EG [~ [[p33<=p8 | [p52<=p68 & [p46<=p84 & p76<=p13]]]]]]]]

abstracting: (p76<=p13)
states: 3,708 (3)
abstracting: (p46<=p84)
states: 3,677 (3)
abstracting: (p52<=p68)
states: 3,665 (3)
abstracting: (p33<=p8)
states: 3,707 (3)
.
EG iterations: 1
abstracting: (1<=p42)
states: 37
..
EG iterations: 2
abstracting: (1<=p59)
states: 43
....
EG iterations: 4
abstracting: (p44<=0)
states: 3,707 (3)
.abstracting: (1<=p74)
states: 16
abstracting: (p39<=p109)
states: 3,567 (3)
abstracting: (p71<=p5)
states: 3,692 (3)
abstracting: (p39<=p109)
states: 3,567 (3)
abstracting: (p39<=p109)
states: 3,567 (3)
..
EG iterations: 2
abstracting: (1<=p82)
states: 16
abstracting: (p39<=p109)
states: 3,567 (3)
abstracting: (p71<=p5)
states: 3,692 (3)
abstracting: (p39<=p109)
states: 3,567 (3)
abstracting: (p39<=p109)
states: 3,567 (3)
..
EG iterations: 2
abstracting: (p39<=p109)
states: 3,567 (3)
abstracting: (p71<=p5)
states: 3,692 (3)
abstracting: (p39<=p109)
states: 3,567 (3)
abstracting: (p39<=p109)
states: 3,567 (3)
..
EG iterations: 2

EG iterations: 0
-> the formula is TRUE

FORMULA DoubleExponent-PT-002-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.207sec

totally nodes used: 1918707 (1.9e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2862107 7979923 10842030
used/not used/entry size/cache size: 9795787 57313077 16 1024MB
basic ops cache: hits/miss/sum: 109777 557946 667723
used/not used/entry size/cache size: 979382 15797834 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: 3472 19294 22766
used/not used/entry size/cache size: 19280 8369328 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 65664401
1 1127188
2 246519
3 56895
4 10151
5 1779
6 472
7 116
8 168
9 69
>= 10 1106

Total processing time: 0m10.649sec


BK_STOP 1678840187039

--------------------
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:32471 (331), effective:3707 (37)

initing FirstDep: 0m 0.000sec


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

iterations count:358 (3), effective:27 (0)

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

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

iterations count:2974 (30), effective:237 (2)

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

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

iterations count:1693 (17), effective:140 (1)

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

iterations count:2585 (26), effective:218 (2)

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

iterations count:743 (7), effective:66 (0)

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

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

iterations count:2853 (29), effective:242 (2)

iterations count:98 (1), effective:0 (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="DoubleExponent-PT-002"
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 DoubleExponent-PT-002, 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 r138-smll-167819420700449"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-002.tgz
mv DoubleExponent-PT-002 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 ;