Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r234-tall-167856419800121.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 IOTPpurchase-PT-C05M04P03D02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856419800121
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 9.7K Feb 25 15:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 15:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 15:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 25 15:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 15:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 15:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rwxr-xr-x 1 mcc users 60K 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 IOTPpurchase-PT-C05M04P03D02-CTLCardinality-00
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-01
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-02
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-03
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-04
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-05
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-06
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-07
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-08
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-09
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-10
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-11
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-12
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-13
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-14
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679451217987

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=IOTPpurchase-PT-C05M04P03D02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 02:13:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 02:13:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 02:13:39] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2023-03-22 02:13:39] [INFO ] Transformed 111 places.
[2023-03-22 02:13:39] [INFO ] Transformed 45 transitions.
[2023-03-22 02:13:39] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 90 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Support contains 90 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 10 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 99 transition count 45
Applied a total of 12 rules in 12 ms. Remains 99 /111 variables (removed 12) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 99 cols
[2023-03-22 02:13:39] [INFO ] Computed 55 place invariants in 11 ms
[2023-03-22 02:13:39] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-22 02:13:39] [INFO ] Invariant cache hit.
[2023-03-22 02:13:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 02:13:39] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2023-03-22 02:13:39] [INFO ] Invariant cache hit.
[2023-03-22 02:13:39] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/111 places, 45/45 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 372 ms. Remains : 99/111 places, 45/45 transitions.
Support contains 90 out of 99 places after structural reductions.
[2023-03-22 02:13:40] [INFO ] Flatten gal took : 23 ms
[2023-03-22 02:13:40] [INFO ] Flatten gal took : 9 ms
[2023-03-22 02:13:40] [INFO ] Input system was already deterministic with 45 transitions.
Support contains 89 out of 99 places (down from 90) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 108) seen :54
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 54) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 52) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 48) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) seen :0
Running SMT prover for 47 properties.
[2023-03-22 02:13:41] [INFO ] Invariant cache hit.
[2023-03-22 02:13:41] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-22 02:13:41] [INFO ] [Real]Absence check using 17 positive and 38 generalized place invariants in 19 ms returned sat
[2023-03-22 02:13:41] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:44
[2023-03-22 02:13:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-22 02:13:41] [INFO ] [Nat]Absence check using 17 positive and 38 generalized place invariants in 7 ms returned sat
[2023-03-22 02:13:41] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :37 sat :10
[2023-03-22 02:13:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 02:13:41] [INFO ] After 38ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :37 sat :10
[2023-03-22 02:13:41] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :37 sat :10
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-22 02:13:41] [INFO ] After 630ms SMT Verify possible using all constraints in natural domain returned unsat :37 sat :10
Fused 47 Parikh solutions to 10 different solutions.
Finished Parikh walk after 183 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=91 )
Parikh walk visited 10 properties in 58 ms.
Successfully simplified 37 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 02:13:41] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2023-03-22 02:13:41] [INFO ] Flatten gal took : 7 ms
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 02:13:42] [INFO ] Flatten gal took : 5 ms
[2023-03-22 02:13:42] [INFO ] Input system was already deterministic with 45 transitions.
Support contains 42 out of 99 places (down from 71) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 45/45 transitions.
Ensure Unique test removed 26 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 67 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 19 rules applied. Total rules applied 32 place count 56 transition count 30
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 40 place count 48 transition count 30
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 40 place count 48 transition count 20
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 66 place count 32 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 66 place count 32 transition count 18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 70 place count 30 transition count 18
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 90 place count 18 transition count 10
Discarding 3 places :
Implicit places reduction removed 3 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 94 place count 15 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 95 place count 14 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 95 place count 14 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 97 place count 13 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 103 place count 9 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 104 place count 9 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 105 place count 8 transition count 5
Applied a total of 105 rules in 15 ms. Remains 8 /99 variables (removed 91) and now considering 5/45 (removed 40) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 8/99 places, 5/45 transitions.
[2023-03-22 02:13:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:13:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:13:42] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 45/45 transitions.
Ensure Unique test removed 26 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 67 transition count 45
Applied a total of 32 rules in 2 ms. Remains 67 /99 variables (removed 32) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 67/99 places, 45/45 transitions.
[2023-03-22 02:13:42] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:13:42] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:13:42] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 45/45 transitions.
Ensure Unique test removed 26 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 68 transition count 45
Applied a total of 31 rules in 3 ms. Remains 68 /99 variables (removed 31) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 68/99 places, 45/45 transitions.
[2023-03-22 02:13:42] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:13:42] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:13:42] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 45/45 transitions.
Ensure Unique test removed 26 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 68 transition count 45
Applied a total of 31 rules in 2 ms. Remains 68 /99 variables (removed 31) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 68/99 places, 45/45 transitions.
[2023-03-22 02:13:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:13:42] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:13:42] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 45/45 transitions.
Ensure Unique test removed 26 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 67 transition count 45
Applied a total of 32 rules in 2 ms. Remains 67 /99 variables (removed 32) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 67/99 places, 45/45 transitions.
[2023-03-22 02:13:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:13:42] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:13:42] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 45/45 transitions.
Ensure Unique test removed 26 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 68 transition count 41
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 62 transition count 37
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 24 place count 58 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 57 transition count 36
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 25 place count 57 transition count 25
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 53 place count 40 transition count 25
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 53 place count 40 transition count 22
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 59 place count 37 transition count 22
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 61 place count 36 transition count 21
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 64 place count 34 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 65 place count 33 transition count 20
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 81 place count 23 transition count 14
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 82 place count 22 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 82 place count 22 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 85 place count 20 transition count 13
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 86 place count 20 transition count 12
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 3 rules applied. Total rules applied 89 place count 18 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 90 place count 17 transition count 11
Applied a total of 90 rules in 9 ms. Remains 17 /99 variables (removed 82) and now considering 11/45 (removed 34) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 17/99 places, 11/45 transitions.
[2023-03-22 02:13:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:13:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:13:42] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 99/99 places, 45/45 transitions.
Ensure Unique test removed 26 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 67 transition count 41
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 18 place count 61 transition count 39
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 21 place count 59 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 58 transition count 38
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 22 place count 58 transition count 28
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 48 place count 42 transition count 28
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 48 place count 42 transition count 26
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 52 place count 40 transition count 26
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 10 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 69 place count 30 transition count 19
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 70 place count 29 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 70 place count 29 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 72 place count 28 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 75 place count 26 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 78 place count 24 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 79 place count 24 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 81 place count 22 transition count 15
Applied a total of 81 rules in 11 ms. Remains 22 /99 variables (removed 77) and now considering 15/45 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 22/99 places, 15/45 transitions.
[2023-03-22 02:13:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:13:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:13:42] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 45/45 transitions.
Ensure Unique test removed 26 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 67 transition count 45
Applied a total of 32 rules in 2 ms. Remains 67 /99 variables (removed 32) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 67/99 places, 45/45 transitions.
[2023-03-22 02:13:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:13:42] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:13:42] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 45/45 transitions.
Ensure Unique test removed 26 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 67 transition count 45
Applied a total of 32 rules in 2 ms. Remains 67 /99 variables (removed 32) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 67/99 places, 45/45 transitions.
[2023-03-22 02:13:42] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:13:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:13:42] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 45/45 transitions.
Ensure Unique test removed 26 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 67 transition count 45
Applied a total of 32 rules in 3 ms. Remains 67 /99 variables (removed 32) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 67/99 places, 45/45 transitions.
[2023-03-22 02:13:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:13:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:13:42] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 45/45 transitions.
Ensure Unique test removed 26 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 67 transition count 45
Applied a total of 32 rules in 2 ms. Remains 67 /99 variables (removed 32) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 67/99 places, 45/45 transitions.
[2023-03-22 02:13:42] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:13:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:13:42] [INFO ] Input system was already deterministic with 45 transitions.
[2023-03-22 02:13:42] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:13:42] [INFO ] Flatten gal took : 4 ms
[2023-03-22 02:13:42] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-22 02:13:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 99 places, 45 transitions and 200 arcs took 1 ms.
Total runtime 2804 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: 99 NrTr: 45 NrArc: 200)

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

