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.r106-tall-167814482800473.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 DES-PT-50a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482800473
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.4K Feb 26 15:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 15:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 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 97K 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 DES-PT-50a-CTLCardinality-00
FORMULA_NAME DES-PT-50a-CTLCardinality-01
FORMULA_NAME DES-PT-50a-CTLCardinality-02
FORMULA_NAME DES-PT-50a-CTLCardinality-03
FORMULA_NAME DES-PT-50a-CTLCardinality-04
FORMULA_NAME DES-PT-50a-CTLCardinality-05
FORMULA_NAME DES-PT-50a-CTLCardinality-06
FORMULA_NAME DES-PT-50a-CTLCardinality-07
FORMULA_NAME DES-PT-50a-CTLCardinality-08
FORMULA_NAME DES-PT-50a-CTLCardinality-09
FORMULA_NAME DES-PT-50a-CTLCardinality-10
FORMULA_NAME DES-PT-50a-CTLCardinality-11
FORMULA_NAME DES-PT-50a-CTLCardinality-12
FORMULA_NAME DES-PT-50a-CTLCardinality-13
FORMULA_NAME DES-PT-50a-CTLCardinality-14
FORMULA_NAME DES-PT-50a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678402882495

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=DES-PT-50a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 23:01:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 23:01:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 23:01:24] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-09 23:01:24] [INFO ] Transformed 314 places.
[2023-03-09 23:01:24] [INFO ] Transformed 271 transitions.
[2023-03-09 23:01:24] [INFO ] Found NUPN structural information;
[2023-03-09 23:01:24] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 122 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Support contains 115 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Applied a total of 0 rules in 26 ms. Remains 314 /314 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 314 cols
[2023-03-09 23:01:24] [INFO ] Computed 59 place invariants in 25 ms
[2023-03-09 23:01:24] [INFO ] Implicit Places using invariants in 428 ms returned [211]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 453 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 313/314 places, 257/257 transitions.
Applied a total of 0 rules in 17 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 498 ms. Remains : 313/314 places, 257/257 transitions.
Support contains 115 out of 313 places after structural reductions.
[2023-03-09 23:01:24] [INFO ] Flatten gal took : 53 ms
[2023-03-09 23:01:24] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-09 23:01:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DES-PT-50a-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 23:01:25] [INFO ] Flatten gal took : 24 ms
FORMULA DES-PT-50a-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-09 23:01:25] [INFO ] Input system was already deterministic with 257 transitions.
Support contains 98 out of 313 places (down from 115) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 219 resets, run finished after 521 ms. (steps per millisecond=19 ) properties (out of 60) seen :30
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Running SMT prover for 30 properties.
// Phase 1: matrix 257 rows 313 cols
[2023-03-09 23:01:25] [INFO ] Computed 58 place invariants in 10 ms
[2023-03-09 23:01:26] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-09 23:01:26] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 20 ms returned sat
[2023-03-09 23:01:26] [INFO ] After 362ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2023-03-09 23:01:26] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-09 23:01:26] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 127 ms returned sat
[2023-03-09 23:01:35] [INFO ] After 7705ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :30
[2023-03-09 23:01:37] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 4 ms to minimize.
[2023-03-09 23:01:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-09 23:01:38] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2023-03-09 23:01:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-09 23:01:38] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2023-03-09 23:01:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-09 23:01:39] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2023-03-09 23:01:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2023-03-09 23:01:39] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2023-03-09 23:01:39] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2023-03-09 23:01:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
[2023-03-09 23:01:42] [INFO ] After 13918ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :30
Attempting to minimize the solution found.
Minimization took 8026 ms.
[2023-03-09 23:01:50] [INFO ] After 23882ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :30
Parikh walk visited 20 properties in 1920 ms.
Support contains 27 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 257/257 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 313 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 312 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 312 transition count 254
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 312 transition count 254
Applied a total of 9 rules in 45 ms. Remains 312 /313 variables (removed 1) and now considering 254/257 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 312/313 places, 254/257 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 671462 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :{}
Probabilistic random walk after 671462 steps, saw 96552 distinct states, run finished after 3005 ms. (steps per millisecond=223 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-09 23:01:55] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-09 23:01:55] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 23:01:55] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-09 23:01:56] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-09 23:01:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 23:01:56] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 124 ms returned sat
[2023-03-09 23:01:57] [INFO ] After 621ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-09 23:01:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 23:01:57] [INFO ] After 456ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-09 23:01:57] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2023-03-09 23:01:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-09 23:01:57] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2023-03-09 23:01:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-09 23:01:58] [INFO ] After 1067ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 347 ms.
[2023-03-09 23:01:58] [INFO ] After 2386ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 3 properties in 535 ms.
Support contains 23 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 12 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 12 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-09 23:01:58] [INFO ] Invariant cache hit.
[2023-03-09 23:01:59] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-09 23:01:59] [INFO ] Invariant cache hit.
[2023-03-09 23:01:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 23:01:59] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2023-03-09 23:01:59] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-09 23:01:59] [INFO ] Invariant cache hit.
[2023-03-09 23:01:59] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 788 ms. Remains : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 11 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 7 properties.
[2023-03-09 23:01:59] [INFO ] Invariant cache hit.
[2023-03-09 23:01:59] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 23:01:59] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-09 23:01:59] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 23:02:00] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 23:02:00] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 872 ms returned sat
[2023-03-09 23:03:13] [INFO ] After 73234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 20 ms
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 21 ms
[2023-03-09 23:03:13] [INFO ] Input system was already deterministic with 257 transitions.
Computed a total of 216 stabilizing places and 211 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 6 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 312/313 places, 256/257 transitions.
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 18 ms
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 16 ms
[2023-03-09 23:03:13] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 7 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 312/313 places, 256/257 transitions.
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 15 ms
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 17 ms
[2023-03-09 23:03:13] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 6 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 312/313 places, 256/257 transitions.
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 13 ms
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 13 ms
[2023-03-09 23:03:13] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 7 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 312/313 places, 256/257 transitions.
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 14 ms
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 13 ms
[2023-03-09 23:03:13] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 19 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 312/313 places, 256/257 transitions.
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 12 ms
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 13 ms
[2023-03-09 23:03:13] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 6 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 312/313 places, 256/257 transitions.
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 11 ms
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 12 ms
[2023-03-09 23:03:13] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 8 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 312/313 places, 256/257 transitions.
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 12 ms
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 18 ms
[2023-03-09 23:03:13] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 6 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 312/313 places, 256/257 transitions.
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 10 ms
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 11 ms
[2023-03-09 23:03:13] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 6 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 312/313 places, 256/257 transitions.
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 10 ms
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 10 ms
[2023-03-09 23:03:13] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 6 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 312/313 places, 256/257 transitions.
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 10 ms
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 10 ms
[2023-03-09 23:03:13] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 6 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 312/313 places, 256/257 transitions.
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 10 ms
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 11 ms
[2023-03-09 23:03:13] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Applied a total of 0 rules in 2 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 313/313 places, 257/257 transitions.
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 10 ms
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 11 ms
[2023-03-09 23:03:13] [INFO ] Input system was already deterministic with 257 transitions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Applied a total of 0 rules in 3 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 313/313 places, 257/257 transitions.
[2023-03-09 23:03:13] [INFO ] Flatten gal took : 10 ms
[2023-03-09 23:03:14] [INFO ] Flatten gal took : 11 ms
[2023-03-09 23:03:14] [INFO ] Input system was already deterministic with 257 transitions.
[2023-03-09 23:03:14] [INFO ] Flatten gal took : 11 ms
[2023-03-09 23:03:14] [INFO ] Flatten gal took : 11 ms
[2023-03-09 23:03:14] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-09 23:03:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 313 places, 257 transitions and 1239 arcs took 2 ms.
Total runtime 109974 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: 313 NrTr: 257 NrArc: 1239)

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

