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-167819419200017.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 Dekker-PT-020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819419200017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 6.3K Feb 26 01:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 01:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 26 01:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 01:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 26 01:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 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 247K 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 Dekker-PT-020-CTLCardinality-00
FORMULA_NAME Dekker-PT-020-CTLCardinality-01
FORMULA_NAME Dekker-PT-020-CTLCardinality-02
FORMULA_NAME Dekker-PT-020-CTLCardinality-03
FORMULA_NAME Dekker-PT-020-CTLCardinality-04
FORMULA_NAME Dekker-PT-020-CTLCardinality-05
FORMULA_NAME Dekker-PT-020-CTLCardinality-06
FORMULA_NAME Dekker-PT-020-CTLCardinality-07
FORMULA_NAME Dekker-PT-020-CTLCardinality-08
FORMULA_NAME Dekker-PT-020-CTLCardinality-09
FORMULA_NAME Dekker-PT-020-CTLCardinality-10
FORMULA_NAME Dekker-PT-020-CTLCardinality-11
FORMULA_NAME Dekker-PT-020-CTLCardinality-12
FORMULA_NAME Dekker-PT-020-CTLCardinality-13
FORMULA_NAME Dekker-PT-020-CTLCardinality-14
FORMULA_NAME Dekker-PT-020-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678531437637

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=Dekker-PT-020
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 10:44:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 10:44:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 10:44:01] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2023-03-11 10:44:01] [INFO ] Transformed 100 places.
[2023-03-11 10:44:01] [INFO ] Transformed 440 transitions.
[2023-03-11 10:44:01] [INFO ] Found NUPN structural information;
[2023-03-11 10:44:01] [INFO ] Parsed PT model containing 100 places and 440 transitions and 3240 arcs in 336 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Dekker-PT-020-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 43 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2023-03-11 10:44:01] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 100 cols
[2023-03-11 10:44:01] [INFO ] Computed 60 place invariants in 13 ms
[2023-03-11 10:44:01] [INFO ] Implicit Places using invariants in 433 ms returned [40, 52, 55, 67, 70, 73, 76, 79, 82, 97]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 506 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/100 places, 440/440 transitions.
Applied a total of 0 rules in 16 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 566 ms. Remains : 90/100 places, 440/440 transitions.
Support contains 57 out of 90 places after structural reductions.
[2023-03-11 10:44:02] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-11 10:44:02] [INFO ] Flatten gal took : 119 ms
[2023-03-11 10:44:02] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Dekker-PT-020-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 10:44:02] [INFO ] Flatten gal took : 62 ms
[2023-03-11 10:44:02] [INFO ] Input system was already deterministic with 440 transitions.
Support contains 51 out of 90 places (down from 57) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 877 ms. (steps per millisecond=11 ) properties (out of 36) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 10:44:03] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 90 cols
[2023-03-11 10:44:03] [INFO ] Computed 50 place invariants in 4 ms
[2023-03-11 10:44:03] [INFO ] [Real]Absence check using 40 positive place invariants in 21 ms returned sat
[2023-03-11 10:44:03] [INFO ] [Real]Absence check using 40 positive and 10 generalized place invariants in 8 ms returned sat
[2023-03-11 10:44:03] [INFO ] After 99ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-11 10:44:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 10:44:03] [INFO ] After 42ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 10:44:03] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 10:44:04] [INFO ] [Nat]Absence check using 40 positive place invariants in 15 ms returned sat
[2023-03-11 10:44:04] [INFO ] [Nat]Absence check using 40 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-11 10:44:04] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 10:44:04] [INFO ] After 40ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 10:44:04] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 6 ms to minimize.
[2023-03-11 10:44:04] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2023-03-11 10:44:04] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2023-03-11 10:44:04] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 2 ms to minimize.
[2023-03-11 10:44:04] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2023-03-11 10:44:04] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2023-03-11 10:44:04] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2023-03-11 10:44:04] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2023-03-11 10:44:04] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2023-03-11 10:44:04] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2023-03-11 10:44:05] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2023-03-11 10:44:05] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2023-03-11 10:44:05] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2023-03-11 10:44:05] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 2 ms to minimize.
[2023-03-11 10:44:05] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2023-03-11 10:44:05] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2023-03-11 10:44:05] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2023-03-11 10:44:05] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2023-03-11 10:44:05] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-11 10:44:05] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2023-03-11 10:44:05] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2023-03-11 10:44:05] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2023-03-11 10:44:05] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-11 10:44:05] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 1474 ms
[2023-03-11 10:44:05] [INFO ] After 1574ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-11 10:44:05] [INFO ] After 1841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 45 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 90/90 places, 440/440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 329049 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 329049 steps, saw 177732 distinct states, run finished after 3003 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 10:44:09] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2023-03-11 10:44:09] [INFO ] Invariant cache hit.
[2023-03-11 10:44:09] [INFO ] [Real]Absence check using 40 positive place invariants in 14 ms returned sat
[2023-03-11 10:44:09] [INFO ] [Real]Absence check using 40 positive and 10 generalized place invariants in 5 ms returned sat
[2023-03-11 10:44:09] [INFO ] After 69ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-11 10:44:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 10:44:09] [INFO ] After 39ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 10:44:09] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 10:44:09] [INFO ] [Nat]Absence check using 40 positive place invariants in 17 ms returned sat
[2023-03-11 10:44:09] [INFO ] [Nat]Absence check using 40 positive and 10 generalized place invariants in 3 ms returned sat
[2023-03-11 10:44:09] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 10:44:09] [INFO ] After 28ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 10:44:09] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2023-03-11 10:44:09] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2023-03-11 10:44:09] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2023-03-11 10:44:09] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2023-03-11 10:44:09] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2023-03-11 10:44:09] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2023-03-11 10:44:09] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2023-03-11 10:44:09] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2023-03-11 10:44:10] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2023-03-11 10:44:10] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2023-03-11 10:44:10] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 6 ms to minimize.
[2023-03-11 10:44:10] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2023-03-11 10:44:10] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2023-03-11 10:44:10] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2023-03-11 10:44:10] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2023-03-11 10:44:10] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 2 ms to minimize.
[2023-03-11 10:44:10] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-11 10:44:10] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2023-03-11 10:44:10] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2023-03-11 10:44:10] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2023-03-11 10:44:10] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2023-03-11 10:44:10] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2023-03-11 10:44:10] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-11 10:44:10] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-11 10:44:10] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 1143 ms
[2023-03-11 10:44:10] [INFO ] After 1208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-11 10:44:10] [INFO ] After 1401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 52 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 90/90 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 33 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2023-03-11 10:44:10] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2023-03-11 10:44:10] [INFO ] Invariant cache hit.
[2023-03-11 10:44:11] [INFO ] Implicit Places using invariants in 358 ms returned [42, 45, 48, 55, 58, 61, 76, 79, 82, 85]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 361 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 80/90 places, 440/440 transitions.
Applied a total of 0 rules in 28 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 423 ms. Remains : 80/90 places, 440/440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 364434 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :{}
Probabilistic random walk after 364434 steps, saw 197390 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 10:44:14] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 80 cols
[2023-03-11 10:44:14] [INFO ] Computed 40 place invariants in 5 ms
[2023-03-11 10:44:14] [INFO ] [Real]Absence check using 40 positive place invariants in 10 ms returned sat
[2023-03-11 10:44:14] [INFO ] After 53ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-11 10:44:14] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 10:44:14] [INFO ] After 26ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :1 real:2
[2023-03-11 10:44:14] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2023-03-11 10:44:14] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
[2023-03-11 10:44:14] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2023-03-11 10:44:14] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2023-03-11 10:44:14] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2023-03-11 10:44:14] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2023-03-11 10:44:14] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2023-03-11 10:44:14] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2023-03-11 10:44:15] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2023-03-11 10:44:15] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2023-03-11 10:44:15] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2023-03-11 10:44:15] [INFO ] Trap strengthening procedure interrupted after too many repetitions 574 ms
[2023-03-11 10:44:15] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 575 ms
[2023-03-11 10:44:15] [INFO ] After 612ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 10:44:15] [INFO ] After 736ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 10:44:15] [INFO ] [Nat]Absence check using 40 positive place invariants in 16 ms returned sat
[2023-03-11 10:44:15] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 10:44:15] [INFO ] After 37ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 10:44:15] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2023-03-11 10:44:15] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2023-03-11 10:44:15] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2023-03-11 10:44:15] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2023-03-11 10:44:15] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2023-03-11 10:44:15] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 4 ms to minimize.
[2023-03-11 10:44:15] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2023-03-11 10:44:15] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2023-03-11 10:44:15] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2023-03-11 10:44:15] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2023-03-11 10:44:15] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-11 10:44:15] [INFO ] Trap strengthening procedure interrupted after too many repetitions 593 ms
[2023-03-11 10:44:15] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 594 ms
[2023-03-11 10:44:15] [INFO ] After 671ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-11 10:44:16] [INFO ] After 867ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 440/440 transitions.
Applied a total of 0 rules in 22 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 80/80 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 440/440 transitions.
Applied a total of 0 rules in 22 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2023-03-11 10:44:16] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2023-03-11 10:44:16] [INFO ] Invariant cache hit.
[2023-03-11 10:44:16] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-11 10:44:16] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2023-03-11 10:44:16] [INFO ] Invariant cache hit.
[2023-03-11 10:44:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 10:44:16] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2023-03-11 10:44:16] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-11 10:44:16] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2023-03-11 10:44:16] [INFO ] Invariant cache hit.
[2023-03-11 10:44:17] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1060 ms. Remains : 80/80 places, 440/440 transitions.
Graph (complete) has 120 edges and 80 vertex of which 20 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.3 ms
Discarding 60 places :
Also discarding 330 output transitions
Drop transitions removed 330 transitions
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 0 with 90 rules applied. Total rules applied 91 place count 20 transition count 20
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 9 rules applied. Total rules applied 100 place count 14 transition count 17
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 103 place count 14 transition count 14
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 14 transition count 13
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 107 place count 12 transition count 12
Applied a total of 107 rules in 21 ms. Remains 12 /80 variables (removed 68) and now considering 12/440 (removed 428) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 12 rows 12 cols
[2023-03-11 10:44:17] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 10:44:17] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-11 10:44:17] [INFO ] After 17ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-11 10:44:17] [INFO ] After 31ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-11 10:44:17] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3
[2023-03-11 10:44:17] [INFO ] Flatten gal took : 61 ms
[2023-03-11 10:44:17] [INFO ] Flatten gal took : 60 ms
[2023-03-11 10:44:17] [INFO ] Input system was already deterministic with 440 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 90/90 places, 440/440 transitions.
[2023-03-11 10:44:17] [INFO ] Flatten gal took : 41 ms
[2023-03-11 10:44:17] [INFO ] Flatten gal took : 46 ms
[2023-03-11 10:44:17] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 90/90 places, 440/440 transitions.
[2023-03-11 10:44:17] [INFO ] Flatten gal took : 35 ms
[2023-03-11 10:44:17] [INFO ] Flatten gal took : 37 ms
[2023-03-11 10:44:17] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 90/90 places, 440/440 transitions.
[2023-03-11 10:44:17] [INFO ] Flatten gal took : 34 ms
[2023-03-11 10:44:17] [INFO ] Flatten gal took : 36 ms
[2023-03-11 10:44:18] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 90/90 places, 440/440 transitions.
[2023-03-11 10:44:18] [INFO ] Flatten gal took : 33 ms
[2023-03-11 10:44:18] [INFO ] Flatten gal took : 36 ms
[2023-03-11 10:44:18] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 90/90 places, 440/440 transitions.
[2023-03-11 10:44:18] [INFO ] Flatten gal took : 28 ms
[2023-03-11 10:44:18] [INFO ] Flatten gal took : 23 ms
[2023-03-11 10:44:18] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 21 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 90/90 places, 440/440 transitions.
[2023-03-11 10:44:18] [INFO ] Flatten gal took : 19 ms
[2023-03-11 10:44:18] [INFO ] Flatten gal took : 21 ms
[2023-03-11 10:44:18] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 90/90 places, 440/440 transitions.
[2023-03-11 10:44:18] [INFO ] Flatten gal took : 21 ms
[2023-03-11 10:44:18] [INFO ] Flatten gal took : 21 ms
[2023-03-11 10:44:18] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 90/90 places, 440/440 transitions.
[2023-03-11 10:44:18] [INFO ] Flatten gal took : 20 ms
[2023-03-11 10:44:18] [INFO ] Flatten gal took : 26 ms
[2023-03-11 10:44:18] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 22 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 90/90 places, 440/440 transitions.
[2023-03-11 10:44:18] [INFO ] Flatten gal took : 19 ms
[2023-03-11 10:44:18] [INFO ] Flatten gal took : 22 ms
[2023-03-11 10:44:18] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 90/90 places, 440/440 transitions.
[2023-03-11 10:44:18] [INFO ] Flatten gal took : 19 ms
[2023-03-11 10:44:18] [INFO ] Flatten gal took : 21 ms
[2023-03-11 10:44:18] [INFO ] Input system was already deterministic with 440 transitions.
[2023-03-11 10:44:18] [INFO ] Flatten gal took : 21 ms
[2023-03-11 10:44:18] [INFO ] Flatten gal took : 22 ms
[2023-03-11 10:44:18] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-11 10:44:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 90 places, 440 transitions and 3030 arcs took 6 ms.
Total runtime 17975 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: 90 NrTr: 440 NrArc: 3030)

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

