About the Execution of Marcie+red for DLCflexbar-PT-3a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5450.472 | 11522.00 | 19187.00 | 338.50 | TFTTFTTTFFTTTTTF | 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.r106-tall-167814482800522.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 DLCflexbar-PT-3a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482800522
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.7K Feb 25 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 25 16:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 18:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Feb 25 18:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 17:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 17:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 996K 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 DLCflexbar-PT-3a-CTLFireability-00
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-01
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-02
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-03
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-04
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-05
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-06
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-07
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-08
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-09
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-10
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-11
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-12
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-13
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-14
FORMULA_NAME DLCflexbar-PT-3a-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678419520965
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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCflexbar-PT-3a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 03:38:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 03:38:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 03:38:42] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2023-03-10 03:38:42] [INFO ] Transformed 581 places.
[2023-03-10 03:38:42] [INFO ] Transformed 3891 transitions.
[2023-03-10 03:38:42] [INFO ] Found NUPN structural information;
[2023-03-10 03:38:42] [INFO ] Parsed PT model containing 581 places and 3891 transitions and 14956 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Ensure Unique test removed 455 transitions
Reduce redundant transitions removed 455 transitions.
Support contains 114 out of 581 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 581/581 places, 3436/3436 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 528 transition count 3118
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 528 transition count 3118
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 132 place count 528 transition count 3092
Drop transitions removed 1150 transitions
Redundant transition composition rules discarded 1150 transitions
Iterating global reduction 1 with 1150 rules applied. Total rules applied 1282 place count 528 transition count 1942
Applied a total of 1282 rules in 171 ms. Remains 528 /581 variables (removed 53) and now considering 1942/3436 (removed 1494) transitions.
[2023-03-10 03:38:43] [INFO ] Flow matrix only has 303 transitions (discarded 1639 similar events)
// Phase 1: matrix 303 rows 528 cols
[2023-03-10 03:38:43] [INFO ] Computed 355 place invariants in 9 ms
[2023-03-10 03:38:44] [INFO ] Implicit Places using invariants in 1267 ms returned [208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 222, 223, 224, 225, 226, 228, 229, 230, 231, 232, 233, 236, 237, 238, 239, 240, 242, 243, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 258, 259, 260, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 274, 276, 278, 279, 280, 281, 282, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 296, 297, 298, 299, 300, 301, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 314, 315, 316, 317, 318, 319, 320, 322, 323, 324, 326, 329, 331, 333, 334, 336, 337, 338, 339, 340, 341, 342, 344, 346, 347, 348, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 371, 372, 373, 374, 375, 376, 377, 379, 380, 382, 383, 384, 385, 387, 388, 389, 390, 392, 394, 395, 396, 397, 398, 399, 401, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 418, 419, 420, 421, 422, 423, 426, 428, 430, 431, 432, 434, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 452, 453, 454, 455, 456, 457, 458, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 476, 478, 479, 480, 482, 484, 485, 487, 488, 490, 493, 495, 496, 497, 498, 502, 503, 504, 505, 506, 508, 509, 510, 511, 512, 513, 516, 517, 519, 520, 521, 522, 523, 524, 525, 526]
Discarding 260 places :
Ensure Unique test removed 1181 transitions
Reduce isomorphic transitions removed 1181 transitions.
Implicit Place search using SMT only with invariants took 1449 ms to find 260 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 268/581 places, 761/3436 transitions.
Drop transitions removed 362 transitions
Redundant transition composition rules discarded 362 transitions
Iterating global reduction 0 with 362 rules applied. Total rules applied 362 place count 268 transition count 399
Applied a total of 362 rules in 14 ms. Remains 268 /268 variables (removed 0) and now considering 399/761 (removed 362) transitions.
[2023-03-10 03:38:44] [INFO ] Flow matrix only has 303 transitions (discarded 96 similar events)
// Phase 1: matrix 303 rows 268 cols
[2023-03-10 03:38:44] [INFO ] Computed 95 place invariants in 2 ms
[2023-03-10 03:38:44] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-10 03:38:44] [INFO ] Flow matrix only has 303 transitions (discarded 96 similar events)
[2023-03-10 03:38:44] [INFO ] Invariant cache hit.
[2023-03-10 03:38:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 03:38:44] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 268/581 places, 399/3436 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1950 ms. Remains : 268/581 places, 399/3436 transitions.
Support contains 114 out of 268 places after structural reductions.
[2023-03-10 03:38:44] [INFO ] Flatten gal took : 47 ms
[2023-03-10 03:38:44] [INFO ] Flatten gal took : 19 ms
[2023-03-10 03:38:45] [INFO ] Input system was already deterministic with 399 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 59) seen :57
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 03:38:45] [INFO ] Flow matrix only has 303 transitions (discarded 96 similar events)
[2023-03-10 03:38:45] [INFO ] Invariant cache hit.
[2023-03-10 03:38:45] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 03:38:45] [INFO ] [Nat]Absence check using 95 positive place invariants in 12 ms returned sat
[2023-03-10 03:38:45] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2023-03-10 03:38:45] [INFO ] Flatten gal took : 15 ms
[2023-03-10 03:38:45] [INFO ] Flatten gal took : 15 ms
[2023-03-10 03:38:45] [INFO ] Input system was already deterministic with 399 transitions.
Computed a total of 61 stabilizing places and 1 stable transitions
Graph (complete) has 493 edges and 268 vertex of which 208 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 399/399 transitions.
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 209 transition count 399
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 76 place count 192 transition count 365
Iterating global reduction 1 with 17 rules applied. Total rules applied 93 place count 192 transition count 365
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 97 place count 192 transition count 361
Applied a total of 97 rules in 9 ms. Remains 192 /268 variables (removed 76) and now considering 361/399 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 192/268 places, 361/399 transitions.
[2023-03-10 03:38:45] [INFO ] Flatten gal took : 11 ms
[2023-03-10 03:38:45] [INFO ] Flatten gal took : 10 ms
[2023-03-10 03:38:45] [INFO ] Input system was already deterministic with 361 transitions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 399/399 transitions.
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 220 transition count 399
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 62 place count 206 transition count 371
Iterating global reduction 1 with 14 rules applied. Total rules applied 76 place count 206 transition count 371
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 78 place count 206 transition count 369
Applied a total of 78 rules in 7 ms. Remains 206 /268 variables (removed 62) and now considering 369/399 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 206/268 places, 369/399 transitions.
[2023-03-10 03:38:45] [INFO ] Flatten gal took : 10 ms
[2023-03-10 03:38:45] [INFO ] Flatten gal took : 10 ms
[2023-03-10 03:38:45] [INFO ] Input system was already deterministic with 369 transitions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 399/399 transitions.
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 217 transition count 399
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 64 place count 204 transition count 373
Iterating global reduction 1 with 13 rules applied. Total rules applied 77 place count 204 transition count 373
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 81 place count 204 transition count 369
Applied a total of 81 rules in 7 ms. Remains 204 /268 variables (removed 64) and now considering 369/399 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 204/268 places, 369/399 transitions.
[2023-03-10 03:38:45] [INFO ] Flatten gal took : 9 ms
[2023-03-10 03:38:45] [INFO ] Flatten gal took : 9 ms
[2023-03-10 03:38:45] [INFO ] Input system was already deterministic with 369 transitions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 399/399 transitions.
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 212 transition count 399
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 73 place count 195 transition count 365
Iterating global reduction 1 with 17 rules applied. Total rules applied 90 place count 195 transition count 365
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 94 place count 195 transition count 361
Applied a total of 94 rules in 6 ms. Remains 195 /268 variables (removed 73) and now considering 361/399 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 195/268 places, 361/399 transitions.
[2023-03-10 03:38:45] [INFO ] Flatten gal took : 8 ms
[2023-03-10 03:38:45] [INFO ] Flatten gal took : 9 ms
[2023-03-10 03:38:45] [INFO ] Input system was already deterministic with 361 transitions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 399/399 transitions.
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 210 transition count 399
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 73 place count 195 transition count 369
Iterating global reduction 1 with 15 rules applied. Total rules applied 88 place count 195 transition count 369
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 92 place count 195 transition count 365
Applied a total of 92 rules in 5 ms. Remains 195 /268 variables (removed 73) and now considering 365/399 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 195/268 places, 365/399 transitions.
[2023-03-10 03:38:45] [INFO ] Flatten gal took : 8 ms
[2023-03-10 03:38:45] [INFO ] Flatten gal took : 8 ms
[2023-03-10 03:38:45] [INFO ] Input system was already deterministic with 365 transitions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 399/399 transitions.
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 213 transition count 399
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 71 place count 197 transition count 367
Iterating global reduction 1 with 16 rules applied. Total rules applied 87 place count 197 transition count 367
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 91 place count 197 transition count 363
Applied a total of 91 rules in 6 ms. Remains 197 /268 variables (removed 71) and now considering 363/399 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 197/268 places, 363/399 transitions.
[2023-03-10 03:38:45] [INFO ] Flatten gal took : 8 ms
[2023-03-10 03:38:45] [INFO ] Flatten gal took : 9 ms
[2023-03-10 03:38:45] [INFO ] Input system was already deterministic with 363 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 268/268 places, 399/399 transitions.
Graph (trivial) has 395 edges and 268 vertex of which 204 / 268 are part of one of the 35 SCC in 3 ms
Free SCC test removed 169 places
Ensure Unique test removed 357 transitions
Reduce isomorphic transitions removed 357 transitions.
Graph (complete) has 136 edges and 99 vertex of which 40 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.0 ms
Discarding 59 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 40 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 39 transition count 41
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 37 place count 6 transition count 8
Iterating global reduction 2 with 33 rules applied. Total rules applied 70 place count 6 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 6 transition count 7
Applied a total of 71 rules in 11 ms. Remains 6 /268 variables (removed 262) and now considering 7/399 (removed 392) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 6/268 places, 7/399 transitions.
[2023-03-10 03:38:45] [INFO ] Flatten gal took : 0 ms
[2023-03-10 03:38:45] [INFO ] Flatten gal took : 0 ms
[2023-03-10 03:38:45] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 399/399 transitions.
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 208 transition count 399
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 77 place count 191 transition count 365
Iterating global reduction 1 with 17 rules applied. Total rules applied 94 place count 191 transition count 365
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 98 place count 191 transition count 361
Applied a total of 98 rules in 5 ms. Remains 191 /268 variables (removed 77) and now considering 361/399 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 191/268 places, 361/399 transitions.
[2023-03-10 03:38:45] [INFO ] Flatten gal took : 7 ms
[2023-03-10 03:38:45] [INFO ] Flatten gal took : 8 ms
[2023-03-10 03:38:45] [INFO ] Input system was already deterministic with 361 transitions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 399/399 transitions.
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 211 transition count 399
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 73 place count 195 transition count 367
Iterating global reduction 1 with 16 rules applied. Total rules applied 89 place count 195 transition count 367
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 93 place count 195 transition count 363
Applied a total of 93 rules in 5 ms. Remains 195 /268 variables (removed 73) and now considering 363/399 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 195/268 places, 363/399 transitions.
[2023-03-10 03:38:45] [INFO ] Flatten gal took : 7 ms
[2023-03-10 03:38:45] [INFO ] Flatten gal took : 7 ms
[2023-03-10 03:38:45] [INFO ] Input system was already deterministic with 363 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 268/268 places, 399/399 transitions.
Graph (trivial) has 396 edges and 268 vertex of which 205 / 268 are part of one of the 35 SCC in 1 ms
Free SCC test removed 170 places
Ensure Unique test removed 359 transitions
Reduce isomorphic transitions removed 359 transitions.
Graph (complete) has 134 edges and 98 vertex of which 39 are kept as prefixes of interest. Removing 59 places using SCC suffix rule.0 ms
Discarding 59 places :
Also discarding 0 output transitions
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 35 place count 6 transition count 7
Iterating global reduction 0 with 33 rules applied. Total rules applied 68 place count 6 transition count 7
Applied a total of 68 rules in 3 ms. Remains 6 /268 variables (removed 262) and now considering 7/399 (removed 392) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 6/268 places, 7/399 transitions.
[2023-03-10 03:38:45] [INFO ] Flatten gal took : 1 ms
[2023-03-10 03:38:45] [INFO ] Flatten gal took : 0 ms
[2023-03-10 03:38:45] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 399/399 transitions.
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 209 transition count 399
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 75 place count 193 transition count 367
Iterating global reduction 1 with 16 rules applied. Total rules applied 91 place count 193 transition count 367
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 95 place count 193 transition count 363
Applied a total of 95 rules in 5 ms. Remains 193 /268 variables (removed 75) and now considering 363/399 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 193/268 places, 363/399 transitions.
[2023-03-10 03:38:45] [INFO ] Flatten gal took : 7 ms
[2023-03-10 03:38:45] [INFO ] Flatten gal took : 7 ms
[2023-03-10 03:38:45] [INFO ] Input system was already deterministic with 363 transitions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 399/399 transitions.
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 211 transition count 399
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 71 place count 197 transition count 371
Iterating global reduction 1 with 14 rules applied. Total rules applied 85 place count 197 transition count 371
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 89 place count 197 transition count 367
Applied a total of 89 rules in 5 ms. Remains 197 /268 variables (removed 71) and now considering 367/399 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 197/268 places, 367/399 transitions.
[2023-03-10 03:38:46] [INFO ] Flatten gal took : 7 ms
[2023-03-10 03:38:46] [INFO ] Flatten gal took : 7 ms
[2023-03-10 03:38:46] [INFO ] Input system was already deterministic with 367 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 268/268 places, 399/399 transitions.
Graph (trivial) has 385 edges and 268 vertex of which 198 / 268 are part of one of the 35 SCC in 1 ms
Free SCC test removed 163 places
Ensure Unique test removed 341 transitions
Reduce isomorphic transitions removed 341 transitions.
Graph (complete) has 152 edges and 105 vertex of which 47 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.0 ms
Discarding 58 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 47 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 46 transition count 57
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 37 place count 13 transition count 23
Iterating global reduction 2 with 33 rules applied. Total rules applied 70 place count 13 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 13 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 13 transition count 22
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 12 transition count 21
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 12 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 12 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 12 transition count 19
Applied a total of 76 rules in 6 ms. Remains 12 /268 variables (removed 256) and now considering 19/399 (removed 380) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 12/268 places, 19/399 transitions.
[2023-03-10 03:38:46] [INFO ] Flatten gal took : 1 ms
[2023-03-10 03:38:46] [INFO ] Flatten gal took : 0 ms
[2023-03-10 03:38:46] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 399/399 transitions.
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 216 transition count 399
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 64 place count 204 transition count 375
Iterating global reduction 1 with 12 rules applied. Total rules applied 76 place count 204 transition count 375
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 79 place count 204 transition count 372
Applied a total of 79 rules in 4 ms. Remains 204 /268 variables (removed 64) and now considering 372/399 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 204/268 places, 372/399 transitions.
[2023-03-10 03:38:46] [INFO ] Flatten gal took : 7 ms
[2023-03-10 03:38:46] [INFO ] Flatten gal took : 7 ms
[2023-03-10 03:38:46] [INFO ] Input system was already deterministic with 372 transitions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 399/399 transitions.
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 210 transition count 399
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 74 place count 194 transition count 367
Iterating global reduction 1 with 16 rules applied. Total rules applied 90 place count 194 transition count 367
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 94 place count 194 transition count 363
Applied a total of 94 rules in 5 ms. Remains 194 /268 variables (removed 74) and now considering 363/399 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 194/268 places, 363/399 transitions.
[2023-03-10 03:38:46] [INFO ] Flatten gal took : 7 ms
[2023-03-10 03:38:46] [INFO ] Flatten gal took : 6 ms
[2023-03-10 03:38:46] [INFO ] Input system was already deterministic with 363 transitions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 399/399 transitions.
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 219 transition count 399
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 63 place count 205 transition count 371
Iterating global reduction 1 with 14 rules applied. Total rules applied 77 place count 205 transition count 371
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 81 place count 205 transition count 367
Applied a total of 81 rules in 5 ms. Remains 205 /268 variables (removed 63) and now considering 367/399 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 205/268 places, 367/399 transitions.
[2023-03-10 03:38:46] [INFO ] Flatten gal took : 7 ms
[2023-03-10 03:38:46] [INFO ] Flatten gal took : 7 ms
[2023-03-10 03:38:46] [INFO ] Input system was already deterministic with 367 transitions.
[2023-03-10 03:38:46] [INFO ] Flatten gal took : 9 ms
[2023-03-10 03:38:46] [INFO ] Flatten gal took : 9 ms
[2023-03-10 03:38:46] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-10 03:38:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 268 places, 399 transitions and 892 arcs took 1 ms.
Total runtime 3844 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=CTLFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 268 NrTr: 399 NrArc: 892)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.006sec
net check time: 0m 0.000sec
init dd package: 0m 2.711sec
RS generation: 0m 0.056sec
-> reachability set: #nodes 1195 (1.2e+03) #states 324,440,002,441,406,250,000,000,001 (26)
starting MCC model checker
--------------------------
checking: EG [EX [[p45<=1 & 1<=p45]]]
normalized: EG [EX [[p45<=1 & 1<=p45]]]
abstracting: (1<=p45)
states: 64,888,000,488,281,250,000,000,000 (25)
abstracting: (p45<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
..
EG iterations: 1
-> the formula is TRUE
FORMULA DLCflexbar-PT-3a-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.059sec
checking: EF [AG [EF [EX [[[p194<=0 & 0<=p194] | [p245<=0 & 0<=p245]]]]]]
normalized: E [true U ~ [E [true U ~ [E [true U EX [[[p194<=0 & 0<=p194] | [p245<=0 & 0<=p245]]]]]]]]
abstracting: (0<=p245)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p245<=0)
states: 1
abstracting: (0<=p194)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p194<=0)
states: 291,996,002,197,265,625,000,000,001 (26)
.-> the formula is TRUE
FORMULA DLCflexbar-PT-3a-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.030sec
checking: EF [AG [EF [[[p195<=0 & 0<=p195] | [p242<=0 & 0<=p242]]]]]
normalized: E [true U ~ [E [true U ~ [E [true U [[p242<=0 & 0<=p242] | [p195<=0 & 0<=p195]]]]]]]
abstracting: (0<=p195)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p195<=0)
states: 291,996,002,197,265,625,000,000,001 (26)
abstracting: (0<=p242)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p242<=0)
states: 1
-> the formula is TRUE
FORMULA DLCflexbar-PT-3a-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: AF [AG [[[p174<=1 & 1<=p174] & [p227<=1 & 1<=p227]]]]
normalized: ~ [EG [E [true U ~ [[[p227<=1 & 1<=p227] & [p174<=1 & 1<=p174]]]]]]
abstracting: (1<=p174)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p174<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p227)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p227<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
EG iterations: 0
-> the formula is FALSE
FORMULA DLCflexbar-PT-3a-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: AF [EG [EX [EX [[[p190<=0 & 0<=p190] | [p246<=0 & 0<=p246]]]]]]
normalized: ~ [EG [~ [EG [EX [EX [[[p246<=0 & 0<=p246] | [p190<=0 & 0<=p190]]]]]]]]
abstracting: (0<=p190)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p190<=0)
states: 291,996,002,197,265,625,000,000,001 (26)
abstracting: (0<=p246)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p246<=0)
states: 1
..
EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE
FORMULA DLCflexbar-PT-3a-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.019sec
checking: EX [AG [~ [A [~ [AF [[[p161<=1 & 1<=p161] & [p217<=1 & 1<=p217]]]] U EG [[[p131<=1 & 1<=p131] & [p236<=1 & 1<=p236]]]]]]]
normalized: EX [~ [E [true U [~ [EG [~ [EG [[[p236<=1 & 1<=p236] & [p131<=1 & 1<=p131]]]]]] & ~ [E [~ [EG [[[p236<=1 & 1<=p236] & [p131<=1 & 1<=p131]]]] U [~ [EG [~ [[[p217<=1 & 1<=p217] & [p161<=1 & 1<=p161]]]]] & ~ [EG [[[p236<=1 & 1<=p236] & [p131<=1 & 1<=p131]]]]]]]]]]]
abstracting: (1<=p131)
states: 54,073,333,740,234,375,000,000,000 (25)
abstracting: (p131<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p236)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p236<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
.
EG iterations: 1
abstracting: (1<=p161)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p161<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p217)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p217<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
.
EG iterations: 1
abstracting: (1<=p131)
states: 54,073,333,740,234,375,000,000,000 (25)
abstracting: (p131<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p236)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p236<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
.
EG iterations: 1
abstracting: (1<=p131)
states: 54,073,333,740,234,375,000,000,000 (25)
abstracting: (p131<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p236)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p236<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is FALSE
FORMULA DLCflexbar-PT-3a-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.055sec
checking: EF [EG [~ [E [[[p196<=1 & 1<=p196] & [p248<=1 & 1<=p248]] U [[p171<=1 & 1<=p171] & [p218<=1 & 1<=p218]]]]]]
normalized: E [true U EG [~ [E [[[p248<=1 & 1<=p248] & [p196<=1 & 1<=p196]] U [[p218<=1 & 1<=p218] & [p171<=1 & 1<=p171]]]]]]
abstracting: (1<=p171)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p171<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p218)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p218<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p196)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p196<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p248)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p248<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
.
EG iterations: 1
-> the formula is TRUE
FORMULA DLCflexbar-PT-3a-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.058sec
checking: AG [EX [[[p190<=0 & 0<=p190] | [[p239<=0 & 0<=p239] | [[p123<=1 & 1<=p123] & [p248<=1 & 1<=p248]]]]]]
normalized: ~ [E [true U ~ [EX [[[[[p248<=1 & 1<=p248] & [p123<=1 & 1<=p123]] | [p239<=0 & 0<=p239]] | [p190<=0 & 0<=p190]]]]]]
abstracting: (0<=p190)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p190<=0)
states: 291,996,002,197,265,625,000,000,001 (26)
abstracting: (0<=p239)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p239<=0)
states: 1
abstracting: (1<=p123)
states: 54,073,333,740,234,375,000,000,000 (25)
abstracting: (p123<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p248)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p248<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
.-> the formula is TRUE
FORMULA DLCflexbar-PT-3a-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: A [~ [AX [E [[[p112<=1 & 1<=p112] & [p257<=1 & 1<=p257]] U AX [[[p176<=1 & 1<=p176] & [p219<=1 & 1<=p219]]]]]] U [[p183<=1 & 1<=p183] & [p233<=1 & 1<=p233]]]
normalized: [~ [EG [~ [[[p233<=1 & 1<=p233] & [p183<=1 & 1<=p183]]]]] & ~ [E [~ [[[p233<=1 & 1<=p233] & [p183<=1 & 1<=p183]]] U [~ [EX [~ [E [[[p257<=1 & 1<=p257] & [p112<=1 & 1<=p112]] U ~ [EX [~ [[[p219<=1 & 1<=p219] & [p176<=1 & 1<=p176]]]]]]]]] & ~ [[[p233<=1 & 1<=p233] & [p183<=1 & 1<=p183]]]]]]]
abstracting: (1<=p183)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p183<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p233)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p233<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p176)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p176<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p219)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p219<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
.abstracting: (1<=p112)
states: 46,348,571,777,343,750,000,000,000 (25)
abstracting: (p112<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p257)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p257<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
.abstracting: (1<=p183)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p183<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p233)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p233<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p183)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p183<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p233)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p233<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
.
EG iterations: 1
-> the formula is FALSE
FORMULA DLCflexbar-PT-3a-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.046sec
checking: EG [EX [[[[p178<=0 & 0<=p178] | [p234<=0 & 0<=p234]] | [[[p168<=1 & 1<=p168] & [p221<=1 & 1<=p221]] | [[p203<=1 & 1<=p203] & [p253<=1 & 1<=p253]]]]]]
normalized: EG [EX [[[[[p253<=1 & 1<=p253] & [p203<=1 & 1<=p203]] | [[p221<=1 & 1<=p221] & [p168<=1 & 1<=p168]]] | [[p234<=0 & 0<=p234] | [p178<=0 & 0<=p178]]]]]
abstracting: (0<=p178)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p178<=0)
states: 291,996,002,197,265,625,000,000,001 (26)
abstracting: (0<=p234)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p234<=0)
states: 1
abstracting: (1<=p168)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p168<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p221)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p221<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p203)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p203<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p253)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p253<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
.
EG iterations: 0
-> the formula is TRUE
FORMULA DLCflexbar-PT-3a-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.025sec
checking: AG [E [[EG [AX [[[p174<=1 & 1<=p174] & [p225<=1 & 1<=p225]]]] | [[p205<=1 & 1<=p205] & [p267<=1 & 1<=p267]]] U EF [~ [A [[[p205<=1 & 1<=p205] & [p252<=1 & 1<=p252]] U [[p207<=1 & 1<=p207] & [p260<=1 & 1<=p260]]]]]]]
normalized: ~ [E [true U ~ [E [[[[p267<=1 & 1<=p267] & [p205<=1 & 1<=p205]] | EG [~ [EX [~ [[[p225<=1 & 1<=p225] & [p174<=1 & 1<=p174]]]]]]] U E [true U ~ [[~ [EG [~ [[[p260<=1 & 1<=p260] & [p207<=1 & 1<=p207]]]]] & ~ [E [~ [[[p260<=1 & 1<=p260] & [p207<=1 & 1<=p207]]] U [~ [[[p252<=1 & 1<=p252] & [p205<=1 & 1<=p205]]] & ~ [[[p260<=1 & 1<=p260] & [p207<=1 & 1<=p207]]]]]]]]]]]]]
abstracting: (1<=p207)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p207<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p260)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p260<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p205)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p205<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p252)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p252<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p207)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p207<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p260)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p260<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p207)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p207<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p260)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p260<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
..
EG iterations: 2
abstracting: (1<=p174)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p174<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p225)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p225<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
..
EG iterations: 1
abstracting: (1<=p205)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p205<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p267)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p267<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
-> the formula is TRUE
FORMULA DLCflexbar-PT-3a-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.064sec
checking: EF [EX [A [[AG [[[p20<=1 & 1<=p20] & [p219<=1 & 1<=p219]]] | [E [[[p201<=1 & 1<=p201] & [p252<=1 & 1<=p252]] U [[p166<=1 & 1<=p166] & [p210<=1 & 1<=p210]]] & AF [[[p166<=1 & 1<=p166] & [p208<=1 & 1<=p208]]]]] U AG [EF [[[p186<=1 & 1<=p186] & [p230<=1 & 1<=p230]]]]]]]
normalized: E [true U EX [[~ [EG [E [true U ~ [E [true U [[p230<=1 & 1<=p230] & [p186<=1 & 1<=p186]]]]]]] & ~ [E [E [true U ~ [E [true U [[p230<=1 & 1<=p230] & [p186<=1 & 1<=p186]]]]] U [~ [[[~ [EG [~ [[[p208<=1 & 1<=p208] & [p166<=1 & 1<=p166]]]]] & E [[[p252<=1 & 1<=p252] & [p201<=1 & 1<=p201]] U [[p210<=1 & 1<=p210] & [p166<=1 & 1<=p166]]]] | ~ [E [true U ~ [[[p219<=1 & 1<=p219] & [p20<=1 & 1<=p20]]]]]]] & E [true U ~ [E [true U [[p230<=1 & 1<=p230] & [p186<=1 & 1<=p186]]]]]]]]]]]
abstracting: (1<=p186)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p186<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p230)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p230<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p20)
states: 64,888,000,488,281,250,000,000,000 (25)
abstracting: (p20<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p219)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p219<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p166)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p166<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p210)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p210<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p201)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p201<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p252)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p252<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p166)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p166<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p208)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p208<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
.
EG iterations: 1
abstracting: (1<=p186)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p186<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p230)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p230<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p186)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p186<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p230)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p230<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA DLCflexbar-PT-3a-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.090sec
checking: EG [[[EF [[[p186<=1 & 1<=p186] & [p229<=1 & 1<=p229]]] & [[p137<=0 & 0<=p137] | [p261<=0 & 0<=p261]]] | [AX [[[p188<=1 & 1<=p188] & [p239<=1 & 1<=p239]]] & [AX [[[p203<=0 & 0<=p203] | [p250<=0 & 0<=p250]]] | [[[p119<=1 & 1<=p119] & [p259<=1 & 1<=p259]] | [AG [[[p166<=0 & 0<=p166] | [p214<=0 & 0<=p214]]] & [[[p205<=0 & 0<=p205] | [p262<=0 & 0<=p262]] & [[p163<=0 & 0<=p163] | [p215<=0 & 0<=p215]]]]]]]]]
normalized: EG [[[[[[[[[p215<=0 & 0<=p215] | [p163<=0 & 0<=p163]] & [[p262<=0 & 0<=p262] | [p205<=0 & 0<=p205]]] & ~ [E [true U ~ [[[p214<=0 & 0<=p214] | [p166<=0 & 0<=p166]]]]]] | [[p259<=1 & 1<=p259] & [p119<=1 & 1<=p119]]] | ~ [EX [~ [[[p250<=0 & 0<=p250] | [p203<=0 & 0<=p203]]]]]] & ~ [EX [~ [[[p239<=1 & 1<=p239] & [p188<=1 & 1<=p188]]]]]] | [[[p261<=0 & 0<=p261] | [p137<=0 & 0<=p137]] & E [true U [[p229<=1 & 1<=p229] & [p186<=1 & 1<=p186]]]]]]
abstracting: (1<=p186)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p186<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p229)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p229<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (0<=p137)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p137<=0)
states: 270,366,668,701,171,875,000,000,001 (26)
abstracting: (0<=p261)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p261<=0)
states: 1
abstracting: (1<=p188)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p188<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p239)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p239<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
.abstracting: (0<=p203)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p203<=0)
states: 291,996,002,197,265,625,000,000,001 (26)
abstracting: (0<=p250)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p250<=0)
states: 1
.abstracting: (1<=p119)
states: 54,073,333,740,234,375,000,000,000 (25)
abstracting: (p119<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p259)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p259<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (0<=p166)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p166<=0)
states: 291,996,002,197,265,625,000,000,001 (26)
abstracting: (0<=p214)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p214<=0)
states: 1
abstracting: (0<=p205)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p205<=0)
states: 291,996,002,197,265,625,000,000,001 (26)
abstracting: (0<=p262)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p262<=0)
states: 1
abstracting: (0<=p163)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p163<=0)
states: 291,996,002,197,265,625,000,000,001 (26)
abstracting: (0<=p215)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p215<=0)
states: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA DLCflexbar-PT-3a-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.059sec
checking: EF [AX [[A [[[[[p166<=1 & 1<=p166] & [p211<=1 & 1<=p211]] & [[p170<=1 & 1<=p170] & [p224<=1 & 1<=p224]]] | [[[p206<=1 & 1<=p206] & [p258<=1 & 1<=p258]] & [[p117<=1 & 1<=p117] & [p224<=1 & 1<=p224]]]] U EF [[[p181<=1 & 1<=p181] & [p231<=1 & 1<=p231]]]] | [EG [[[p90<=1 & 1<=p90] & [[p254<=1 & 1<=p254] & [p109<=1 & 1<=p109]]]] | [[EG [[[p195<=1 & 1<=p195] & [p245<=1 & 1<=p245]]] & [p191<=1 & 1<=p191]] & [[p247<=1 & 1<=p247] & [[[p177<=1 & 1<=p177] & [p226<=1 & 1<=p226]] | [[p184<=1 & 1<=p184] & [p237<=1 & 1<=p237]]]]]]]]]
normalized: E [true U ~ [EX [~ [[[[[[[[p237<=1 & 1<=p237] & [p184<=1 & 1<=p184]] | [[p226<=1 & 1<=p226] & [p177<=1 & 1<=p177]]] & [p247<=1 & 1<=p247]] & [[p191<=1 & 1<=p191] & EG [[[p245<=1 & 1<=p245] & [p195<=1 & 1<=p195]]]]] | EG [[[[p109<=1 & 1<=p109] & [p254<=1 & 1<=p254]] & [p90<=1 & 1<=p90]]]] | [~ [EG [~ [E [true U [[p231<=1 & 1<=p231] & [p181<=1 & 1<=p181]]]]]] & ~ [E [~ [E [true U [[p231<=1 & 1<=p231] & [p181<=1 & 1<=p181]]]] U [~ [[[[[p224<=1 & 1<=p224] & [p117<=1 & 1<=p117]] & [[p258<=1 & 1<=p258] & [p206<=1 & 1<=p206]]] | [[[p224<=1 & 1<=p224] & [p170<=1 & 1<=p170]] & [[p211<=1 & 1<=p211] & [p166<=1 & 1<=p166]]]]] & ~ [E [true U [[p231<=1 & 1<=p231] & [p181<=1 & 1<=p181]]]]]]]]]]]]]
abstracting: (1<=p181)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p181<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p231)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p231<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p166)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p166<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p211)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p211<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p170)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p170<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p224)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p224<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p206)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p206<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p258)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p258<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p117)
states: 64,888,000,488,281,250,000,000,000 (25)
abstracting: (p117<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p224)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p224<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p181)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p181<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p231)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p231<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p181)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p181<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p231)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p231<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
.
EG iterations: 1
abstracting: (1<=p90)
states: 64,888,000,488,281,250,000,000,000 (25)
abstracting: (p90<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p254)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p254<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p109)
states: 46,348,571,777,343,750,000,000,000 (25)
abstracting: (p109<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
.
EG iterations: 1
abstracting: (1<=p195)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p195<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p245)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p245<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
.
EG iterations: 1
abstracting: (1<=p191)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p191<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p247)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p247<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p177)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p177<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p226)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p226<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p184)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p184<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p237)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p237<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
.-> the formula is TRUE
FORMULA DLCflexbar-PT-3a-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.062sec
checking: EX [E [E [[E [[[p85<=1 & 1<=p85] & [p213<=1 & 1<=p213]] U [[p206<=1 & 1<=p206] & [p255<=1 & 1<=p255]]] | [AX [[p33<=1 & 1<=p33]] | [[[p204<=1 & 1<=p204] & [p256<=1 & 1<=p256]] & [[p157<=1 & 1<=p157] & [p263<=1 & 1<=p263]]]]] U AX [[[[p160<=1 & 1<=p160] & [p212<=1 & 1<=p212]] & [[p175<=1 & 1<=p175] & [p220<=1 & 1<=p220]]]]] U E [EX [[[p183<=1 & 1<=p183] & [p266<=1 & 1<=p266]]] U A [[[[p158<=1 & 1<=p158] & [p209<=1 & 1<=p209]] & [[p190<=1 & 1<=p190] & [p240<=1 & 1<=p240]]] U E [[[p207<=1 & 1<=p207] & [p249<=1 & 1<=p249]] U [[p204<=1 & 1<=p204] & [p260<=1 & 1<=p260]]]]]]]
normalized: EX [E [E [[[[[[p263<=1 & 1<=p263] & [p157<=1 & 1<=p157]] & [[p256<=1 & 1<=p256] & [p204<=1 & 1<=p204]]] | ~ [EX [~ [[p33<=1 & 1<=p33]]]]] | E [[[p213<=1 & 1<=p213] & [p85<=1 & 1<=p85]] U [[p255<=1 & 1<=p255] & [p206<=1 & 1<=p206]]]] U ~ [EX [~ [[[[p220<=1 & 1<=p220] & [p175<=1 & 1<=p175]] & [[p212<=1 & 1<=p212] & [p160<=1 & 1<=p160]]]]]]] U E [EX [[[p266<=1 & 1<=p266] & [p183<=1 & 1<=p183]]] U [~ [EG [~ [E [[[p249<=1 & 1<=p249] & [p207<=1 & 1<=p207]] U [[p260<=1 & 1<=p260] & [p204<=1 & 1<=p204]]]]]] & ~ [E [~ [E [[[p249<=1 & 1<=p249] & [p207<=1 & 1<=p207]] U [[p260<=1 & 1<=p260] & [p204<=1 & 1<=p204]]]] U [~ [[[[p240<=1 & 1<=p240] & [p190<=1 & 1<=p190]] & [[p209<=1 & 1<=p209] & [p158<=1 & 1<=p158]]]] & ~ [E [[[p249<=1 & 1<=p249] & [p207<=1 & 1<=p207]] U [[p260<=1 & 1<=p260] & [p204<=1 & 1<=p204]]]]]]]]]]]
abstracting: (1<=p204)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p204<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p260)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p260<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p207)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p207<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p249)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p249<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p158)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p158<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p209)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p209<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p190)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p190<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p240)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p240<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p204)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p204<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p260)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p260<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p207)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p207<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p249)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p249<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p204)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p204<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p260)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p260<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p207)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p207<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p249)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p249<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
.
EG iterations: 1
abstracting: (1<=p183)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p183<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p266)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p266<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
.abstracting: (1<=p160)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p160<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p212)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p212<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p175)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p175<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p220)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p220<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
.abstracting: (1<=p206)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p206<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p255)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p255<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p85)
states: 64,888,000,488,281,250,000,000,000 (25)
abstracting: (p85<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p213)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p213<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p33)
states: 64,888,000,488,281,250,000,000,000 (25)
abstracting: (p33<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
.abstracting: (1<=p204)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p204<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p256)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p256<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p157)
states: 54,073,333,740,234,375,000,000,000 (25)
abstracting: (p157<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p263)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p263<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
.-> the formula is FALSE
FORMULA DLCflexbar-PT-3a-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.204sec
checking: EF [[[AG [[[[p238<=0 & 0<=p238] | [p153<=0 & 0<=p153]] & [E [[[p176<=1 & 1<=p176] & [p221<=1 & 1<=p221]] U [p83<=1 & 1<=p83]] | [[[[p90<=0 & 0<=p90] | [p254<=0 & 0<=p254]] & [[p173<=0 & 0<=p173] | [p264<=0 & 0<=p264]]] | [[p192<=1 & 1<=p192] & [p244<=1 & 1<=p244]]]]]] & [[p58<=1 & 1<=p58] & [p175<=1 & 1<=p175]]] & [[[p265<=1 & 1<=p265] & [AX [[[p196<=1 & 1<=p196] & [p241<=1 & 1<=p241]]] | ~ [E [~ [[[p140<=1 & 1<=p140] & [p217<=1 & 1<=p217]]] U AG [[[p196<=1 & 1<=p196] & [p243<=1 & 1<=p243]]]]]]] & [[[AX [[p34<=0 & 0<=p34]] | ~ [E [[[p186<=1 & 1<=p186] & [p228<=1 & 1<=p228]] U [p146<=1 & 1<=p146]]]] | [[p90<=0 & 0<=p90] | [p223<=0 & 0<=p223]]] & [[p162<=0 & 0<=p162] | [p216<=0 & 0<=p216]]]]]]
normalized: E [true U [[[[[p216<=0 & 0<=p216] | [p162<=0 & 0<=p162]] & [[[p223<=0 & 0<=p223] | [p90<=0 & 0<=p90]] | [~ [E [[[p228<=1 & 1<=p228] & [p186<=1 & 1<=p186]] U [p146<=1 & 1<=p146]]] | ~ [EX [~ [[p34<=0 & 0<=p34]]]]]]] & [[~ [E [~ [[[p217<=1 & 1<=p217] & [p140<=1 & 1<=p140]]] U ~ [E [true U ~ [[[p243<=1 & 1<=p243] & [p196<=1 & 1<=p196]]]]]]] | ~ [EX [~ [[[p241<=1 & 1<=p241] & [p196<=1 & 1<=p196]]]]]] & [p265<=1 & 1<=p265]]] & [[[p175<=1 & 1<=p175] & [p58<=1 & 1<=p58]] & ~ [E [true U ~ [[[[[[p244<=1 & 1<=p244] & [p192<=1 & 1<=p192]] | [[[p264<=0 & 0<=p264] | [p173<=0 & 0<=p173]] & [[p254<=0 & 0<=p254] | [p90<=0 & 0<=p90]]]] | E [[[p221<=1 & 1<=p221] & [p176<=1 & 1<=p176]] U [p83<=1 & 1<=p83]]] & [[p153<=0 & 0<=p153] | [p238<=0 & 0<=p238]]]]]]]]]
abstracting: (0<=p238)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p238<=0)
states: 1
abstracting: (0<=p153)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p153<=0)
states: 270,366,668,701,171,875,000,000,001 (26)
abstracting: (1<=p83)
states: 64,888,000,488,281,250,000,000,000 (25)
abstracting: (p83<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p176)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p176<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p221)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p221<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (0<=p90)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p90<=0)
states: 259,552,001,953,125,000,000,000,001 (26)
abstracting: (0<=p254)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p254<=0)
states: 1
abstracting: (0<=p173)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p173<=0)
states: 291,996,002,197,265,625,000,000,001 (26)
abstracting: (0<=p264)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p264<=0)
states: 1
abstracting: (1<=p192)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p192<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p244)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p244<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p58)
states: 64,888,000,488,281,250,000,000,000 (25)
abstracting: (p58<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p175)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p175<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p265)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p265<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p196)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p196<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p241)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p241<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
.abstracting: (1<=p196)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p196<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p243)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p243<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p140)
states: 54,073,333,740,234,375,000,000,000 (25)
abstracting: (p140<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p217)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p217<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (0<=p34)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p34<=0)
states: 259,552,001,953,125,000,000,000,001 (26)
.abstracting: (1<=p146)
states: 54,073,333,740,234,375,000,000,000 (25)
abstracting: (p146<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p186)
states: 32,444,000,244,140,625,000,000,000 (25)
abstracting: (p186<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (1<=p228)
states: 324,440,002,441,406,250,000,000,000 (26)
abstracting: (p228<=1)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (0<=p90)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p90<=0)
states: 259,552,001,953,125,000,000,000,001 (26)
abstracting: (0<=p223)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p223<=0)
states: 1
abstracting: (0<=p162)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p162<=0)
states: 291,996,002,197,265,625,000,000,001 (26)
abstracting: (0<=p216)
states: 324,440,002,441,406,250,000,000,001 (26)
abstracting: (p216<=0)
states: 1
-> the formula is FALSE
FORMULA DLCflexbar-PT-3a-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.088sec
totally nodes used: 223863 (2.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1399597 3440730 4840327
used/not used/entry size/cache size: 3486989 63621875 16 1024MB
basic ops cache: hits/miss/sum: 108723 282441 391164
used/not used/entry size/cache size: 446340 16330876 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 8357 18013 26370
used/not used/entry size/cache size: 18004 8370604 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66889757
1 214438
2 4582
3 87
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.308sec
BK_STOP 1678419532487
--------------------
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 CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:2195 (5), effective:173 (0)
initing FirstDep: 0m 0.000sec
iterations count:399 (1), effective:0 (0)
iterations count:399 (1), effective:0 (0)
iterations count:401 (1), effective:1 (0)
iterations count:399 (1), effective:0 (0)
iterations count:402 (1), effective:1 (0)
iterations count:847 (2), effective:10 (0)
iterations count:807 (2), effective:6 (0)
iterations count:482 (1), effective:9 (0)
iterations count:411 (1), effective:2 (0)
iterations count:401 (1), effective:1 (0)
iterations count:493 (1), effective:1 (0)
iterations count:399 (1), effective:0 (0)
iterations count:922 (2), effective:10 (0)
iterations count:402 (1), effective:1 (0)
iterations count:457 (1), effective:9 (0)
iterations count:922 (2), effective:10 (0)
iterations count:922 (2), effective:10 (0)
iterations count:399 (1), effective:0 (0)
iterations count:922 (2), effective:10 (0)
iterations count:842 (2), effective:10 (0)
iterations count:887 (2), effective:10 (0)
iterations count:887 (2), effective:10 (0)
iterations count:887 (2), effective:10 (0)
iterations count:399 (1), effective:0 (0)
iterations count:399 (1), effective:0 (0)
iterations count:399 (1), effective:0 (0)
iterations count:408 (1), effective:1 (0)
iterations count:399 (1), effective:0 (0)
iterations count:618 (1), effective:9 (0)
iterations count:617 (1), effective:9 (0)
iterations count:399 (1), effective:0 (0)
iterations count:415 (1), effective:4 (0)
iterations count:959 (2), effective:13 (0)
iterations count:409 (1), effective:1 (0)
iterations count:421 (1), effective:5 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DLCflexbar-PT-3a"
export BK_EXAMINATION="CTLFireability"
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 DLCflexbar-PT-3a, examination is CTLFireability"
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-167814482800522"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCflexbar-PT-3a.tgz
mv DLCflexbar-PT-3a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;