net check time: 0m 0.000sec

init dd package: 0m 2.996sec


RS generation: 0m 0.329sec


-> reachability set: #nodes 10094 (1.0e+04) #states 17,406,024 (7)



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

checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]

abstracting: (1<=0)
states: 0
.-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.121sec

checking: AG [EX [~ [p90<=3]]]
normalized: ~ [E [true U ~ [EX [~ [p90<=3]]]]]

abstracting: (p90<=3)
states: 17,404,104 (7)
.-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.085sec

checking: EF [AG [AF [~ [p39<=p96]]]]
normalized: E [true U ~ [E [true U EG [p39<=p96]]]]

abstracting: (p39<=p96)
states: 16,319,430 (7)
.............................................................................................................
EG iterations: 109
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.262sec

checking: EG [EX [AG [EX [p66<=p88]]]]
normalized: EG [EX [~ [E [true U ~ [EX [p66<=p88]]]]]]

abstracting: (p66<=p88)
states: 5,556,552 (6)
...
EG iterations: 1
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.271sec

checking: E [EX [0<=0] U AG [p8<=p15]]
normalized: E [EX [0<=0] U ~ [E [true U ~ [p8<=p15]]]]

abstracting: (p8<=p15)
states: 12,119,560 (7)
abstracting: (0<=0)
states: 17,406,024 (7)
.-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.177sec