net check time: 0m 0.000sec

init dd package: 0m 3.683sec


RS generation: 0m 1.188sec


-> reachability set: #nodes 10413 (1.0e+04) #states 11,534,336 (7)



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

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

abstracting: (0<=p12)
states: 11,534,336 (7)
abstracting: (p12<=0)
states: 6,029,312 (6)
abstracting: (1<=p26)
states: 5,505,024 (6)
abstracting: (p26<=1)
states: 11,534,336 (7)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is FALSE

FORMULA Dekker-PT-020-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.422sec

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

abstracting: (p53<=1)
states: 11,534,336 (7)
abstracting: (1<=p53)
states: 5,505,024 (6)
.
EG iterations: 1
abstracting: (1<=p0)
states: 5,505,024 (6)
abstracting: (p0<=1)
states: 11,534,336 (7)
-> the formula is FALSE

FORMULA Dekker-PT-020-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.431sec

checking: E [~ [[p56<=1 & 1<=p56]] U AG [[AX [[EX [[p4<=0 & 0<=p4]] & AF [[p27<=1 & 1<=p27]]]] | EF [EX [0<=0]]]]]
normalized: E [~ [[p56<=1 & 1<=p56]] U ~ [E [true U ~ [[E [true U EX [0<=0]] | ~ [EX [~ [[~ [EG [~ [[p27<=1 & 1<=p27]]]] & EX [[p4<=0 & 0<=p4]]]]]]]]]]]

