fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r234-tall-167856420300457
Last Updated
May 14, 2023

About the Execution of Marcie+red for LeafsetExtension-PT-S08C3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10399.964 3600000.00 3632696.00 7312.00 TTFF?T??T??TFTTF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 13K Feb 25 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 16:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 25 16:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 25 16:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 25 16:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 254K 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 LeafsetExtension-PT-S08C3-CTLCardinality-00
FORMULA_NAME LeafsetExtension-PT-S08C3-CTLCardinality-01
FORMULA_NAME LeafsetExtension-PT-S08C3-CTLCardinality-02
FORMULA_NAME LeafsetExtension-PT-S08C3-CTLCardinality-03
FORMULA_NAME LeafsetExtension-PT-S08C3-CTLCardinality-04
FORMULA_NAME LeafsetExtension-PT-S08C3-CTLCardinality-05
FORMULA_NAME LeafsetExtension-PT-S08C3-CTLCardinality-06
FORMULA_NAME LeafsetExtension-PT-S08C3-CTLCardinality-07
FORMULA_NAME LeafsetExtension-PT-S08C3-CTLCardinality-08
FORMULA_NAME LeafsetExtension-PT-S08C3-CTLCardinality-09
FORMULA_NAME LeafsetExtension-PT-S08C3-CTLCardinality-10
FORMULA_NAME LeafsetExtension-PT-S08C3-CTLCardinality-11
FORMULA_NAME LeafsetExtension-PT-S08C3-CTLCardinality-12
FORMULA_NAME LeafsetExtension-PT-S08C3-CTLCardinality-13
FORMULA_NAME LeafsetExtension-PT-S08C3-CTLCardinality-14
FORMULA_NAME LeafsetExtension-PT-S08C3-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679504636919

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=LeafsetExtension-PT-S08C3
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 17:03:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 17:03:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 17:03:58] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2023-03-22 17:03:58] [INFO ] Transformed 462 places.
[2023-03-22 17:03:58] [INFO ] Transformed 409 transitions.
[2023-03-22 17:03:58] [INFO ] Parsed PT model containing 462 places and 409 transitions and 1324 arcs in 122 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Support contains 146 out of 462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 409/409 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 400 transition count 409
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 95 place count 367 transition count 376
Iterating global reduction 1 with 33 rules applied. Total rules applied 128 place count 367 transition count 376
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 137 place count 358 transition count 367
Iterating global reduction 1 with 9 rules applied. Total rules applied 146 place count 358 transition count 367
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 152 place count 352 transition count 361
Iterating global reduction 1 with 6 rules applied. Total rules applied 158 place count 352 transition count 361
Applied a total of 158 rules in 78 ms. Remains 352 /462 variables (removed 110) and now considering 361/409 (removed 48) transitions.
// Phase 1: matrix 361 rows 352 cols
[2023-03-22 17:03:58] [INFO ] Computed 31 place invariants in 33 ms
[2023-03-22 17:03:59] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-03-22 17:03:59] [INFO ] Invariant cache hit.
[2023-03-22 17:03:59] [INFO ] Implicit Places using invariants and state equation in 308 ms returned [45, 121, 222, 257, 291]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 788 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 347/462 places, 361/409 transitions.
Applied a total of 0 rules in 13 ms. Remains 347 /347 variables (removed 0) and now considering 361/361 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 880 ms. Remains : 347/462 places, 361/409 transitions.
Support contains 146 out of 347 places after structural reductions.
[2023-03-22 17:03:59] [INFO ] Flatten gal took : 57 ms
[2023-03-22 17:03:59] [INFO ] Flatten gal took : 23 ms
[2023-03-22 17:03:59] [INFO ] Input system was already deterministic with 361 transitions.
Support contains 145 out of 347 places (down from 146) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 378 resets, run finished after 541 ms. (steps per millisecond=18 ) properties (out of 101) seen :54
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 47) 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 47) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 47) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) seen :0
Running SMT prover for 47 properties.
// Phase 1: matrix 361 rows 347 cols
[2023-03-22 17:04:00] [INFO ] Computed 26 place invariants in 16 ms
[2023-03-22 17:04:01] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 17:04:01] [INFO ] [Real]Absence check using 1 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-22 17:04:01] [INFO ] After 401ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:47
[2023-03-22 17:04:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 17:04:01] [INFO ] [Nat]Absence check using 1 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-22 17:04:01] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :41 sat :6
[2023-03-22 17:04:02] [INFO ] After 387ms SMT Verify possible using trap constraints in natural domain returned unsat :41 sat :6
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-22 17:04:02] [INFO ] After 1067ms SMT Verify possible using all constraints in natural domain returned unsat :41 sat :6
Fused 47 Parikh solutions to 6 different solutions.
Finished Parikh walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Parikh walk visited 6 properties in 9 ms.
Successfully simplified 41 atomic propositions for a total of 16 simplifications.
FORMULA LeafsetExtension-PT-S08C3-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C3-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C3-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 17:04:02] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-22 17:04:02] [INFO ] Flatten gal took : 17 ms
[2023-03-22 17:04:02] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA LeafsetExtension-PT-S08C3-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C3-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C3-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S08C3-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 17:04:02] [INFO ] Flatten gal took : 18 ms
[2023-03-22 17:04:02] [INFO ] Input system was already deterministic with 361 transitions.
Support contains 54 out of 347 places (down from 75) after GAL structural reductions.
Computed a total of 347 stabilizing places and 361 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 347 transition count 361
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA LeafsetExtension-PT-S08C3-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 361/361 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 324 transition count 361
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 74 place count 273 transition count 310
Iterating global reduction 1 with 51 rules applied. Total rules applied 125 place count 273 transition count 310
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 170 place count 228 transition count 265
Iterating global reduction 1 with 45 rules applied. Total rules applied 215 place count 228 transition count 265
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 217 place count 226 transition count 265
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 254 place count 189 transition count 228
Iterating global reduction 2 with 37 rules applied. Total rules applied 291 place count 189 transition count 228
Discarding 14 places :
Implicit places reduction removed 14 places
Iterating post reduction 2 with 14 rules applied. Total rules applied 305 place count 175 transition count 228
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 336 place count 144 transition count 197
Iterating global reduction 3 with 31 rules applied. Total rules applied 367 place count 144 transition count 197
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 381 place count 130 transition count 183
Iterating global reduction 3 with 14 rules applied. Total rules applied 395 place count 130 transition count 183
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 409 place count 116 transition count 169
Iterating global reduction 3 with 14 rules applied. Total rules applied 423 place count 116 transition count 169
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 437 place count 102 transition count 155
Iterating global reduction 3 with 14 rules applied. Total rules applied 451 place count 102 transition count 155
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 487 place count 66 transition count 119
Iterating global reduction 3 with 36 rules applied. Total rules applied 523 place count 66 transition count 119
Applied a total of 523 rules in 51 ms. Remains 66 /347 variables (removed 281) and now considering 119/361 (removed 242) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 66/347 places, 119/361 transitions.
[2023-03-22 17:04:02] [INFO ] Flatten gal took : 5 ms
[2023-03-22 17:04:02] [INFO ] Flatten gal took : 6 ms
[2023-03-22 17:04:02] [INFO ] Input system was already deterministic with 119 transitions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 361/361 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 325 transition count 361
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 69 place count 278 transition count 314
Iterating global reduction 1 with 47 rules applied. Total rules applied 116 place count 278 transition count 314
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 157 place count 237 transition count 273
Iterating global reduction 1 with 41 rules applied. Total rules applied 198 place count 237 transition count 273
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 199 place count 236 transition count 273
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 233 place count 202 transition count 239
Iterating global reduction 2 with 34 rules applied. Total rules applied 267 place count 202 transition count 239
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 278 place count 191 transition count 239
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 301 place count 168 transition count 216
Iterating global reduction 3 with 23 rules applied. Total rules applied 324 place count 168 transition count 216
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 333 place count 159 transition count 207
Iterating global reduction 3 with 9 rules applied. Total rules applied 342 place count 159 transition count 207
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 351 place count 150 transition count 198
Iterating global reduction 3 with 9 rules applied. Total rules applied 360 place count 150 transition count 198
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 369 place count 141 transition count 189
Iterating global reduction 3 with 9 rules applied. Total rules applied 378 place count 141 transition count 189
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 399 place count 120 transition count 168
Iterating global reduction 3 with 21 rules applied. Total rules applied 420 place count 120 transition count 168
Applied a total of 420 rules in 36 ms. Remains 120 /347 variables (removed 227) and now considering 168/361 (removed 193) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 120/347 places, 168/361 transitions.
[2023-03-22 17:04:02] [INFO ] Flatten gal took : 7 ms
[2023-03-22 17:04:02] [INFO ] Flatten gal took : 7 ms
[2023-03-22 17:04:02] [INFO ] Input system was already deterministic with 168 transitions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 361/361 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 324 transition count 361
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 73 place count 274 transition count 311
Iterating global reduction 1 with 50 rules applied. Total rules applied 123 place count 274 transition count 311
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 168 place count 229 transition count 266
Iterating global reduction 1 with 45 rules applied. Total rules applied 213 place count 229 transition count 266
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 214 place count 228 transition count 266
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 251 place count 191 transition count 229
Iterating global reduction 2 with 37 rules applied. Total rules applied 288 place count 191 transition count 229
Discarding 15 places :
Implicit places reduction removed 15 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 303 place count 176 transition count 229
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 332 place count 147 transition count 200
Iterating global reduction 3 with 29 rules applied. Total rules applied 361 place count 147 transition count 200
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 374 place count 134 transition count 187
Iterating global reduction 3 with 13 rules applied. Total rules applied 387 place count 134 transition count 187
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 400 place count 121 transition count 174
Iterating global reduction 3 with 13 rules applied. Total rules applied 413 place count 121 transition count 174
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 426 place count 108 transition count 161
Iterating global reduction 3 with 13 rules applied. Total rules applied 439 place count 108 transition count 161
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 472 place count 75 transition count 128
Iterating global reduction 3 with 33 rules applied. Total rules applied 505 place count 75 transition count 128
Applied a total of 505 rules in 26 ms. Remains 75 /347 variables (removed 272) and now considering 128/361 (removed 233) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 75/347 places, 128/361 transitions.
[2023-03-22 17:04:02] [INFO ] Flatten gal took : 5 ms
[2023-03-22 17:04:02] [INFO ] Flatten gal took : 5 ms
[2023-03-22 17:04:02] [INFO ] Input system was already deterministic with 128 transitions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 361/361 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 327 transition count 361
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 66 place count 281 transition count 315
Iterating global reduction 1 with 46 rules applied. Total rules applied 112 place count 281 transition count 315
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 152 place count 241 transition count 275
Iterating global reduction 1 with 40 rules applied. Total rules applied 192 place count 241 transition count 275
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 194 place count 239 transition count 275
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 226 place count 207 transition count 243
Iterating global reduction 2 with 32 rules applied. Total rules applied 258 place count 207 transition count 243
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 2 with 10 rules applied. Total rules applied 268 place count 197 transition count 243
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 288 place count 177 transition count 223
Iterating global reduction 3 with 20 rules applied. Total rules applied 308 place count 177 transition count 223
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 315 place count 170 transition count 216
Iterating global reduction 3 with 7 rules applied. Total rules applied 322 place count 170 transition count 216
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 329 place count 163 transition count 209
Iterating global reduction 3 with 7 rules applied. Total rules applied 336 place count 163 transition count 209
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 343 place count 156 transition count 202
Iterating global reduction 3 with 7 rules applied. Total rules applied 350 place count 156 transition count 202
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 367 place count 139 transition count 185
Iterating global reduction 3 with 17 rules applied. Total rules applied 384 place count 139 transition count 185
Applied a total of 384 rules in 27 ms. Remains 139 /347 variables (removed 208) and now considering 185/361 (removed 176) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 139/347 places, 185/361 transitions.
[2023-03-22 17:04:02] [INFO ] Flatten gal took : 6 ms
[2023-03-22 17:04:02] [INFO ] Flatten gal took : 7 ms
[2023-03-22 17:04:02] [INFO ] Input system was already deterministic with 185 transitions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 361/361 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 326 transition count 361
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 66 place count 281 transition count 316
Iterating global reduction 1 with 45 rules applied. Total rules applied 111 place count 281 transition count 316
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 151 place count 241 transition count 276
Iterating global reduction 1 with 40 rules applied. Total rules applied 191 place count 241 transition count 276
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 192 place count 240 transition count 276
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 226 place count 206 transition count 242
Iterating global reduction 2 with 34 rules applied. Total rules applied 260 place count 206 transition count 242
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 2 with 11 rules applied. Total rules applied 271 place count 195 transition count 242
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 296 place count 170 transition count 217
Iterating global reduction 3 with 25 rules applied. Total rules applied 321 place count 170 transition count 217
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 330 place count 161 transition count 208
Iterating global reduction 3 with 9 rules applied. Total rules applied 339 place count 161 transition count 208
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 348 place count 152 transition count 199
Iterating global reduction 3 with 9 rules applied. Total rules applied 357 place count 152 transition count 199
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 366 place count 143 transition count 190
Iterating global reduction 3 with 9 rules applied. Total rules applied 375 place count 143 transition count 190
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 397 place count 121 transition count 168
Iterating global reduction 3 with 22 rules applied. Total rules applied 419 place count 121 transition count 168
Applied a total of 419 rules in 35 ms. Remains 121 /347 variables (removed 226) and now considering 168/361 (removed 193) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 121/347 places, 168/361 transitions.
[2023-03-22 17:04:02] [INFO ] Flatten gal took : 6 ms
[2023-03-22 17:04:02] [INFO ] Flatten gal took : 7 ms
[2023-03-22 17:04:02] [INFO ] Input system was already deterministic with 168 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 347/347 places, 361/361 transitions.
Graph (complete) has 750 edges and 347 vertex of which 322 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.3 ms
Discarding 25 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 94 place count 322 transition count 266
Reduce places removed 93 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 96 rules applied. Total rules applied 190 place count 229 transition count 263
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 193 place count 226 transition count 263
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 193 place count 226 transition count 247
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 225 place count 210 transition count 247
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 257 place count 178 transition count 215
Iterating global reduction 3 with 32 rules applied. Total rules applied 289 place count 178 transition count 215
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 300 place count 167 transition count 204
Iterating global reduction 3 with 11 rules applied. Total rules applied 311 place count 167 transition count 204
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 379 place count 133 transition count 170
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 392 place count 120 transition count 157
Iterating global reduction 3 with 13 rules applied. Total rules applied 405 place count 120 transition count 157
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 405 place count 120 transition count 156
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 407 place count 119 transition count 156
Applied a total of 407 rules in 45 ms. Remains 119 /347 variables (removed 228) and now considering 156/361 (removed 205) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 119/347 places, 156/361 transitions.
[2023-03-22 17:04:02] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-22 17:04:02] [INFO ] Flatten gal took : 7 ms
FORMULA LeafsetExtension-PT-S08C3-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 17:04:02] [INFO ] Flatten gal took : 7 ms
[2023-03-22 17:04:02] [INFO ] Input system was already deterministic with 156 transitions.
Support contains 0 out of 119 places (down from 6) after GAL structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 361/361 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 324 transition count 361
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 74 place count 273 transition count 310
Iterating global reduction 1 with 51 rules applied. Total rules applied 125 place count 273 transition count 310
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 171 place count 227 transition count 264
Iterating global reduction 1 with 46 rules applied. Total rules applied 217 place count 227 transition count 264
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 219 place count 225 transition count 264
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 258 place count 186 transition count 225
Iterating global reduction 2 with 39 rules applied. Total rules applied 297 place count 186 transition count 225
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 2 with 16 rules applied. Total rules applied 313 place count 170 transition count 225
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 345 place count 138 transition count 193
Iterating global reduction 3 with 32 rules applied. Total rules applied 377 place count 138 transition count 193
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 392 place count 123 transition count 178
Iterating global reduction 3 with 15 rules applied. Total rules applied 407 place count 123 transition count 178
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 422 place count 108 transition count 163
Iterating global reduction 3 with 15 rules applied. Total rules applied 437 place count 108 transition count 163
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 452 place count 93 transition count 148
Iterating global reduction 3 with 15 rules applied. Total rules applied 467 place count 93 transition count 148
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 505 place count 55 transition count 110
Iterating global reduction 3 with 38 rules applied. Total rules applied 543 place count 55 transition count 110
Applied a total of 543 rules in 23 ms. Remains 55 /347 variables (removed 292) and now considering 110/361 (removed 251) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 55/347 places, 110/361 transitions.
[2023-03-22 17:04:02] [INFO ] Flatten gal took : 3 ms
[2023-03-22 17:04:02] [INFO ] Flatten gal took : 4 ms
[2023-03-22 17:04:02] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 347/347 places, 361/361 transitions.
Graph (complete) has 750 edges and 347 vertex of which 325 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 94 place count 325 transition count 266
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 1 with 93 rules applied. Total rules applied 187 place count 232 transition count 266
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 187 place count 232 transition count 248
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 223 place count 214 transition count 248
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 251 place count 186 transition count 220
Iterating global reduction 2 with 28 rules applied. Total rules applied 279 place count 186 transition count 220
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 290 place count 175 transition count 209
Iterating global reduction 2 with 11 rules applied. Total rules applied 301 place count 175 transition count 209
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 373 place count 139 transition count 173
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 387 place count 125 transition count 159
Iterating global reduction 2 with 14 rules applied. Total rules applied 401 place count 125 transition count 159
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 401 place count 125 transition count 158
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 403 place count 124 transition count 158
Applied a total of 403 rules in 43 ms. Remains 124 /347 variables (removed 223) and now considering 158/361 (removed 203) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 124/347 places, 158/361 transitions.
[2023-03-22 17:04:02] [INFO ] Flatten gal took : 5 ms
[2023-03-22 17:04:02] [INFO ] Flatten gal took : 5 ms
[2023-03-22 17:04:02] [INFO ] Input system was already deterministic with 158 transitions.
[2023-03-22 17:04:02] [INFO ] Flatten gal took : 12 ms
[2023-03-22 17:04:02] [INFO ] Flatten gal took : 12 ms
[2023-03-22 17:04:02] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-22 17:04:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 347 places, 361 transitions and 1104 arcs took 3 ms.
Total runtime 4433 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: 347 NrTr: 361 NrArc: 1104)

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

