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.r490-tall-167912709701209.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 UtilityControlRoom-PT-Z4T4N08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912709701209
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 39K Feb 26 14:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 204K Feb 26 14:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 99K Feb 26 14:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 405K Feb 26 14:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 22K Feb 25 17:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 17:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 29K Feb 25 17:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 25 17:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 57K Feb 26 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 296K Feb 26 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 123K Feb 26 14:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 474K Feb 26 14:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 17:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Feb 25 17:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 255K Mar 5 18:23 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 UtilityControlRoom-PT-Z4T4N08-CTLCardinality-00
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-CTLCardinality-01
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-CTLCardinality-02
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-CTLCardinality-03
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-CTLCardinality-04
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-CTLCardinality-05
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-CTLCardinality-06
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-CTLCardinality-07
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-CTLCardinality-08
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-CTLCardinality-09
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-CTLCardinality-10
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-CTLCardinality-11
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-CTLCardinality-12
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-CTLCardinality-13
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-CTLCardinality-14
FORMULA_NAME UtilityControlRoom-PT-Z4T4N08-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679394901768

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=UtilityControlRoom-PT-Z4T4N08
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-21 10:35:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 10:35:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 10:35:03] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2023-03-21 10:35:03] [INFO ] Transformed 302 places.
[2023-03-21 10:35:03] [INFO ] Transformed 600 transitions.
[2023-03-21 10:35:03] [INFO ] Parsed PT model containing 302 places and 600 transitions and 1928 arcs in 121 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 302 out of 302 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Applied a total of 0 rules in 11 ms. Remains 302 /302 variables (removed 0) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 302 cols
[2023-03-21 10:35:03] [INFO ] Computed 19 place invariants in 36 ms
[2023-03-21 10:35:03] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-21 10:35:03] [INFO ] Invariant cache hit.
[2023-03-21 10:35:03] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2023-03-21 10:35:03] [INFO ] Invariant cache hit.
[2023-03-21 10:35:04] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 707 ms. Remains : 302/302 places, 472/472 transitions.
Support contains 302 out of 302 places after structural reductions.
[2023-03-21 10:35:04] [INFO ] Flatten gal took : 70 ms
[2023-03-21 10:35:04] [INFO ] Flatten gal took : 40 ms
[2023-03-21 10:35:04] [INFO ] Input system was already deterministic with 472 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 611 ms. (steps per millisecond=16 ) properties (out of 93) seen :29
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 64) seen :0
Running SMT prover for 64 properties.
[2023-03-21 10:35:05] [INFO ] Invariant cache hit.
[2023-03-21 10:35:06] [INFO ] After 421ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:64
[2023-03-21 10:35:06] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-21 10:35:06] [INFO ] After 399ms SMT Verify possible using all constraints in natural domain returned unsat :64 sat :0
Fused 64 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 64 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA UtilityControlRoom-PT-Z4T4N08-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N08-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N08-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N08-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N08-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-21 10:35:06] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-21 10:35:06] [INFO ] Flatten gal took : 24 ms
FORMULA UtilityControlRoom-PT-Z4T4N08-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N08-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z4T4N08-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-21 10:35:06] [INFO ] Flatten gal took : 24 ms
[2023-03-21 10:35:06] [INFO ] Input system was already deterministic with 472 transitions.
Support contains 177 out of 302 places (down from 179) after GAL structural reductions.
FORMULA UtilityControlRoom-PT-Z4T4N08-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 32 Pre rules applied. Total rules applied 0 place count 302 transition count 440
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 64 rules applied. Total rules applied 64 place count 270 transition count 440
Applied a total of 64 rules in 30 ms. Remains 270 /302 variables (removed 32) and now considering 440/472 (removed 32) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 270/302 places, 440/472 transitions.
[2023-03-21 10:35:06] [INFO ] Flatten gal took : 17 ms
[2023-03-21 10:35:06] [INFO ] Flatten gal took : 17 ms
[2023-03-21 10:35:06] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 206 transition count 376
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 206 transition count 376
Applied a total of 192 rules in 23 ms. Remains 206 /302 variables (removed 96) and now considering 376/472 (removed 96) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 206/302 places, 376/472 transitions.
[2023-03-21 10:35:06] [INFO ] Flatten gal took : 16 ms
[2023-03-21 10:35:06] [INFO ] Flatten gal took : 15 ms
[2023-03-21 10:35:06] [INFO ] Input system was already deterministic with 376 transitions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 95 places :
Symmetric choice reduction at 0 with 95 rule applications. Total rules 95 place count 207 transition count 377
Iterating global reduction 0 with 95 rules applied. Total rules applied 190 place count 207 transition count 377
Applied a total of 190 rules in 10 ms. Remains 207 /302 variables (removed 95) and now considering 377/472 (removed 95) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 207/302 places, 377/472 transitions.
[2023-03-21 10:35:06] [INFO ] Flatten gal took : 13 ms
[2023-03-21 10:35:06] [INFO ] Flatten gal took : 14 ms
[2023-03-21 10:35:06] [INFO ] Input system was already deterministic with 377 transitions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 92 places :
Symmetric choice reduction at 0 with 92 rule applications. Total rules 92 place count 210 transition count 380
Iterating global reduction 0 with 92 rules applied. Total rules applied 184 place count 210 transition count 380
Applied a total of 184 rules in 9 ms. Remains 210 /302 variables (removed 92) and now considering 380/472 (removed 92) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 210/302 places, 380/472 transitions.
[2023-03-21 10:35:06] [INFO ] Flatten gal took : 13 ms
[2023-03-21 10:35:06] [INFO ] Flatten gal took : 18 ms
[2023-03-21 10:35:06] [INFO ] Input system was already deterministic with 380 transitions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 94 places :
Symmetric choice reduction at 0 with 94 rule applications. Total rules 94 place count 208 transition count 378
Iterating global reduction 0 with 94 rules applied. Total rules applied 188 place count 208 transition count 378
Applied a total of 188 rules in 8 ms. Remains 208 /302 variables (removed 94) and now considering 378/472 (removed 94) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 208/302 places, 378/472 transitions.
[2023-03-21 10:35:06] [INFO ] Flatten gal took : 12 ms
[2023-03-21 10:35:06] [INFO ] Flatten gal took : 12 ms
[2023-03-21 10:35:06] [INFO ] Input system was already deterministic with 378 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Drop transitions removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 302 transition count 348
Reduce places removed 124 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 1 with 155 rules applied. Total rules applied 279 place count 178 transition count 317
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 279 place count 178 transition count 286
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 341 place count 147 transition count 286
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 344 place count 144 transition count 283
Iterating global reduction 2 with 3 rules applied. Total rules applied 347 place count 144 transition count 283
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 349 place count 142 transition count 219
Iterating global reduction 2 with 2 rules applied. Total rules applied 351 place count 142 transition count 219
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 366 place count 127 transition count 204
Iterating global reduction 2 with 15 rules applied. Total rules applied 381 place count 127 transition count 204
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 396 place count 112 transition count 174
Iterating global reduction 2 with 15 rules applied. Total rules applied 411 place count 112 transition count 174
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 426 place count 97 transition count 144
Iterating global reduction 2 with 15 rules applied. Total rules applied 441 place count 97 transition count 144
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 456 place count 97 transition count 129
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 472 place count 89 transition count 121
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 489 place count 80 transition count 113
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 521 place count 64 transition count 97
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 522 place count 64 transition count 96
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 523 place count 63 transition count 79
Ensure Unique test removed 1 places
Iterating global reduction 3 with 2 rules applied. Total rules applied 525 place count 62 transition count 79
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 533 place count 54 transition count 63
Iterating global reduction 3 with 8 rules applied. Total rules applied 541 place count 54 transition count 63
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 548 place count 47 transition count 56
Iterating global reduction 3 with 7 rules applied. Total rules applied 555 place count 47 transition count 56
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 562 place count 47 transition count 49
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 562 place count 47 transition count 43
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 574 place count 41 transition count 43
Applied a total of 574 rules in 46 ms. Remains 41 /302 variables (removed 261) and now considering 43/472 (removed 429) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 41/302 places, 43/472 transitions.
[2023-03-21 10:35:07] [INFO ] Flatten gal took : 2 ms
[2023-03-21 10:35:07] [INFO ] Flatten gal took : 2 ms
[2023-03-21 10:35:07] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 302/302 places, 472/472 transitions.
Discarding 94 places :
Symmetric choice reduction at 0 with 94 rule applications. Total rules 94 place count 208 transition count 378
Iterating global reduction 0 with 94 rules applied. Total rules applied 188 place count 208 transition count 378
Applied a total of 188 rules in 7 ms. Remains 208 /302 variables (removed 94) and now considering 378/472 (removed 94) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 208/302 places, 378/472 transitions.
[2023-03-21 10:35:07] [INFO ] Flatten gal took : 11 ms
[2023-03-21 10:35:07] [INFO ] Flatten gal took : 11 ms
[2023-03-21 10:35:07] [INFO ] Input system was already deterministic with 378 transitions.
[2023-03-21 10:35:07] [INFO ] Flatten gal took : 17 ms
[2023-03-21 10:35:07] [INFO ] Flatten gal took : 13 ms
[2023-03-21 10:35:07] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-21 10:35:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 302 places, 472 transitions and 1416 arcs took 3 ms.
Total runtime 3982 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: 302 NrTr: 472 NrArc: 1416)

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

