Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813696000609.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is CANConstruction-PT-005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696000609
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 11K Feb 25 21:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 21:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 21:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 21:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 25 21:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 25 21:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 21:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 25 21:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 167K 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 CANConstruction-PT-005-CTLCardinality-00
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-01
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-02
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-03
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-04
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-05
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-06
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-07
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-08
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-09
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-10
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-11
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-12
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-13
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-14
FORMULA_NAME CANConstruction-PT-005-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678735912420

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=CANConstruction-PT-005
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 19:31:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 19:31:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:31:54] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2023-03-13 19:31:54] [INFO ] Transformed 112 places.
[2023-03-13 19:31:54] [INFO ] Transformed 140 transitions.
[2023-03-13 19:31:54] [INFO ] Parsed PT model containing 112 places and 140 transitions and 400 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
Support contains 93 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 140/140 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 136
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 136
Applied a total of 4 rules in 15 ms. Remains 110 /112 variables (removed 2) and now considering 136/140 (removed 4) transitions.
// Phase 1: matrix 136 rows 110 cols
[2023-03-13 19:31:54] [INFO ] Computed 11 place invariants in 11 ms
[2023-03-13 19:31:54] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-13 19:31:54] [INFO ] Invariant cache hit.
[2023-03-13 19:31:54] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-13 19:31:55] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-13 19:31:55] [INFO ] Invariant cache hit.
[2023-03-13 19:31:55] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/112 places, 136/140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 468 ms. Remains : 110/112 places, 136/140 transitions.
Support contains 93 out of 110 places after structural reductions.
[2023-03-13 19:31:55] [INFO ] Flatten gal took : 33 ms
[2023-03-13 19:31:55] [INFO ] Flatten gal took : 33 ms
[2023-03-13 19:31:55] [INFO ] Input system was already deterministic with 136 transitions.
Incomplete random walk after 10000 steps, including 128 resets, run finished after 637 ms. (steps per millisecond=15 ) properties (out of 106) seen :86
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-13 19:31:56] [INFO ] Invariant cache hit.
[2023-03-13 19:31:56] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-13 19:31:56] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 0 ms returned sat
[2023-03-13 19:31:56] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:18
[2023-03-13 19:31:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-13 19:31:56] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-13 19:31:56] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :19 sat :1
[2023-03-13 19:31:56] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-13 19:31:56] [INFO ] After 3ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :20 sat :0
[2023-03-13 19:31:56] [INFO ] After 102ms SMT Verify possible using all constraints in natural domain returned unsat :20 sat :0
Fused 20 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 20 atomic propositions for a total of 16 simplifications.
FORMULA CANConstruction-PT-005-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 7 ms
[2023-03-13 19:31:56] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CANConstruction-PT-005-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 7 ms
[2023-03-13 19:31:56] [INFO ] Input system was already deterministic with 136 transitions.
Support contains 74 out of 110 places (down from 79) after GAL structural reductions.
Computed a total of 21 stabilizing places and 25 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 136/136 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 98 transition count 112
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 98 transition count 112
Applied a total of 24 rules in 7 ms. Remains 98 /110 variables (removed 12) and now considering 112/136 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 98/110 places, 112/136 transitions.
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 4 ms
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 4 ms
[2023-03-13 19:31:56] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 136/136 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 97 transition count 110
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 97 transition count 110
Applied a total of 26 rules in 5 ms. Remains 97 /110 variables (removed 13) and now considering 110/136 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 97/110 places, 110/136 transitions.
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 4 ms
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 4 ms
[2023-03-13 19:31:56] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 136/136 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 98 transition count 112
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 98 transition count 112
Applied a total of 24 rules in 5 ms. Remains 98 /110 variables (removed 12) and now considering 112/136 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 98/110 places, 112/136 transitions.
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 4 ms
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 4 ms
[2023-03-13 19:31:56] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 136/136 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 110 transition count 125
Reduce places removed 11 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 20 rules applied. Total rules applied 31 place count 99 transition count 116
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 40 place count 90 transition count 116
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 40 place count 90 transition count 114
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 44 place count 88 transition count 114
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 54 place count 78 transition count 94
Iterating global reduction 3 with 10 rules applied. Total rules applied 64 place count 78 transition count 94
Applied a total of 64 rules in 14 ms. Remains 78 /110 variables (removed 32) and now considering 94/136 (removed 42) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 78/110 places, 94/136 transitions.
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 4 ms
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:31:56] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 136/136 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 97 transition count 110
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 97 transition count 110
Applied a total of 26 rules in 5 ms. Remains 97 /110 variables (removed 13) and now considering 110/136 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 97/110 places, 110/136 transitions.
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 4 ms
[2023-03-13 19:31:56] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 136/136 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 110 transition count 113
Reduce places removed 23 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 25 rules applied. Total rules applied 48 place count 87 transition count 111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 85 transition count 111
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 50 place count 85 transition count 110
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 84 transition count 110
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 63 place count 73 transition count 88
Iterating global reduction 3 with 11 rules applied. Total rules applied 74 place count 73 transition count 88
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 82 place count 69 transition count 84
Applied a total of 82 rules in 10 ms. Remains 69 /110 variables (removed 41) and now considering 84/136 (removed 52) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 69/110 places, 84/136 transitions.
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:31:56] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 136/136 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 98 transition count 112
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 98 transition count 112
Applied a total of 24 rules in 3 ms. Remains 98 /110 variables (removed 12) and now considering 112/136 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 98/110 places, 112/136 transitions.
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 4 ms
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 4 ms
[2023-03-13 19:31:56] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 136/136 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 97 transition count 110
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 97 transition count 110
Applied a total of 26 rules in 3 ms. Remains 97 /110 variables (removed 13) and now considering 110/136 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 97/110 places, 110/136 transitions.
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 21 ms
[2023-03-13 19:31:56] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 136/136 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 99 transition count 114
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 99 transition count 114
Applied a total of 22 rules in 2 ms. Remains 99 /110 variables (removed 11) and now considering 114/136 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 99/110 places, 114/136 transitions.
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 4 ms
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:31:56] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 136/136 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 97 transition count 110
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 97 transition count 110
Applied a total of 26 rules in 2 ms. Remains 97 /110 variables (removed 13) and now considering 110/136 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 97/110 places, 110/136 transitions.
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:31:56] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 136/136 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 98 transition count 112
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 98 transition count 112
Applied a total of 24 rules in 2 ms. Remains 98 /110 variables (removed 12) and now considering 112/136 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 98/110 places, 112/136 transitions.
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:31:56] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 136/136 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 98 transition count 112
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 98 transition count 112
Applied a total of 24 rules in 12 ms. Remains 98 /110 variables (removed 12) and now considering 112/136 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 98/110 places, 112/136 transitions.
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:31:56] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 136/136 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 99 transition count 114
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 99 transition count 114
Applied a total of 22 rules in 8 ms. Remains 99 /110 variables (removed 11) and now considering 114/136 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 99/110 places, 114/136 transitions.
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 4 ms
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:31:56] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 136/136 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 100 transition count 116
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 100 transition count 116
Applied a total of 20 rules in 2 ms. Remains 100 /110 variables (removed 10) and now considering 116/136 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 100/110 places, 116/136 transitions.
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:31:56] [INFO ] Input system was already deterministic with 116 transitions.
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 4 ms
[2023-03-13 19:31:56] [INFO ] Flatten gal took : 4 ms
[2023-03-13 19:31:56] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-13 19:31:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 110 places, 136 transitions and 392 arcs took 1 ms.
Total runtime 2496 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: 110 NrTr: 136 NrArc: 392)

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