net check time: 0m 0.000sec

init dd package: 0m 2.709sec


RS generation: 1m57.598sec


-> reachability set: #nodes 924077 (9.2e+05) #states 56,112,812,515,045 (13)



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

checking: AX [AX [AG [AF [[~ [[p299<=0 & 0<=p299]] & ~ [[p8<=1 & 1<=p8]]]]]]]
normalized: ~ [EX [EX [E [true U EG [~ [[~ [[p8<=1 & 1<=p8]] & ~ [[p299<=0 & 0<=p299]]]]]]]]]

abstracting: (0<=p299)
states: 56,112,812,515,045 (13)
abstracting: (p299<=0)
states: 53,399,155,801,299 (13)
abstracting: (1<=p8)
states: 1,185,288,617,384 (12)
abstracting: (p8<=1)
states: 56,112,812,515,045 (13)
...
before gc: list nodes free: 127296

after gc: idd nodes used:2477704, unused:61522296; list nodes free:269873716
.....
before gc: list nodes free: 237951

after gc: idd nodes used:3901693, unused:60098307; list nodes free:265564072
..
before gc: list nodes free: 1355460

after gc: idd nodes used:5653824, unused:58346176; list nodes free:261833681
.MC time: 4m28.733sec

checking: A [[EX [~ [AG [~ [[p302<=0 & 0<=p302]]]]] | ~ [[p180<=1 & 1<=p180]]] U [p145<=1 & 1<=p145]]
normalized: [~ [EG [~ [[p145<=1 & 1<=p145]]]] & ~ [E [~ [[p145<=1 & 1<=p145]] U [~ [[~ [[p180<=1 & 1<=p180]] | EX [E [true U [p302<=0 & 0<=p302]]]]] & ~ [[p145<=1 & 1<=p145]]]]]]