net check time: 0m 0.000sec

init dd package: 0m 2.703sec


RS generation: 3m13.772sec


-> reachability set: #nodes 2074905 (2.1e+06) #states 15,265,985 (7)



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

checking: [AF [[AX [1<=0] | ~ [p5<=p305]]] & EX [0<=0]]
normalized: [~ [EG [~ [[~ [p5<=p305] | ~ [EX [~ [1<=0]]]]]]] & EX [0<=0]]

abstracting: (0<=0)
states: 15,265,985 (7)
.abstracting: (1<=0)
states: 0
.abstracting: (p5<=p305)
states: 14,990,568 (7)

before gc: list nodes free: 1609246

after gc: idd nodes used:4692584, unused:59307416; list nodes free:288220196
MC time: 8m 6.153sec

checking: EF [[EX [~ [p188<=2]] & 1<=p157]]
normalized: E [true U [1<=p157 & EX [~ [p188<=2]]]]

abstracting: (p188<=2)
states: 15,265,981 (7)
.abstracting: (1<=p157)
states: 7,723,016 (6)
-> the formula is TRUE

FORMULA LeafsetExtension-PT-S08C3-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.813sec

checking: EX [[[EF [~ [p216<=p107]] & EG [AX [p208<=0]]] | AX [1<=0]]]
normalized: EX [[~ [EX [~ [1<=0]]] | [EG [~ [EX [~ [p208<=0]]]] & E [true U ~ [p216<=p107]]]]]