abstracting: (0<=p4)
states: 11,534,336 (7)
abstracting: (p4<=0)
states: 6,029,312 (6)
.abstracting: (1<=p27)
states: 6,029,312 (6)
abstracting: (p27<=1)
states: 11,534,336 (7)
.
EG iterations: 1
.abstracting: (0<=0)
states: 11,534,336 (7)
.abstracting: (1<=p56)
states: 5,505,024 (6)
abstracting: (p56<=1)
states: 11,534,336 (7)
-> the formula is TRUE

FORMULA Dekker-PT-020-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.761sec

checking: EF [AG [E [AF [[[p26<=0 & 0<=p26] | [p35<=1 & 1<=p35]]] U ~ [[0<=p55 & p55<=0]]]]]
normalized: E [true U ~ [E [true U ~ [E [~ [EG [~ [[[p35<=1 & 1<=p35] | [p26<=0 & 0<=p26]]]]] U ~ [[0<=p55 & p55<=0]]]]]]]

abstracting: (p55<=0)
states: 6,029,312 (6)
abstracting: (0<=p55)
states: 11,534,336 (7)
abstracting: (0<=p26)
states: 11,534,336 (7)
abstracting: (p26<=0)
states: 6,029,312 (6)
abstracting: (1<=p35)
states: 6,029,312 (6)
abstracting: (p35<=1)
states: 11,534,336 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Dekker-PT-020-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.654sec