abstracting: (1<=p145)
states: 1,145,402,351,056 (12)
abstracting: (p145<=1)
states: 56,112,812,515,045 (13)
abstracting: (0<=p302)
states: 56,112,812,515,045 (13)
abstracting: (p302<=0)
states: 50,588,273,818,354 (13)

before gc: list nodes free: 1918084

after gc: idd nodes used:2407171, unused:61592829; list nodes free:278314470
.abstracting: (1<=p180)
states: 1,185,288,617,384 (12)
abstracting: (p180<=1)
states: 56,112,812,515,045 (13)
abstracting: (1<=p145)
states: 1,145,402,351,056 (12)
abstracting: (p145<=1)
states: 56,112,812,515,045 (13)

before gc: list nodes free: 4954856

after gc: idd nodes used:2527674, unused:61472326; list nodes free:277831967
MC time: 4m 8.661sec

checking: AF [AX [[[p16<=0 & 0<=p16] & [EX [[[p211<=0 & 0<=p211] & [p81<=1 & 1<=p81]]] & [AX [1<=0] | EG [[p257<=0 & 0<=p257]]]]]]]
normalized: ~ [EG [EX [~ [[[[EG [[p257<=0 & 0<=p257]] | ~ [EX [~ [1<=0]]]] & EX [[[p81<=1 & 1<=p81] & [p211<=0 & 0<=p211]]]] & [p16<=0 & 0<=p16]]]]]]

abstracting: (0<=p16)
states: 56,112,812,515,045 (13)
abstracting: (p16<=0)
states: 54,927,523,897,661 (13)
abstracting: (0<=p211)
states: 56,112,812,515,045 (13)
abstracting: (p211<=0)
states: 27,753,309,145,413 (13)
abstracting: (1<=p81)
states: 1,185,288,617,384 (12)
abstracting: (p81<=1)
states: 56,112,812,515,045 (13)
.abstracting: (1<=0)
states: 0
.abstracting: (0<=p257)
states: 56,112,812,515,045 (13)
abstracting: (p257<=0)
states: 35,378,450,595,097 (13)
...
before gc: list nodes free: 5174260

after gc: idd nodes used:4967276, unused:59032724; list nodes free:266898226
...
before gc: list nodes free: 4659886

after gc: idd nodes used:7080165, unused:56919835; list nodes free:257254121
.MC time: 3m49.559sec

checking: AX [AG [EX [[AG [[[p170<=0 & 0<=p170] | [p214<=1 & 1<=p214]]] & AF [[[p8<=0 & 0<=p8] | [p172<=1 & 1<=p172]]]]]]]
normalized: ~ [EX [E [true U ~ [EX [[~ [EG [~ [[[p172<=1 & 1<=p172] | [p8<=0 & 0<=p8]]]]] & ~ [E [true U ~ [[[p214<=1 & 1<=p214] | [p170<=0 & 0<=p170]]]]]]]]]]]

abstracting: (0<=p170)
states: 56,112,812,515,045 (13)
abstracting: (p170<=0)
states: 54,927,523,897,661 (13)
abstracting: (1<=p214)
states: 15,103,975,464,942 (13)
abstracting: (p214<=1)
states: 56,112,812,515,045 (13)