net check time: 0m 0.000sec

init dd package: 0m 2.804sec


RS generation: 7m45.676sec


-> reachability set: #nodes 903793 (9.0e+05) #states 17,423,554,509,097 (13)



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

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

abstracting: (1<=p88)
states: 273,482,635,712 (11)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA UtilityControlRoom-PT-Z4T4N08-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m38.612sec

checking: EF [AX [AG [~ [p278<=p69]]]]
normalized: E [true U ~ [EX [E [true U p278<=p69]]]]

abstracting: (p278<=p69)
states: 17,288,644,721,777 (13)
.-> the formula is FALSE

FORMULA UtilityControlRoom-PT-Z4T4N08-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.486sec

checking: EF [EG [p50<=p299]]
normalized: E [true U EG [p50<=p299]]

abstracting: (p50<=p299)
states: 17,151,903,403,921 (13)
.
EG iterations: 1
-> the formula is TRUE

FORMULA UtilityControlRoom-PT-Z4T4N08-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m33.587sec

checking: AF [[E [[~ [AG [p203<=p230]] & ~ [p167<=0]] U [~ [p289<=0] & AX [1<=p237]]] | EF [AX [1<=0]]]]
normalized: ~ [EG [~ [[E [true U ~ [EX [~ [1<=0]]]] | E [[~ [p167<=0] & E [true U ~ [p203<=p230]]] U [~ [EX [~ [1<=p237]]] & ~ [p289<=0]]]]]]]