checking: EF [AX [[~ [E [[p15<=0 & 0<=p15] U ~ [[1<=p19 & p19<=1]]]] & EF [[[p60<=1 & 1<=p60] & [p80<=0 & 0<=p80]]]]]]
normalized: E [true U ~ [EX [~ [[E [true U [[p80<=0 & 0<=p80] & [p60<=1 & 1<=p60]]] & ~ [E [[p15<=0 & 0<=p15] U ~ [[1<=p19 & p19<=1]]]]]]]]]

abstracting: (p19<=1)
states: 11,534,336 (7)
abstracting: (1<=p19)
states: 6,029,312 (6)
abstracting: (0<=p15)
states: 11,534,336 (7)
abstracting: (p15<=0)
states: 5,505,024 (6)
abstracting: (1<=p60)
states: 524,288 (5)
abstracting: (p60<=1)
states: 11,534,336 (7)
abstracting: (0<=p80)
states: 11,534,336 (7)
abstracting: (p80<=0)
states: 6,029,312 (6)
.-> the formula is FALSE

FORMULA Dekker-PT-020-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.159sec

checking: EX [EX [[[[0<=p46 & p46<=0] | EG [[p76<=1 & 1<=p76]]] & [[1<=p33 & p33<=1] | [p39<=0 & 0<=p39]]]]]
normalized: EX [EX [[[[p39<=0 & 0<=p39] | [1<=p33 & p33<=1]] & [EG [[p76<=1 & 1<=p76]] | [0<=p46 & p46<=0]]]]]