before gc: list nodes free: 2266155

after gc: idd nodes used:3418757, unused:60581243; list nodes free:273971785
MC time: 3m31.001sec

checking: EG [[EG [AX [~ [E [[p71<=1 & 1<=p71] U [p157<=1 & 1<=p157]]]]] | [[p177<=0 & 0<=p177] & AG [[p258<=0 & 0<=p258]]]]]
normalized: EG [[[~ [E [true U ~ [[p258<=0 & 0<=p258]]]] & [p177<=0 & 0<=p177]] | EG [~ [EX [E [[p71<=1 & 1<=p71] U [p157<=1 & 1<=p157]]]]]]]

abstracting: (1<=p157)
states: 1,185,288,617,384 (12)
abstracting: (p157<=1)
states: 56,112,812,515,045 (13)
abstracting: (1<=p71)
states: 1,185,288,617,384 (12)
abstracting: (p71<=1)
states: 56,112,812,515,045 (13)
.
before gc: list nodes free: 3967544

after gc: idd nodes used:3954643, unused:60045357; list nodes free:271558986
.........
before gc: list nodes free: 4493575

after gc: idd nodes used:7525140, unused:56474860; list nodes free:255313230
..MC time: 3m14.374sec

checking: AG [EF [[A [A [[p144<=1 & 1<=p144] U [p122<=0 & 0<=p122]] U AX [[p208<=1 & 1<=p208]]] | [EF [[[p228<=0 & 0<=p228] | [p123<=1 & 1<=p123]]] & EF [[[p75<=0 & 0<=p75] & [p143<=1 & 1<=p143]]]]]]]
normalized: ~ [E [true U ~ [E [true U [[E [true U [[p75<=0 & 0<=p75] & [p143<=1 & 1<=p143]]] & E [true U [[p123<=1 & 1<=p123] | [p228<=0 & 0<=p228]]]] | [~ [EG [EX [~ [[p208<=1 & 1<=p208]]]]] & ~ [E [EX [~ [[p208<=1 & 1<=p208]]] U [~ [[~ [EG [~ [[p122<=0 & 0<=p122]]]] & ~ [E [~ [[p122<=0 & 0<=p122]] U [~ [[p144<=1 & 1<=p144]] & ~ [[p122<=0 & 0<=p122]]]]]]] & EX [~ [[p208<=1 & 1<=p208]]]]]]]]]]]]

abstracting: (1<=p208)
states: 36,400,157,099,367 (13)
abstracting: (p208<=1)
states: 56,112,812,515,045 (13)
.abstracting: (0<=p122)
states: 56,112,812,515,045 (13)
abstracting: (p122<=0)
states: 54,967,410,163,989 (13)
abstracting: (1<=p144)
states: 1,145,402,351,056 (12)
abstracting: (p144<=1)
states: 56,112,812,515,045 (13)
abstracting: (0<=p122)
states: 56,112,812,515,045 (13)
abstracting: (p122<=0)
states: 54,967,410,163,989 (13)
abstracting: (0<=p122)
states: 56,112,812,515,045 (13)
abstracting: (p122<=0)
states: 54,967,410,163,989 (13)

before gc: list nodes free: 4086960

after gc: idd nodes used:4139253, unused:59860747; list nodes free:270750273
...........
before gc: list nodes free: 14972506

after gc: idd nodes used:5326757, unused:58673243; list nodes free:265461476
MC time: 3m 0.016sec

checking: AX [E [AF [[AX [[p114<=1 & 1<=p114]] | [EF [[[p310<=0 & 0<=p310] | [p272<=1 & 1<=p272]]] & [[p305<=1 & 1<=p305] | [p297<=1 & 1<=p297]]]]] U ~ [[[p108<=1 & 1<=p108] | [~ [[p235<=1 & 1<=p235]] | ~ [EF [[[p107<=0 & 0<=p107] | [p230<=1 & 1<=p230]]]]]]]]]
normalized: ~ [EX [~ [E [~ [EG [~ [[[[[p297<=1 & 1<=p297] | [p305<=1 & 1<=p305]] & E [true U [[p272<=1 & 1<=p272] | [p310<=0 & 0<=p310]]]] | ~ [EX [~ [[p114<=1 & 1<=p114]]]]]]]] U ~ [[[~ [E [true U [[p230<=1 & 1<=p230] | [p107<=0 & 0<=p107]]]] | ~ [[p235<=1 & 1<=p235]]] | [p108<=1 & 1<=p108]]]]]]]