abstracting: (p289<=0)
states: 17,286,813,191,241 (13)
abstracting: (1<=p237)
states: 1,794,362,427,550 (12)

before gc: list nodes free: 265601

after gc: idd nodes used:2596239, unused:61403761; list nodes free:279661119
.abstracting: (p203<=p230)
states: 17,153,734,934,457 (13)
MC time: 11m58.020sec

checking: AG [[[EF [EG [EX [p235<=p241]]] | AF [1<=p154]] | EF [[EF [p201<=p49] | p138<=p118]]]]
normalized: ~ [E [true U ~ [[[E [true U EG [EX [p235<=p241]]] | ~ [EG [~ [1<=p154]]]] | E [true U [p138<=p118 | E [true U p201<=p49]]]]]]]

abstracting: (p201<=p49)
states: 17,153,734,934,457 (13)
abstracting: (p138<=p118)
states: 17,153,734,934,457 (13)
abstracting: (1<=p154)
states: 273,482,635,712 (11)

before gc: list nodes free: 6741096

after gc: idd nodes used:2844000, unused:61156000; list nodes free:278628926
.
EG iterations: 1
abstracting: (p235<=p241)
states: 17,181,328,651,465 (13)
.
EG iterations: 0
-> the formula is TRUE

FORMULA UtilityControlRoom-PT-Z4T4N08-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 7m24.859sec

checking: E [~ [EF [[~ [[p143<=p300 & 1<=p70]] & ~ [[3<=p101 | 2<=p3]]]]] U AX [EF [p55<=p285]]]
normalized: E [~ [E [true U [~ [[3<=p101 | 2<=p3]] & ~ [[p143<=p300 & 1<=p70]]]]] U ~ [EX [~ [E [true U p55<=p285]]]]]

abstracting: (p55<=p285)
states: 17,151,903,403,921 (13)
.abstracting: (1<=p70)
states: 273,482,635,712 (11)
abstracting: (p143<=p300)
states: 17,151,903,403,921 (13)
abstracting: (2<=p3)
states: 287,758,167,070 (11)
abstracting: (3<=p101)
states: 0
-> the formula is TRUE

FORMULA UtilityControlRoom-PT-Z4T4N08-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 8m15.210sec