abstracting: (p216<=p107)
states: 14,913,191 (7)
abstracting: (p208<=0)
states: 15,175,412 (7)
.
before gc: list nodes free: 6030656

after gc: idd nodes used:6055141, unused:57944859; list nodes free:281696121
.
before gc: list nodes free: 454171

after gc: idd nodes used:6858267, unused:57141733; list nodes free:278370359
MC time: 8m 6.057sec

checking: AG [EF [[[3<=p114 | [p311<=3 & p144<=p64]] & p44<=3]]]
normalized: ~ [E [true U ~ [E [true U [p44<=3 & [3<=p114 | [p311<=3 & p144<=p64]]]]]]]

abstracting: (p144<=p64)
states: 15,099,681 (7)
abstracting: (p311<=3)
states: 15,265,985 (7)
abstracting: (3<=p114)
states: 0
abstracting: (p44<=3)
states: 15,265,985 (7)
-> the formula is FALSE

FORMULA LeafsetExtension-PT-S08C3-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m57.951sec

checking: E [~ [[[EX [0<=0] | p206<=p149] & AX [1<=0]]] U [[~ [p224<=p183] | EF [[AX [p79<=0] | EF [p327<=p248]]]] & AX [[AX [AX [1<=0]] | ~ [p303<=p25]]]]]
normalized: E [~ [[~ [EX [~ [1<=0]]] & [p206<=p149 | EX [0<=0]]]] U [~ [EX [~ [[~ [p303<=p25] | ~ [EX [EX [~ [1<=0]]]]]]]] & [E [true U [E [true U p327<=p248] | ~ [EX [~ [p79<=0]]]]] | ~ [p224<=p183]]]]