abstracting: (1<=p108)
states: 1,145,402,351,056 (12)
abstracting: (p108<=1)
states: 56,112,812,515,045 (13)
abstracting: (1<=p235)
states: 4,514,216,162,771 (12)
abstracting: (p235<=1)
states: 56,112,812,515,045 (13)
abstracting: (0<=p107)
states: 56,112,812,515,045 (13)
abstracting: (p107<=0)
states: 54,967,410,163,989 (13)
abstracting: (1<=p230)
states: 37,228,552,459,011 (13)
abstracting: (p230<=1)
states: 56,112,812,515,045 (13)
abstracting: (1<=p114)
states: 1,145,402,351,056 (12)
abstracting: (p114<=1)
states: 56,112,812,515,045 (13)

before gc: list nodes free: 6450002

after gc: idd nodes used:5432681, unused:58567319; list nodes free:264669314
MC time: 2m46.082sec

checking: AG [[[EX [[[p244<=0 & 0<=p244] & [p214<=1 & 1<=p214]]] & [EG [[[p150<=0 & 0<=p150] & [p59<=1 & 1<=p59]]] & [[p59<=1 & 1<=p59] | [p216<=0 & 0<=p216]]]] | [EX [0<=0] & [AG [[p117<=1 & 1<=p117]] | [[p272<=0 & 0<=p272] & [[p270<=1 & 1<=p270] | [p30<=0 & 0<=p30]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[p30<=0 & 0<=p30] | [p270<=1 & 1<=p270]] & [p272<=0 & 0<=p272]] | ~ [E [true U ~ [[p117<=1 & 1<=p117]]]]] & EX [0<=0]] | [[[[p216<=0 & 0<=p216] | [p59<=1 & 1<=p59]] & EG [[[p59<=1 & 1<=p59] & [p150<=0 & 0<=p150]]]] & EX [[[p214<=1 & 1<=p214] & [p244<=0 & 0<=p244]]]]]]]]

abstracting: (0<=p244)
states: 56,112,812,515,045 (13)
abstracting: (p244<=0)
states: 20,734,361,919,949 (13)
abstracting: (1<=p214)
states: 15,103,975,464,942 (13)
abstracting: (p214<=1)
states: 56,112,812,515,045 (13)
.abstracting: (0<=p150)
states: 56,112,812,515,045 (13)
abstracting: (p150<=0)
states: 56,112,812,515,041 (13)
abstracting: (1<=p59)
states: 1,185,288,617,384 (12)
abstracting: (p59<=1)
states: 56,112,812,515,045 (13)
...........
before gc: list nodes free: 1879076

after gc: idd nodes used:8145739, unused:55854261; list nodes free:252475091
..MC time: 2m33.097sec

checking: EG [A [[AX [~ [[[p173<=1 & 1<=p173] | [p265<=1 & 1<=p265]]]] & [[p297<=1 & 1<=p297] | [[[p244<=1 & 1<=p244] & ~ [[p158<=1 & 1<=p158]]] | [EG [[[p41<=0 & 0<=p41] | [p129<=1 & 1<=p129]]] & [[p229<=1 & 1<=p229] | [p254<=0 & 0<=p254]]]]]] U [p286<=1 & 1<=p286]]]
normalized: EG [[~ [EG [~ [[p286<=1 & 1<=p286]]]] & ~ [E [~ [[p286<=1 & 1<=p286]] U [~ [[[[[[[p254<=0 & 0<=p254] | [p229<=1 & 1<=p229]] & EG [[[p129<=1 & 1<=p129] | [p41<=0 & 0<=p41]]]] | [~ [[p158<=1 & 1<=p158]] & [p244<=1 & 1<=p244]]] | [p297<=1 & 1<=p297]] & ~ [EX [[[p265<=1 & 1<=p265] | [p173<=1 & 1<=p173]]]]]] & ~ [[p286<=1 & 1<=p286]]]]]]]