abstracting: (p46<=0)
states: 6,029,312 (6)
abstracting: (0<=p46)
states: 11,534,336 (7)
abstracting: (1<=p76)
states: 5,505,024 (6)
abstracting: (p76<=1)
states: 11,534,336 (7)
.
EG iterations: 1
abstracting: (p33<=1)
states: 11,534,336 (7)
abstracting: (1<=p33)
states: 6,029,312 (6)
abstracting: (0<=p39)
states: 11,534,336 (7)
abstracting: (p39<=0)
states: 5,505,024 (6)
..-> the formula is TRUE

FORMULA Dekker-PT-020-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.192sec

checking: EX [AG [[[EG [[[[p30<=1 & 1<=p30] | [p82<=1 & 1<=p82]] | [p46<=0 & 0<=p46]]] | ~ [[p15<=1 & 1<=p15]]] | EX [AX [[p48<=1 & 1<=p48]]]]]]
normalized: EX [~ [E [true U ~ [[EX [~ [EX [~ [[p48<=1 & 1<=p48]]]]] | [~ [[p15<=1 & 1<=p15]] | EG [[[p46<=0 & 0<=p46] | [[p82<=1 & 1<=p82] | [p30<=1 & 1<=p30]]]]]]]]]]

abstracting: (1<=p30)
states: 5,505,024 (6)
abstracting: (p30<=1)
states: 11,534,336 (7)
abstracting: (1<=p82)
states: 5,505,024 (6)
abstracting: (p82<=1)
states: 11,534,336 (7)
abstracting: (0<=p46)
states: 11,534,336 (7)
abstracting: (p46<=0)
states: 6,029,312 (6)
.
EG iterations: 1
abstracting: (1<=p15)
states: 6,029,312 (6)
abstracting: (p15<=1)
states: 11,534,336 (7)
abstracting: (1<=p48)
states: 5,505,024 (6)
abstracting: (p48<=1)
states: 11,534,336 (7)
...-> the formula is FALSE