net check time: 0m 0.000sec

init dd package: 0m 2.999sec


RS generation: 0m 0.263sec


-> reachability set: #nodes 10307 (1.0e+04) #states 97,127 (4)



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

checking: EG [EX [0<=0]]
normalized: EG [EX [0<=0]]

abstracting: (0<=0)
states: 97,127 (4)
......
EG iterations: 5
-> the formula is TRUE

FORMULA CANConstruction-PT-005-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.268sec

checking: EG [AX [EX [AF [~ [p97<=0]]]]]
normalized: EG [~ [EX [~ [EX [~ [EG [p97<=0]]]]]]]

abstracting: (p97<=0)
states: 95,243 (4)
.....
EG iterations: 5
.......
EG iterations: 5
-> the formula is FALSE

FORMULA CANConstruction-PT-005-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.037sec

checking: [AX [1<=0] & AX [~ [p89<=0]]]
normalized: [~ [EX [p89<=0]] & ~ [EX [~ [1<=0]]]]

abstracting: (1<=0)
states: 0
.abstracting: (p89<=0)
states: 95,257 (4)
.-> the formula is FALSE

FORMULA CANConstruction-PT-005-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

checking: EG [AX [p94<=p104]]
normalized: EG [~ [EX [~ [p94<=p104]]]]