abstracting: (1<=p286)
states: 2,062,398,635,617 (12)
abstracting: (p286<=1)
states: 56,112,812,515,045 (13)
abstracting: (1<=p173)
states: 1,185,288,617,384 (12)
abstracting: (p173<=1)
states: 56,112,812,515,045 (13)
abstracting: (1<=p265)
states: 20,734,361,919,948 (13)
abstracting: (p265<=1)
states: 56,112,812,515,045 (13)
.abstracting: (1<=p297)
states: 12,802,824,888,970 (13)
abstracting: (p297<=1)
states: 56,112,812,515,045 (13)
abstracting: (1<=p244)
states: 35,378,450,595,096 (13)
abstracting: (p244<=1)
states: 56,112,812,515,045 (13)
abstracting: (1<=p158)
states: 1,185,288,617,384 (12)
abstracting: (p158<=1)
states: 56,112,812,515,045 (13)
abstracting: (0<=p41)
states: 56,112,812,515,045 (13)
abstracting: (p41<=0)
states: 54,927,523,897,661 (13)
abstracting: (1<=p129)
states: 1,145,402,351,056 (12)
abstracting: (p129<=1)
states: 56,112,812,515,045 (13)

before gc: list nodes free: 1062917

after gc: idd nodes used:6830726, unused:57169274; list nodes free:258567520
..........
before gc: list nodes free: 5260942

after gc: idd nodes used:9319570, unused:54680430; list nodes free:247349308
MC time: 2m29.503sec

checking: EX [~ [A [[[EG [[[p129<=0 & 0<=p129] | [p218<=1 & 1<=p218]]] & [p212<=1 & 1<=p212]] & [[p269<=0 & 0<=p269] & ~ [[[p312<=1 & 1<=p312] | [[p146<=0 & 0<=p146] | [p87<=1 & 1<=p87]]]]]] U ~ [[[[p52<=0 & 0<=p52] | [p111<=0 & 0<=p111]] & AG [[[p86<=0 & 0<=p86] | [p10<=1 & 1<=p10]]]]]]]]
normalized: EX [~ [[~ [EG [[~ [E [true U ~ [[[p10<=1 & 1<=p10] | [p86<=0 & 0<=p86]]]]] & [[p111<=0 & 0<=p111] | [p52<=0 & 0<=p52]]]]] & ~ [E [[~ [E [true U ~ [[[p10<=1 & 1<=p10] | [p86<=0 & 0<=p86]]]]] & [[p111<=0 & 0<=p111] | [p52<=0 & 0<=p52]]] U [~ [[[~ [[[[p87<=1 & 1<=p87] | [p146<=0 & 0<=p146]] | [p312<=1 & 1<=p312]]] & [p269<=0 & 0<=p269]] & [[p212<=1 & 1<=p212] & EG [[[p218<=1 & 1<=p218] | [p129<=0 & 0<=p129]]]]]] & [~ [E [true U ~ [[[p10<=1 & 1<=p10] | [p86<=0 & 0<=p86]]]]] & [[p111<=0 & 0<=p111] | [p52<=0 & 0<=p52]]]]]]]]]

abstracting: (0<=p52)
states: 56,112,812,515,045 (13)
abstracting: (p52<=0)
states: 54,927,524,913,329 (13)
abstracting: (0<=p111)
states: 56,112,812,515,045 (13)
abstracting: (p111<=0)
states: 54,967,410,163,989 (13)
abstracting: (0<=p86)
states: 56,112,812,515,045 (13)
abstracting: (p86<=0)
states: 54,927,523,897,661 (13)
abstracting: (1<=p10)
states: 1,185,288,617,384 (12)
abstracting: (p10<=1)
states: 56,112,812,515,045 (13)
MC time: 2m10.000sec