FORMULA Dekker-PT-020-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.022sec

checking: AF [[AG [[[1<=p0 & p0<=1] | [0<=p9 & p9<=0]]] | AG [[[EX [[[1<=p58 & p58<=1] & [0<=p57 & p57<=0]]] | [1<=p4 & p4<=1]] | [[0<=p2 & p2<=0] | AX [1<=0]]]]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [[[~ [EX [~ [1<=0]]] | [0<=p2 & p2<=0]] | [[1<=p4 & p4<=1] | EX [[[0<=p57 & p57<=0] & [1<=p58 & p58<=1]]]]]]]] | ~ [E [true U ~ [[[0<=p9 & p9<=0] | [1<=p0 & p0<=1]]]]]]]]]

abstracting: (p0<=1)
states: 11,534,336 (7)
abstracting: (1<=p0)
states: 5,505,024 (6)
abstracting: (p9<=0)
states: 5,505,024 (6)
abstracting: (0<=p9)
states: 11,534,336 (7)
abstracting: (p58<=1)
states: 11,534,336 (7)
abstracting: (1<=p58)
states: 5,505,024 (6)
abstracting: (p57<=0)
states: 11,010,048 (7)
abstracting: (0<=p57)
states: 11,534,336 (7)
.abstracting: (p4<=1)
states: 11,534,336 (7)
abstracting: (1<=p4)
states: 5,505,024 (6)
abstracting: (p2<=0)
states: 6,029,312 (6)
abstracting: (0<=p2)
states: 11,534,336 (7)
abstracting: (1<=0)
states: 0
.
EG iterations: 0
-> the formula is FALSE

FORMULA Dekker-PT-020-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.642sec

checking: AG [[[[EX [[p55<=1 & 1<=p55]] & EF [[p10<=0 & 0<=p10]]] | [[p13<=0 & 0<=p13] & [p65<=1 & 1<=p65]]] & AF [[[p24<=0 & 0<=p24] | [[p41<=1 & 1<=p41] | EF [[p74<=0 & 0<=p74]]]]]]]
normalized: ~ [E [true U ~ [[[[E [true U [p10<=0 & 0<=p10]] & EX [[p55<=1 & 1<=p55]]] | [[p65<=1 & 1<=p65] & [p13<=0 & 0<=p13]]] & ~ [EG [~ [[[E [true U [p74<=0 & 0<=p74]] | [p41<=1 & 1<=p41]] | [p24<=0 & 0<=p24]]]]]]]]]

abstracting: (0<=p24)
states: 11,534,336 (7)
abstracting: (p24<=0)
states: 6,029,312 (6)
abstracting: (1<=p41)
states: 524,288 (5)
abstracting: (p41<=1)
states: 11,534,336 (7)
abstracting: (0<=p74)
states: 11,534,336 (7)
abstracting: (p74<=0)
states: 6,029,312 (6)
.
EG iterations: 1
abstracting: (0<=p13)
states: 11,534,336 (7)
abstracting: (p13<=0)
states: 5,505,024 (6)
abstracting: (1<=p65)
states: 524,288 (5)
abstracting: (p65<=1)
states: 11,534,336 (7)
abstracting: (1<=p55)
states: 5,505,024 (6)
abstracting: (p55<=1)
states: 11,534,336 (7)
.abstracting: (0<=p10)
states: 11,534,336 (7)
abstracting: (p10<=0)
states: 6,029,312 (6)
-> the formula is FALSE

FORMULA Dekker-PT-020-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.723sec