checking: AG [[E [AX [AF [p75<=p6]] U ~ [AG [~ [p8<=p12]]]] & AX [AX [EX [0<=0]]]]]
normalized: ~ [E [true U ~ [[~ [EX [EX [~ [EX [0<=0]]]]] & E [~ [EX [EG [~ [p75<=p6]]]] U E [true U p8<=p12]]]]]]

abstracting: (p8<=p12)
states: 12,186,344 (7)
abstracting: (p75<=p6)
states: 12,078,728 (7)
.................................................................................................................
EG iterations: 113
.abstracting: (0<=0)
states: 17,406,024 (7)
...-> the formula is TRUE

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.102sec

checking: EG [[p26<=p31 & [EG [p2<=2] | [p73<=2 | EF [EG [p14<=p35]]]]]]
normalized: EG [[p26<=p31 & [[p73<=2 | E [true U EG [p14<=p35]]] | EG [p2<=2]]]]

abstracting: (p2<=2)
states: 17,400,376 (7)
.
EG iterations: 1
abstracting: (p14<=p35)
states: 14,863,888 (7)
..........................................................................
EG iterations: 74
abstracting: (p73<=2)
states: 17,400,376 (7)
abstracting: (p26<=p31)
states: 15,865,208 (7)
...........................................
EG iterations: 43
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.792sec

checking: EG [EF [~ [A [[AG [p28<=3] | p51<=0] U [2<=p30 | [p67<=p66 & p18<=p91]]]]]]
normalized: EG [E [true U ~ [[~ [EG [~ [[2<=p30 | [p67<=p66 & p18<=p91]]]]] & ~ [E [~ [[2<=p30 | [p67<=p66 & p18<=p91]]] U [~ [[p51<=0 | ~ [E [true U ~ [p28<=3]]]]] & ~ [[2<=p30 | [p67<=p66 & p18<=p91]]]]]]]]]]

abstracting: (p18<=p91)
states: 11,427,876 (7)
abstracting: (p67<=p66)
states: 14,964,620 (7)
abstracting: (2<=p30)
states: 118,920 (5)
abstracting: (p28<=3)
states: 17,405,888 (7)
abstracting: (p51<=0)
states: 14,258,424 (7)
abstracting: (p18<=p91)
states: 11,427,876 (7)
abstracting: (p67<=p66)
states: 14,964,620 (7)
abstracting: (2<=p30)
states: 118,920 (5)
abstracting: (p18<=p91)
states: 11,427,876 (7)
abstracting: (p67<=p66)
states: 14,964,620 (7)
abstracting: (2<=p30)
states: 118,920 (5)
...................................................................................................................
EG iterations: 115

EG iterations: 0
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.946sec

checking: [AF [EX [[~ [E [p12<=3 U p69<=0]] & EX [0<=0]]]] | [EF [AX [1<=0]] & A [p37<=1 U [p35<=1 | AG [[3<=p85 | [p20<=p40 | p4<=p86]]]]]]]
normalized: [[[~ [EG [~ [[p35<=1 | ~ [E [true U ~ [[3<=p85 | [p20<=p40 | p4<=p86]]]]]]]]] & ~ [E [~ [[p35<=1 | ~ [E [true U ~ [[3<=p85 | [p20<=p40 | p4<=p86]]]]]]] U [~ [p37<=1] & ~ [[p35<=1 | ~ [E [true U ~ [[3<=p85 | [p20<=p40 | p4<=p86]]]]]]]]]]] & E [true U ~ [EX [~ [1<=0]]]]] | ~ [EG [~ [EX [[EX [0<=0] & ~ [E [p12<=3 U p69<=0]]]]]]]]

abstracting: (p69<=0)
states: 15,758,432 (7)
abstracting: (p12<=3)
states: 17,403,904 (7)
abstracting: (0<=0)
states: 17,406,024 (7)
...
EG iterations: 1
abstracting: (1<=0)
states: 0
.abstracting: (p4<=p86)
states: 15,870,720 (7)
abstracting: (p20<=p40)
states: 2,963,696 (6)
abstracting: (3<=p85)
states: 3,275,380 (6)
abstracting: (p35<=1)
states: 17,288,224 (7)
abstracting: (p37<=1)
states: 17,288,224 (7)
abstracting: (p4<=p86)
states: 15,870,720 (7)
abstracting: (p20<=p40)
states: 2,963,696 (6)
abstracting: (3<=p85)
states: 3,275,380 (6)
abstracting: (p35<=1)
states: 17,288,224 (7)
abstracting: (p4<=p86)
states: 15,870,720 (7)
abstracting: (p20<=p40)
states: 2,963,696 (6)
abstracting: (3<=p85)
states: 3,275,380 (6)
abstracting: (p35<=1)
states: 17,288,224 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.164sec