checking: E [[EX [[~ [[p221<=1 & 1<=p221]] | [p289<=0 & 0<=p289]]] & [EF [[[A [[p252<=1 & 1<=p252] U [[p16<=0 & 0<=p16] | [p305<=1 & 1<=p305]]] & [[p65<=0 & 0<=p65] & [[p312<=0 & 0<=p312] | [p234<=1 & 1<=p234]]]] | A [[p247<=1 & 1<=p247] U [p296<=1 & 1<=p296]]]] & [[p150<=0 & 0<=p150] | [p229<=1 & 1<=p229]]]] U AF [[[p89<=1 & 1<=p89] | EX [AG [[p34<=0 & 0<=p34]]]]]]
normalized: E [[[[[p229<=1 & 1<=p229] | [p150<=0 & 0<=p150]] & E [true U [[~ [EG [~ [[p296<=1 & 1<=p296]]]] & ~ [E [~ [[p296<=1 & 1<=p296]] U [~ [[p247<=1 & 1<=p247]] & ~ [[p296<=1 & 1<=p296]]]]]] | [[[[p234<=1 & 1<=p234] | [p312<=0 & 0<=p312]] & [p65<=0 & 0<=p65]] & [~ [EG [~ [[[p305<=1 & 1<=p305] | [p16<=0 & 0<=p16]]]]] & ~ [E [~ [[[p305<=1 & 1<=p305] | [p16<=0 & 0<=p16]]] U [~ [[p252<=1 & 1<=p252]] & ~ [[[p305<=1 & 1<=p305] | [p16<=0 & 0<=p16]]]]]]]]]]] & EX [[[p289<=0 & 0<=p289] | ~ [[p221<=1 & 1<=p221]]]]] U ~ [EG [~ [[EX [~ [E [true U ~ [[p34<=0 & 0<=p34]]]]] | [p89<=1 & 1<=p89]]]]]]

abstracting: (1<=p89)
states: 1,185,288,617,384 (12)
abstracting: (p89<=1)
states: 56,112,812,515,045 (13)
abstracting: (0<=p34)
states: 56,112,812,515,045 (13)
abstracting: (p34<=0)
states: 54,927,523,897,661 (13)

before gc: list nodes free: 4569208

after gc: idd nodes used:5912835, unused:58087165; list nodes free:262701957
MC time: 2m 0.606sec

checking: E [AG [[AF [EG [[p258<=0 & 0<=p258]]] & [[[p8<=1 & 1<=p8] & [[[[p56<=1 & 1<=p56] & [p201<=0 & 0<=p201]] | [[p238<=0 & 0<=p238] & [[p110<=0 & 0<=p110] | [p247<=1 & 1<=p247]]]] & [[p3<=0 & 0<=p3] | [p204<=1 & 1<=p204]]]] | [AG [[p51<=1 & 1<=p51]] & ~ [AF [[[p102<=0 & 0<=p102] | [p32<=1 & 1<=p32]]]]]]]] U AF [[~ [AF [[[p203<=0 & 0<=p203] & [[p46<=0 & 0<=p46] | [p133<=1 & 1<=p133]]]]] & [~ [[p183<=1 & 1<=p183]] & AF [[p196<=0 & 0<=p196]]]]]]
normalized: E [~ [E [true U ~ [[[[EG [~ [[[p32<=1 & 1<=p32] | [p102<=0 & 0<=p102]]]] & ~ [E [true U ~ [[p51<=1 & 1<=p51]]]]] | [[[[p204<=1 & 1<=p204] | [p3<=0 & 0<=p3]] & [[[[p247<=1 & 1<=p247] | [p110<=0 & 0<=p110]] & [p238<=0 & 0<=p238]] | [[p201<=0 & 0<=p201] & [p56<=1 & 1<=p56]]]] & [p8<=1 & 1<=p8]]] & ~ [EG [~ [EG [[p258<=0 & 0<=p258]]]]]]]]] U ~ [EG [~ [[[~ [EG [~ [[p196<=0 & 0<=p196]]]] & ~ [[p183<=1 & 1<=p183]]] & EG [~ [[[[p133<=1 & 1<=p133] | [p46<=0 & 0<=p46]] & [p203<=0 & 0<=p203]]]]]]]]]

abstracting: (0<=p203)
states: 56,112,812,515,045 (13)
abstracting: (p203<=0)
states: 28,079,671,287,365 (13)
abstracting: (0<=p46)
states: 56,112,812,515,045 (13)
abstracting: (p46<=0)
states: 54,935,745,995,543 (13)
abstracting: (1<=p133)
states: 1,145,402,351,056 (12)
abstracting: (p133<=1)
states: 56,112,812,515,045 (13)
...
before gc: list nodes free: 6296018

after gc: idd nodes used:9323796, unused:54676204; list nodes free:247033072
.MC time: 1m50.999sec