checking: AG [[[[[[[p47<=1 & 1<=p47] & [[p62<=1 & 1<=p62] | [p20<=0 & 0<=p20]]] & [[p21<=0 & 0<=p21] & [p43<=1 & 1<=p43]]] | [[p84<=0 & 0<=p84] & [p83<=1 & 1<=p83]]] | [AG [E [[A [[p63<=1 & 1<=p63] U [p69<=1 & 1<=p69]] | [p42<=0 & 0<=p42]] U AF [[[p63<=0 & 0<=p63] | [p64<=1 & 1<=p64]]]]] | E [A [[0<=p61 & p61<=0] U [[1<=p30 & p30<=1] | [0<=p29 & p29<=0]]] U [[p38<=0 & 0<=p38] | [1<=p89 & p89<=1]]]]] | [[[1<=p54 & p54<=1] | EF [[[1<=p11 & p11<=1] | [0<=p7 & p7<=0]]]] | [AX [[[p3<=1 & 1<=p3] | [0<=p79 & p79<=0]]] | AF [[p5<=0 & 0<=p5]]]]]]
normalized: ~ [E [true U ~ [[[[~ [EG [~ [[p5<=0 & 0<=p5]]]] | ~ [EX [~ [[[0<=p79 & p79<=0] | [p3<=1 & 1<=p3]]]]]] | [E [true U [[0<=p7 & p7<=0] | [1<=p11 & p11<=1]]] | [1<=p54 & p54<=1]]] | [[E [[~ [EG [~ [[[0<=p29 & p29<=0] | [1<=p30 & p30<=1]]]]] & ~ [E [~ [[[0<=p29 & p29<=0] | [1<=p30 & p30<=1]]] U [~ [[0<=p61 & p61<=0]] & ~ [[[0<=p29 & p29<=0] | [1<=p30 & p30<=1]]]]]]] U [[1<=p89 & p89<=1] | [p38<=0 & 0<=p38]]] | ~ [E [true U ~ [E [[[p42<=0 & 0<=p42] | [~ [EG [~ [[p69<=1 & 1<=p69]]]] & ~ [E [~ [[p69<=1 & 1<=p69]] U [~ [[p63<=1 & 1<=p63]] & ~ [[p69<=1 & 1<=p69]]]]]]] U ~ [EG [~ [[[p64<=1 & 1<=p64] | [p63<=0 & 0<=p63]]]]]]]]]] | [[[p83<=1 & 1<=p83] & [p84<=0 & 0<=p84]] | [[[p43<=1 & 1<=p43] & [p21<=0 & 0<=p21]] & [[[p20<=0 & 0<=p20] | [p62<=1 & 1<=p62]] & [p47<=1 & 1<=p47]]]]]]]]]