checking: EF [[~ [A [p71<=p42 U p2<=2]] | [4<=p88 | [AG [p21<=3] & [EX [0<=0] | [EF [1<=p71] | [AX [~ [p9<=p10]] & p1<=p19]]]]]]]
normalized: E [true U [[4<=p88 | [[[[p1<=p19 & ~ [EX [p9<=p10]]] | E [true U 1<=p71]] | EX [0<=0]] & ~ [E [true U ~ [p21<=3]]]]] | ~ [[~ [EG [~ [p2<=2]]] & ~ [E [~ [p2<=2] U [~ [p71<=p42] & ~ [p2<=2]]]]]]]]

abstracting: (p2<=2)
states: 17,400,376 (7)
abstracting: (p71<=p42)
states: 15,911,280 (7)
abstracting: (p2<=2)
states: 17,400,376 (7)
abstracting: (p2<=2)
states: 17,400,376 (7)
.
EG iterations: 1
abstracting: (p21<=3)
states: 17,405,888 (7)
abstracting: (0<=0)
states: 17,406,024 (7)
.abstracting: (1<=p71)
states: 1,647,592 (6)
abstracting: (p9<=p10)
states: 16,288,788 (7)
.abstracting: (p1<=p19)
states: 16,092,612 (7)
abstracting: (4<=p88)
states: 2,120 (3)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.539sec

checking: [EX [p85<=p55] & [EG [AF [[p32<=2 & p40<=3]]] | AG [[~ [A [E [1<=p40 U p13<=p77] U ~ [p54<=2]]] & p93<=p55]]]]
normalized: [[~ [E [true U ~ [[p93<=p55 & ~ [[~ [EG [p54<=2]] & ~ [E [p54<=2 U [p54<=2 & ~ [E [1<=p40 U p13<=p77]]]]]]]]]]] | EG [~ [EG [~ [[p32<=2 & p40<=3]]]]]] & EX [p85<=p55]]

abstracting: (p85<=p55)
states: 8,819,221 (6)
.abstracting: (p40<=3)
states: 17,406,024 (7)
abstracting: (p32<=2)
states: 17,400,376 (7)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p13<=p77)
states: 14,863,888 (7)
abstracting: (1<=p40)
states: 1,535,304 (6)
abstracting: (p54<=2)
states: 17,400,376 (7)
abstracting: (p54<=2)
states: 17,400,376 (7)
abstracting: (p54<=2)
states: 17,400,376 (7)
.
EG iterations: 1
abstracting: (p93<=p55)
states: 17,066,928 (7)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.542sec

totally nodes used: 9295138 (9.3e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 8126585 19317878 27444463
used/not used/entry size/cache size: 23258696 43850168 16 1024MB
basic ops cache: hits/miss/sum: 885344 2563631 3448975
used/not used/entry size/cache size: 3767450 13009766 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: 42373 119113 161486
used/not used/entry size/cache size: 118346 8270262 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 59089259
1 6947151
2 908816
3 137779
4 21004
5 2709
6 940
7 301
8 87
9 200
>= 10 618

Total processing time: 0m14.737sec


BK_STOP 1679451237957

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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:1545 (34), effective:301 (6)

initing FirstDep: 0m 0.000sec


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

iterations count:293 (6), effective:58 (1)

iterations count:149 (3), effective:35 (0)

iterations count:232 (5), effective:38 (0)

iterations count:102 (2), effective:18 (0)

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

iterations count:69 (1), effective:8 (0)

iterations count:857 (19), effective:172 (3)

iterations count:237 (5), effective:41 (0)

iterations count:238 (5), effective:41 (0)

iterations count:67 (1), effective:7 (0)

iterations count:279 (6), effective:51 (1)

iterations count:279 (6), effective:51 (1)

iterations count:455 (10), effective:88 (1)

iterations count:279 (6), effective:51 (1)

iterations count:250 (5), effective:44 (0)

iterations count:855 (19), effective:173 (3)

iterations count:250 (5), effective:44 (0)

iterations count:679 (15), effective:136 (3)

iterations count:58 (1), effective:5 (0)

iterations count:273 (6), effective:49 (1)

iterations count:420 (9), effective:85 (1)

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="IOTPpurchase-PT-C05M04P03D02"
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 IOTPpurchase-PT-C05M04P03D02, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856419800121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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