abstracting: (p94<=p104)
states: 95,391 (4)
...........
EG iterations: 10
-> the formula is TRUE

FORMULA CANConstruction-PT-005-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.101sec

checking: E [EX [p36<=p44] U EF [~ [AF [1<=p61]]]]
normalized: E [EX [p36<=p44] U E [true U EG [~ [1<=p61]]]]

abstracting: (1<=p61)
states: 1
...
EG iterations: 3
abstracting: (p36<=p44)
states: 91,131 (4)
.-> the formula is TRUE

FORMULA CANConstruction-PT-005-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.250sec

checking: AF [[AX [EG [p48<=p88]] | EG [~ [p64<=0]]]]
normalized: ~ [EG [~ [[~ [EX [~ [EG [p48<=p88]]]] | EG [~ [p64<=0]]]]]]

abstracting: (p64<=0)
states: 90,742 (4)
.....
EG iterations: 5
abstracting: (p48<=p88)
states: 72,679 (4)
.....
EG iterations: 5
.......
EG iterations: 6
-> the formula is FALSE

FORMULA CANConstruction-PT-005-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.196sec

checking: [AG [p29<=p97] & [~ [A [[EX [p16<=0] & [p24<=p70 & p6<=p14]] U EX [0<=0]]] | AX [AG [~ [p98<=0]]]]]
normalized: [[~ [EX [E [true U p98<=0]]] | ~ [[~ [EG [~ [EX [0<=0]]]] & ~ [E [~ [EX [0<=0]] U [~ [[[p24<=p70 & p6<=p14] & EX [p16<=0]]] & ~ [EX [0<=0]]]]]]]] & ~ [E [true U ~ [p29<=p97]]]]

abstracting: (p29<=p97)
states: 90,904 (4)
abstracting: (0<=0)
states: 97,127 (4)
.abstracting: (p16<=0)
states: 90,743 (4)
.abstracting: (p6<=p14)
states: 72,495 (4)
abstracting: (p24<=p70)
states: 91,158 (4)
abstracting: (0<=0)
states: 97,127 (4)
.abstracting: (0<=0)
states: 97,127 (4)
..
EG iterations: 1
abstracting: (p98<=0)
states: 95,243 (4)
.-> the formula is FALSE

FORMULA CANConstruction-PT-005-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.464sec

checking: [AX [A [[~ [1<=p98] | EX [p106<=0]] U 1<=p5]] & EG [[E [p80<=0 U EF [[p31<=0 & p2<=p60]]] | EG [1<=p12]]]]
normalized: [EG [[EG [1<=p12] | E [p80<=0 U E [true U [p31<=0 & p2<=p60]]]]] & ~ [EX [~ [[~ [EG [~ [1<=p5]]] & ~ [E [~ [1<=p5] U [~ [[EX [p106<=0] | ~ [1<=p98]]] & ~ [1<=p5]]]]]]]]]