abstracting: (p224<=p183)
states: 15,173,489 (7)
abstracting: (p79<=0)
states: 14,422,119 (7)
.abstracting: (p327<=p248)
states: 14,853,141 (7)
abstracting: (1<=0)
states: 0
MC time: 7m18.399sec

checking: EG [[AX [[[A [1<=p44 U p97<=p93] | [~ [p212<=p162] & EF [p261<=p208]]] | ~ [p233<=p21]]] | EF [3<=p190]]]
normalized: EG [[E [true U 3<=p190] | ~ [EX [~ [[~ [p233<=p21] | [[E [true U p261<=p208] & ~ [p212<=p162]] | [~ [EG [~ [p97<=p93]]] & ~ [E [~ [p97<=p93] U [~ [1<=p44] & ~ [p97<=p93]]]]]]]]]]]]

abstracting: (p97<=p93)
states: 15,175,187 (7)
abstracting: (1<=p44)
states: 94,880 (4)
abstracting: (p97<=p93)
states: 15,175,187 (7)
abstracting: (p97<=p93)
states: 15,175,187 (7)
.
before gc: list nodes free: 6560049

after gc: idd nodes used:7816919, unused:56183081; list nodes free:273532108
....................
EG iterations: 21
abstracting: (p212<=p162)
states: 14,996,612 (7)
abstracting: (p261<=p208)
states: 14,989,856 (7)
MC time: 5m51.002sec