checking: [EX [EG [[[AG [[[p280<=0 & 0<=p280] & [p214<=1 & 1<=p214]]] & [[[p113<=0 & 0<=p113] & [p55<=1 & 1<=p55]] | [p68<=1 & 1<=p68]]] | [[p244<=0 & 0<=p244] | [p87<=1 & 1<=p87]]]]] | AF [[A [[EX [[[p220<=0 & 0<=p220] | [p201<=1 & 1<=p201]]] | ~ [[[p153<=0 & 0<=p153] | [p286<=1 & 1<=p286]]]] U AX [[[p202<=0 & 0<=p202] | [p190<=1 & 1<=p190]]]] | [[[[[[p86<=0 & 0<=p86] & [p21<=1 & 1<=p21]] & [[p64<=0 & 0<=p64] & [p241<=1 & 1<=p241]]] | [[p104<=1 & 1<=p104] | [[p293<=0 & 0<=p293] & [p134<=1 & 1<=p134]]]] & [[p60<=0 & 0<=p60] & [p228<=1 & 1<=p228]]] & [[[p68<=0 & 0<=p68] & [p127<=1 & 1<=p127]] & [AF [[p280<=0 & 0<=p280]] & [[p131<=0 & 0<=p131] | [p22<=1 & 1<=p22]]]]]]]]
normalized: [~ [EG [~ [[[[[[[p22<=1 & 1<=p22] | [p131<=0 & 0<=p131]] & ~ [EG [~ [[p280<=0 & 0<=p280]]]]] & [[p127<=1 & 1<=p127] & [p68<=0 & 0<=p68]]] & [[[p228<=1 & 1<=p228] & [p60<=0 & 0<=p60]] & [[[[p134<=1 & 1<=p134] & [p293<=0 & 0<=p293]] | [p104<=1 & 1<=p104]] | [[[p241<=1 & 1<=p241] & [p64<=0 & 0<=p64]] & [[p21<=1 & 1<=p21] & [p86<=0 & 0<=p86]]]]]] | [~ [EG [EX [~ [[[p190<=1 & 1<=p190] | [p202<=0 & 0<=p202]]]]]] & ~ [E [EX [~ [[[p190<=1 & 1<=p190] | [p202<=0 & 0<=p202]]]] U [~ [[~ [[[p286<=1 & 1<=p286] | [p153<=0 & 0<=p153]]] | EX [[[p201<=1 & 1<=p201] | [p220<=0 & 0<=p220]]]]] & EX [~ [[[p190<=1 & 1<=p190] | [p202<=0 & 0<=p202]]]]]]]]]]]] | EX [EG [[[[p87<=1 & 1<=p87] | [p244<=0 & 0<=p244]] | [[[p68<=1 & 1<=p68] | [[p55<=1 & 1<=p55] & [p113<=0 & 0<=p113]]] & ~ [E [true U ~ [[[p214<=1 & 1<=p214] & [p280<=0 & 0<=p280]]]]]]]]]]

abstracting: (0<=p280)
states: 56,112,812,515,045 (13)
abstracting: (p280<=0)
states: 37,358,036,264,548 (13)
abstracting: (1<=p214)
states: 15,103,975,464,942 (13)
abstracting: (p214<=1)
states: 56,112,812,515,045 (13)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 6032692 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16098948 kB

BK_TIME_CONFINEMENT_REACHED

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

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


initing FirstDep: 0m 0.000sec

759747 872600 877317 930730 955658 899253 899880 897769 927073 912271 915225 912543 942551 927943 925551
iterations count:1533547 (5967), effective:83365 (324)

initing FirstDep: 0m 0.000sec


net_ddint.h:600: Timeout: after 267 sec


iterations count:297 (1), effective:4 (0)

sat_reach.icc:155: Timeout: after 246 sec


net_ddint.h:600: Timeout: after 227 sec


sat_reach.icc:155: Timeout: after 210 sec


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

net_ddint.h:600: Timeout: after 193 sec


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

net_ddint.h:600: Timeout: after 179 sec

1179267
iterations count:111484 (433), effective:6803 (26)

net_ddint.h:600: Timeout: after 165 sec


net_ddint.h:600: Timeout: after 152 sec


net_ddint.h:600: Timeout: after 140 sec


sat_reach.icc:155: Timeout: after 129 sec

820595
sat_reach.icc:155: Timeout: after 119 sec


net_ddint.h:600: Timeout: after 109 sec


sat_reach.icc:155: Timeout: after 101 sec

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="DES-PT-50a"
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 DES-PT-50a, 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 r106-tall-167814482800473"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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