abstracting: (1<=p5)
states: 1
abstracting: (1<=p98)
states: 1,884 (3)
abstracting: (p106<=0)
states: 95,258 (4)
.abstracting: (1<=p5)
states: 1
abstracting: (1<=p5)
states: 1
...
EG iterations: 3
.abstracting: (p2<=p60)
states: 90,730 (4)
abstracting: (p31<=0)
states: 97,126 (4)
abstracting: (p80<=0)
states: 95,258 (4)
abstracting: (1<=p12)
states: 34,169 (4)
........
EG iterations: 8

EG iterations: 0
-> the formula is FALSE

FORMULA CANConstruction-PT-005-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.167sec

checking: [AF [[EF [AX [p105<=p107]] & [EF [p68<=p2] & EG [[EF [p0<=p76] | [p108<=0 & p79<=1]]]]]] & AX [EX [EG [EF [~ [p52<=p3]]]]]]
normalized: [~ [EX [~ [EX [EG [E [true U ~ [p52<=p3]]]]]]] & ~ [EG [~ [[[EG [[[p108<=0 & p79<=1] | E [true U p0<=p76]]] & E [true U p68<=p2]] & E [true U ~ [EX [~ [p105<=p107]]]]]]]]]

abstracting: (p105<=p107)
states: 95,244 (4)
.abstracting: (p68<=p2)
states: 65,055 (4)
abstracting: (p0<=p76)
states: 1,347 (3)
abstracting: (p79<=1)
states: 97,127 (4)
abstracting: (p108<=0)
states: 95,243 (4)
.....
EG iterations: 5
......
EG iterations: 6
abstracting: (p52<=p3)
states: 90,728 (4)
.
EG iterations: 1
..-> the formula is FALSE

FORMULA CANConstruction-PT-005-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.367sec

checking: EX [[p62<=0 & [[A [p41<=0 U 1<=p90] | [~ [p62<=0] | p47<=0]] & [p34<=p8 | [EG [p61<=0] | EX [p27<=p90]]]]]]
normalized: EX [[p62<=0 & [[p34<=p8 | [EX [p27<=p90] | EG [p61<=0]]] & [[p47<=0 | ~ [p62<=0]] | [~ [EG [~ [1<=p90]]] & ~ [E [~ [1<=p90] U [~ [p41<=0] & ~ [1<=p90]]]]]]]]]

abstracting: (1<=p90)
states: 1,884 (3)
abstracting: (p41<=0)
states: 90,728 (4)
abstracting: (1<=p90)
states: 1,884 (3)
abstracting: (1<=p90)
states: 1,884 (3)
.
EG iterations: 1
abstracting: (p62<=0)
states: 72,495 (4)
abstracting: (p47<=0)
states: 97,126 (4)
abstracting: (p61<=0)
states: 97,126 (4)
...
EG iterations: 3
abstracting: (p27<=p90)
states: 90,756 (4)
.abstracting: (p34<=p8)
states: 74,349 (4)
abstracting: (p62<=0)
states: 72,495 (4)
.-> the formula is TRUE

FORMULA CANConstruction-PT-005-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.230sec

checking: AG [AF [[[[~ [p42<=p73] & ~ [1<=p32]] & [~ [1<=p98] & [~ [p33<=p18] | ~ [1<=p6]]]] | [[1<=p71 & p17<=p96] & [~ [p41<=p4] & [~ [1<=p95] & [~ [p55<=0] | ~ [p53<=p42]]]]]]]]
normalized: ~ [E [true U EG [~ [[[[[[~ [p53<=p42] | ~ [p55<=0]] & ~ [1<=p95]] & ~ [p41<=p4]] & [1<=p71 & p17<=p96]] | [[[~ [1<=p6] | ~ [p33<=p18]] & ~ [1<=p98]] & [~ [1<=p32] & ~ [p42<=p73]]]]]]]]