checking: AF [[EG [sum(p261, p260, p259, p258, p257, p256, p255, p254)<=sum(p243, p242, p241, p240, p239, p238, p237, p236)] & [90<=sum(p3, p2, p1, p0) | [sum(p269, p268, p267, p266, p265, p264, p263, p262)<=p244 | [sum(p203, p202, p201, p200, p199, p198, p197, p196, p195, p194, p193, p192, p191, p190, p189, p188, p187, p186, p185, p184, p183, p182, p181, p180, p179, p178, p177, p176, p175, p174, p173, p172, p171, p170, p169, p168, p167, p166, p165, p164, p163, p162, p161, p160, p159, p158, p157, p156, p155, p154, p153, p152, p151, p150, p149, p148, p147, p146, p145, p144, p143, p142, p141, p140, p139, p138, p137, p136, p135, p134, p133, p132, p131, p130, p129, p128, p127, p126, p125, p124, p123, p122, p121, p120, p119, p118, p117, p116, p115, p114, p113, p112, p111, p110, p109, p108, p107, p106, p105, p104, p103, p102, p101, p100, p99, p98, p97, p96, p95, p94, p93, p92, p91, p90, p89, p88, p87, p86, p85, p84, p83, p82, p81, p80, p79, p78, p77, p76)<=sum(p3, p2, p1, p0) & 50<=sum(p253, p252, p251, p250, p249, p248, p247, p246)]]]]]
normalized: ~ [EG [~ [[[90<=sum(p3, p2, p1, p0) | [sum(p269, p268, p267, p266, p265, p264, p263, p262)<=p244 | [sum(p203, p202, p201, p200, p199, p198, p197, p196, p195, p194, p193, p192, p191, p190, p189, p188, p187, p186, p185, p184, p183, p182, p181, p180, p179, p178, p177, p176, p175, p174, p173, p172, p171, p170, p169, p168, p167, p166, p165, p164, p163, p162, p161, p160, p159, p158, p157, p156, p155, p154, p153, p152, p151, p150, p149, p148, p147, p146, p145, p144, p143, p142, p141, p140, p139, p138, p137, p136, p135, p134, p133, p132, p131, p130, p129, p128, p127, p126, p125, p124, p123, p122, p121, p120, p119, p118, p117, p116, p115, p114, p113, p112, p111, p110, p109, p108, p107, p106, p105, p104, p103, p102, p101, p100, p99, p98, p97, p96, p95, p94, p93, p92, p91, p90, p89, p88, p87, p86, p85, p84, p83, p82, p81, p80, p79, p78, p77, p76)<=sum(p3, p2, p1, p0) & 50<=sum(p253, p252, p251, p250, p249, p248, p247, p246)]]] & EG [sum(p261, p260, p259, p258, p257, p256, p255, p254)<=sum(p243, p242, p241, p240, p239, p238, p237, p236)]]]]]

abstracting: (sum(p261, p260, p259, p258, p257, p256, p255, p254)<=sum(p243, p242, p241, p240, p239, p238, p237, p236))
states: 1,390,599,855,145 (12)

before gc: list nodes free: 3187423

after gc: idd nodes used:5408036, unused:58591964; list nodes free:266589629
.
EG iterations: 1
abstracting: (50<=sum(p253, p252, p251, p250, p249, p248, p247, p246))
states: 0
abstracting: (sum(p203, p202, p201, p200, p199, p198, p197, p196, p195, p194, p193, p192, p191, p190, p189, p188, p187, p186, p185, p184, p183, p182, p181, p180, p179, p178, p177, p176, p175, p174, p173, p172, p171, p170, p169, p168, p167, p166, p165, p164, p163, p162, p161, p160, p159, p158, p157, p156, p155, p154, p153, p152, p151, p150, p149, p148, p147, p146, p145, p144, p143, p142, p141, p140, p139, p138, p137, p136, p135, p134, p133, p132, p131, p130, p129, p128, p127, p126, p125, p124, p123, p122, p121, p120, p119, p118, p117, p116, p115, p114, p113, p112, p111, p110, p109, p108, p107, p106, p105, p104, p103, p102, p101, p100, p99, p98, p97, p96, p95, p94, p93, p92, p91, p90, p89, p88, p87, p86, p85, p84, p83, p82, p81, p80, p79, p78, p77, p76)<=sum(p3, p2, p1, p0))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6069160 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099436 kB

BK_TIME_CONFINEMENT_REACHED

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

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


initing FirstDep: 0m 0.000sec

973465
iterations count:133433 (282), effective:1201 (2)

initing FirstDep: 0m 0.001sec


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

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

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

sat_reach.icc:155: Timeout: after 717 sec


iterations count:32580 (69), effective:994 (2)

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

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

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

iterations count:56714 (120), effective:1636 (3)

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

idd.h:1025: Timeout: after 606 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="UtilityControlRoom-PT-Z4T4N08"
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 UtilityControlRoom-PT-Z4T4N08, 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 r490-tall-167912709701209"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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