checking: [[E [[~ [EX [[p90<=p124 & 1<=p104]]] & E [E [p89<=0 U p292<=p75] U [EF [1<=p207] | p235<=p293]]] U E [AF [[p102<=p152 & p181<=2]] U [~ [p67<=p244] | AX [3<=p43]]]] | EX [AG [p339<=1]]] & AG [~ [1<=p340]]]
normalized: [~ [E [true U 1<=p340]] & [EX [~ [E [true U ~ [p339<=1]]]] | E [[E [E [p89<=0 U p292<=p75] U [p235<=p293 | E [true U 1<=p207]]] & ~ [EX [[p90<=p124 & 1<=p104]]]] U E [~ [EG [~ [[p102<=p152 & p181<=2]]]] U [~ [EX [~ [3<=p43]]] | ~ [p67<=p244]]]]]]

abstracting: (p67<=p244)
states: 14,994,482 (7)
abstracting: (3<=p43)
states: 4

before gc: list nodes free: 5962721

after gc: idd nodes used:7507236, unused:56492764; list nodes free:275209048
.abstracting: (p181<=2)
states: 15,265,985 (7)
abstracting: (p102<=p152)
states: 15,176,211 (7)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5747016 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098232 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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.001sec

170573
iterations count:178332 (493), effective:5464 (15)

initing FirstDep: 0m 0.001sec


net_ddint.h:600: Timeout: after 485 sec


iterations count:2047 (5), effective:36 (0)

iterations count:2349 (6), effective:30 (0)

net_ddint.h:442: Timeout: after 485 sec


iterations count:1326 (3), effective:19 (0)

iterations count:2496 (6), effective:39 (0)

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

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

net_ddint.h:600: Timeout: after 437 sec


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

sat_reach.icc:155: Timeout: after 350 sec


ctl_mc.icc:221: Timeout: after 279 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="LeafsetExtension-PT-S08C3"
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 LeafsetExtension-PT-S08C3, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856420300457"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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