abstracting: (p42<=p73)
states: 90,876 (4)
abstracting: (1<=p32)
states: 1
abstracting: (1<=p98)
states: 1,884 (3)
abstracting: (p33<=p18)
states: 97,126 (4)
abstracting: (1<=p6)
states: 24,632 (4)
abstracting: (p17<=p96)
states: 97,126 (4)
abstracting: (1<=p71)
states: 6,385 (3)
abstracting: (p41<=p4)
states: 90,728 (4)
abstracting: (1<=p95)
states: 1,884 (3)
abstracting: (p55<=0)
states: 90,728 (4)
abstracting: (p53<=p42)
states: 91,131 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA CANConstruction-PT-005-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.075sec

checking: E [[~ [[[[~ [p19<=p1] & EG [1<=p83]] | [~ [p54<=0] & [p52<=0 & p92<=0]]] & [EX [AG [1<=p106]] & p68<=0]]] | [p5<=0 & [p108<=1 & p26<=p47]]] U ~ [[~ [EF [p53<=p55]] | EX [AF [[p8<=1 & 1<=p17]]]]]]
normalized: E [[[p5<=0 & [p108<=1 & p26<=p47]] | ~ [[[p68<=0 & EX [~ [E [true U ~ [1<=p106]]]]] & [[[p52<=0 & p92<=0] & ~ [p54<=0]] | [EG [1<=p83] & ~ [p19<=p1]]]]]] U ~ [[EX [~ [EG [~ [[p8<=1 & 1<=p17]]]]] | ~ [E [true U p53<=p55]]]]]

abstracting: (p53<=p55)
states: 90,728 (4)
abstracting: (1<=p17)
states: 1
abstracting: (p8<=1)
states: 97,127 (4)
.
EG iterations: 1
.abstracting: (p19<=p1)
states: 97,126 (4)
abstracting: (1<=p83)
states: 1,884 (3)
.....
EG iterations: 5
abstracting: (p54<=0)
states: 63,058 (4)
abstracting: (p92<=0)
states: 95,243 (4)
abstracting: (p52<=0)
states: 90,728 (4)
abstracting: (1<=p106)
states: 1,869 (3)
.abstracting: (p68<=0)
states: 62,958 (4)
abstracting: (p26<=p47)
states: 63,058 (4)
abstracting: (p108<=1)
states: 97,127 (4)
abstracting: (p5<=0)
states: 97,126 (4)
-> the formula is TRUE

FORMULA CANConstruction-PT-005-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.104sec

checking: [E [~ [[p109<=p54 & p71<=0]] U EF [[~ [[EF [p33<=0] & AX [1<=p16]]] | EG [1<=p24]]]] & [A [[EG [~ [[p24<=1 & p12<=0]]] | E [[1<=p16 & p14<=1] U [EG [p46<=p1] | AX [p55<=p39]]]] U EG [~ [p9<=p64]]] & EF [[[A [1<=p79 U p21<=0] & ~ [1<=p94]] & [p36<=1 & 1<=p106]]]]]
normalized: [[E [true U [[p36<=1 & 1<=p106] & [~ [1<=p94] & [~ [EG [~ [p21<=0]]] & ~ [E [~ [p21<=0] U [~ [1<=p79] & ~ [p21<=0]]]]]]]] & [~ [EG [~ [EG [~ [p9<=p64]]]]] & ~ [E [~ [EG [~ [p9<=p64]]] U [~ [[E [[1<=p16 & p14<=1] U [~ [EX [~ [p55<=p39]]] | EG [p46<=p1]]] | EG [~ [[p24<=1 & p12<=0]]]]] & ~ [EG [~ [p9<=p64]]]]]]]] & E [~ [[p109<=p54 & p71<=0]] U E [true U [EG [1<=p24] | ~ [[~ [EX [~ [1<=p16]]] & E [true U p33<=0]]]]]]]