abstracting: (1<=p47)
states: 524,288 (5)
abstracting: (p47<=1)
states: 11,534,336 (7)
abstracting: (1<=p62)
states: 5,505,024 (6)
abstracting: (p62<=1)
states: 11,534,336 (7)
abstracting: (0<=p20)
states: 11,534,336 (7)
abstracting: (p20<=0)
states: 6,029,312 (6)
abstracting: (0<=p21)
states: 11,534,336 (7)
abstracting: (p21<=0)
states: 5,505,024 (6)
abstracting: (1<=p43)
states: 5,505,024 (6)
abstracting: (p43<=1)
states: 11,534,336 (7)
abstracting: (0<=p84)
states: 11,534,336 (7)
abstracting: (p84<=0)
states: 11,010,048 (7)
abstracting: (1<=p83)
states: 5,505,024 (6)
abstracting: (p83<=1)
states: 11,534,336 (7)
abstracting: (0<=p63)
states: 11,534,336 (7)
abstracting: (p63<=0)
states: 11,010,048 (7)
abstracting: (1<=p64)
states: 5,505,024 (6)
abstracting: (p64<=1)
states: 11,534,336 (7)
.
EG iterations: 1
abstracting: (1<=p69)
states: 524,288 (5)
abstracting: (p69<=1)
states: 11,534,336 (7)
abstracting: (1<=p63)
states: 524,288 (5)
abstracting: (p63<=1)
states: 11,534,336 (7)
abstracting: (1<=p69)
states: 524,288 (5)
abstracting: (p69<=1)
states: 11,534,336 (7)
abstracting: (1<=p69)
states: 524,288 (5)
abstracting: (p69<=1)
states: 11,534,336 (7)
.
EG iterations: 1
abstracting: (0<=p42)
states: 11,534,336 (7)
abstracting: (p42<=0)
states: 6,029,312 (6)
abstracting: (0<=p38)
states: 11,534,336 (7)
abstracting: (p38<=0)
states: 6,029,312 (6)
abstracting: (p89<=1)
states: 11,534,336 (7)
abstracting: (1<=p89)
states: 524,288 (5)
abstracting: (p30<=1)
states: 11,534,336 (7)
abstracting: (1<=p30)
states: 5,505,024 (6)
abstracting: (p29<=0)
states: 5,505,024 (6)
abstracting: (0<=p29)
states: 11,534,336 (7)
abstracting: (p61<=0)
states: 6,029,312 (6)
abstracting: (0<=p61)
states: 11,534,336 (7)
abstracting: (p30<=1)
states: 11,534,336 (7)
abstracting: (1<=p30)
states: 5,505,024 (6)
abstracting: (p29<=0)
states: 5,505,024 (6)
abstracting: (0<=p29)
states: 11,534,336 (7)
abstracting: (p30<=1)
states: 11,534,336 (7)
abstracting: (1<=p30)
states: 5,505,024 (6)
abstracting: (p29<=0)
states: 5,505,024 (6)
abstracting: (0<=p29)
states: 11,534,336 (7)
.
EG iterations: 1
abstracting: (p54<=1)
states: 11,534,336 (7)
abstracting: (1<=p54)
states: 524,288 (5)
abstracting: (p11<=1)
states: 11,534,336 (7)
abstracting: (1<=p11)
states: 6,029,312 (6)
abstracting: (p7<=0)
states: 5,505,024 (6)
abstracting: (0<=p7)
states: 11,534,336 (7)
abstracting: (1<=p3)
states: 6,029,312 (6)
abstracting: (p3<=1)
states: 11,534,336 (7)
abstracting: (p79<=0)
states: 6,029,312 (6)
abstracting: (0<=p79)
states: 11,534,336 (7)
.abstracting: (0<=p5)
states: 11,534,336 (7)
abstracting: (p5<=0)
states: 5,505,024 (6)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Dekker-PT-020-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.716sec

totally nodes used: 3921523 (3.9e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 5843102 46740311 52583413
used/not used/entry size/cache size: 34995236 32113628 16 1024MB
basic ops cache: hits/miss/sum: 444927 2503931 2948858
used/not used/entry size/cache size: 3464064 13313152 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: 27587 199348 226935
used/not used/entry size/cache size: 197278 8191330 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 63705917
1 2959315
2 377014
3 59013
4 6934
5 623
6 46
7 2
8 0
9 0
>= 10 0

Total processing time: 0m26.888sec


BK_STOP 1678531487273

--------------------
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.004sec


iterations count:11756 (26), effective:296 (0)

initing FirstDep: 0m 0.001sec


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

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

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

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

iterations count:1124 (2), effective:3 (0)

iterations count:905 (2), effective:7 (0)

iterations count:470 (1), effective:3 (0)

iterations count:17777 (40), effective:382 (0)

iterations count:881 (2), effective:5 (0)

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

iterations count:20792 (47), effective:421 (0)

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

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

iterations count:20240 (46), effective:417 (0)

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

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

iterations count:15194 (34), effective:349 (0)

iterations count:968 (2), effective:3 (0)

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-020"
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 Dekker-PT-020, 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-167819419200017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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