abstracting: (p33<=0)
states: 97,126 (4)
abstracting: (1<=p16)
states: 6,384 (3)
.abstracting: (1<=p24)
states: 6,371 (3)
.....
EG iterations: 5
abstracting: (p71<=0)
states: 90,742 (4)
abstracting: (p109<=p54)
states: 95,257 (4)
abstracting: (p9<=p64)
states: 91,145 (4)
...........
EG iterations: 11
abstracting: (p12<=0)
states: 62,958 (4)
abstracting: (p24<=1)
states: 97,127 (4)
........
EG iterations: 8
abstracting: (p46<=p1)
states: 97,126 (4)
..
EG iterations: 2
abstracting: (p55<=p39)
states: 91,131 (4)
.abstracting: (p14<=1)
states: 97,127 (4)
abstracting: (1<=p16)
states: 6,384 (3)
abstracting: (p9<=p64)
states: 91,145 (4)
...........
EG iterations: 11
abstracting: (p9<=p64)
states: 91,145 (4)
...........
EG iterations: 11
.
EG iterations: 1
abstracting: (p21<=0)
states: 90,756 (4)
abstracting: (1<=p79)
states: 1,870 (3)
abstracting: (p21<=0)
states: 90,756 (4)
abstracting: (p21<=0)
states: 90,756 (4)
.....
EG iterations: 5
abstracting: (1<=p94)
states: 1,884 (3)
abstracting: (1<=p106)
states: 1,869 (3)
abstracting: (p36<=1)
states: 97,127 (4)
-> the formula is FALSE

FORMULA CANConstruction-PT-005-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.619sec

checking: AG [[[E [[A [1<=p70 U p44<=p84] & EG [1<=p32]] U p104<=p99] & [p14<=p13 | [AG [~ [1<=p96]] & [~ [1<=p17] & [p64<=p11 | ~ [p34<=p41]]]]]] | [A [[A [1<=p59 U p74<=p95] & p50<=p86] U A [[1<=p40 & p74<=p22] U [1<=p59 | p67<=p17]]] & 1<=p0]]]
normalized: ~ [E [true U ~ [[[1<=p0 & [~ [EG [~ [[~ [EG [~ [[1<=p59 | p67<=p17]]]] & ~ [E [~ [[1<=p59 | p67<=p17]] U [~ [[1<=p40 & p74<=p22]] & ~ [[1<=p59 | p67<=p17]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[1<=p59 | p67<=p17]]]] & ~ [E [~ [[1<=p59 | p67<=p17]] U [~ [[1<=p40 & p74<=p22]] & ~ [[1<=p59 | p67<=p17]]]]]]] U [~ [[p50<=p86 & [~ [EG [~ [p74<=p95]]] & ~ [E [~ [p74<=p95] U [~ [1<=p59] & ~ [p74<=p95]]]]]]] & ~ [[~ [EG [~ [[1<=p59 | p67<=p17]]]] & ~ [E [~ [[1<=p59 | p67<=p17]] U [~ [[1<=p40 & p74<=p22]] & ~ [[1<=p59 | p67<=p17]]]]]]]]]]]] | [[p14<=p13 | [[[p64<=p11 | ~ [p34<=p41]] & ~ [1<=p17]] & ~ [E [true U 1<=p96]]]] & E [[EG [1<=p32] & [~ [EG [~ [p44<=p84]]] & ~ [E [~ [p44<=p84] U [~ [1<=p70] & ~ [p44<=p84]]]]]] U p104<=p99]]]]]]

abstracting: (p104<=p99)
states: 95,271 (4)
abstracting: (p44<=p84)
states: 90,715 (4)
abstracting: (1<=p70)
states: 6,385 (3)
abstracting: (p44<=p84)
states: 90,715 (4)
abstracting: (p44<=p84)
states: 90,715 (4)
.....
EG iterations: 5
abstracting: (1<=p32)
states: 1
..
EG iterations: 2
abstracting: (1<=p96)
states: 1,884 (3)
abstracting: (1<=p17)
states: 1
abstracting: (p34<=p41)
states: 72,479 (4)
abstracting: (p64<=p11)
states: 91,145 (4)
abstracting: (p14<=p13)
states: 90,742 (4)
abstracting: (p67<=p17)
states: 90,742 (4)
abstracting: (1<=p59)
states: 1
abstracting: (p74<=p22)
states: 95,404 (4)
abstracting: (1<=p40)
states: 34,069 (4)
abstracting: (p67<=p17)
states: 90,742 (4)
abstracting: (1<=p59)
states: 1
abstracting: (p67<=p17)
states: 90,742 (4)
abstracting: (1<=p59)
states: 1
.....
EG iterations: 5
abstracting: (p74<=p95)
states: 95,405 (4)
abstracting: (1<=p59)
states: 1
abstracting: (p74<=p95)
states: 95,405 (4)
abstracting: (p74<=p95)
states: 95,405 (4)
.....
EG iterations: 5
abstracting: (p50<=p86)
states: 90,876 (4)
abstracting: (p67<=p17)
states: 90,742 (4)
abstracting: (1<=p59)
states: 1
abstracting: (p74<=p22)
states: 95,404 (4)
abstracting: (1<=p40)
states: 34,069 (4)
abstracting: (p67<=p17)
states: 90,742 (4)
abstracting: (1<=p59)
states: 1
abstracting: (p67<=p17)
states: 90,742 (4)
abstracting: (1<=p59)
states: 1
.....
EG iterations: 5
abstracting: (p67<=p17)
states: 90,742 (4)
abstracting: (1<=p59)
states: 1
abstracting: (p74<=p22)
states: 95,404 (4)
abstracting: (1<=p40)
states: 34,069 (4)
abstracting: (p67<=p17)
states: 90,742 (4)
abstracting: (1<=p59)
states: 1
abstracting: (p67<=p17)
states: 90,742 (4)
abstracting: (1<=p59)
states: 1
.....
EG iterations: 5
.....
EG iterations: 5
abstracting: (1<=p0)
states: 97,111 (4)
-> the formula is FALSE

FORMULA CANConstruction-PT-005-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.380sec

totally nodes used: 1815980 (1.8e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2681151 10626656 13307807
used/not used/entry size/cache size: 11427398 55681466 16 1024MB
basic ops cache: hits/miss/sum: 342948 1448235 1791183
used/not used/entry size/cache size: 2127597 14649619 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: 22691 88853 111544
used/not used/entry size/cache size: 88453 8300155 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 65517353
1 1400555
2 161576
3 25664
4 3350
5 324
6 35
7 5
8 2
9 0
>= 10 0

Total processing time: 0m 8.879sec


BK_STOP 1678735926050

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

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


initing FirstDep: 0m 0.000sec


iterations count:5137 (37), effective:234 (1)

initing FirstDep: 0m 0.000sec


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

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

iterations count:1321 (9), effective:50 (0)

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

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

iterations count:479 (3), effective:13 (0)

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

iterations count:2245 (16), effective:97 (0)

iterations count:1744 (12), effective:62 (0)

iterations count:316 (2), effective:9 (0)

iterations count:1125 (8), effective:44 (0)

iterations count:1595 (11), effective:70 (0)

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

iterations count:656 (4), effective:18 (0)

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

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

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

iterations count:397 (2), effective:12 (0)

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

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

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

iterations count:1724 (12), effective:67 (0)

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

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

iterations count:1363 (10), effective:61 (0)

iterations count:1095 (8), effective:34 (0)

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

iterations count:1095 (8), effective:34 (0)

iterations count:1487 (10), effective:63 (0)

iterations count:1095 (8), effective:34 (0)

iterations count:840 (6), effective:38 (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="CANConstruction-PT-005"
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 CANConstruction-PT-005, 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 r042-tajo-167813696000609"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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