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

About the Execution of Marcie+red for TCPcondis-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12513.724 478568.00 484685.00 1264.70 FTTFFTFTFFFFTFTT 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.r490-tall-167912708700505.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 TCPcondis-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708700505
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.9K Feb 26 16:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 16:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 16:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 16:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 16:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 16:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 16:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 26 16:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 24K 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 TCPcondis-PT-10-CTLCardinality-00
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-01
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-02
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-03
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-04
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-05
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-06
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-07
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-08
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-09
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-10
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-11
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-12
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-13
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-14
FORMULA_NAME TCPcondis-PT-10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679273091875

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=TCPcondis-PT-10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 00:44:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 00:44:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 00:44:53] [WARNING] Skipping unknown tool specific annotation : Tina
[2023-03-20 00:44:53] [WARNING] Unknown XML tag in source file: size
[2023-03-20 00:44:53] [WARNING] Unknown XML tag in source file: color
[2023-03-20 00:44:53] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2023-03-20 00:44:53] [INFO ] Transformed 30 places.
[2023-03-20 00:44:53] [INFO ] Transformed 32 transitions.
[2023-03-20 00:44:53] [INFO ] Parsed PT model containing 30 places and 32 transitions and 108 arcs in 89 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-20 00:44:53] [INFO ] Computed 9 place invariants in 6 ms
[2023-03-20 00:44:53] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-20 00:44:53] [INFO ] Invariant cache hit.
[2023-03-20 00:44:53] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2023-03-20 00:44:53] [INFO ] Invariant cache hit.
[2023-03-20 00:44:53] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 298 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 30 out of 30 places after structural reductions.
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 18 ms
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 7 ms
[2023-03-20 00:44:54] [INFO ] Input system was already deterministic with 32 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 71) seen :70
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:44:54] [INFO ] Invariant cache hit.
[2023-03-20 00:44:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 00:44:54] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-20 00:44:54] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 3 ms
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 4 ms
[2023-03-20 00:44:54] [INFO ] Input system was already deterministic with 32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 32/32 transitions.
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 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 24 transition count 24
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 14 place count 24 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 22 transition count 22
Applied a total of 18 rules in 13 ms. Remains 22 /30 variables (removed 8) and now considering 22/32 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 22/30 places, 22/32 transitions.
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 3 ms
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:44:54] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:44:54] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:44:54] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 1 ms
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:44:54] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Applied a total of 4 rules in 2 ms. Remains 28 /30 variables (removed 2) and now considering 30/32 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 28/30 places, 30/32 transitions.
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:44:54] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 1 ms
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:44:54] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:44:54] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 1 ms
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 1 ms
[2023-03-20 00:44:54] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 1 ms
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:44:54] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:44:54] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 10 ms
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:44:54] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:44:54] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 27 transition count 27
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 8 place count 27 transition count 25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 25 transition count 25
Applied a total of 12 rules in 5 ms. Remains 25 /30 variables (removed 5) and now considering 25/32 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 25/30 places, 25/32 transitions.
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:44:54] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 1 ms
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:44:54] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 1 ms
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:44:54] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 26 transition count 28
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 26 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 9 place count 26 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 25 transition count 26
Applied a total of 11 rules in 6 ms. Remains 25 /30 variables (removed 5) and now considering 26/32 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 25/30 places, 26/32 transitions.
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 1 ms
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:44:54] [INFO ] Input system was already deterministic with 26 transitions.
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:44:54] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:44:54] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-20 00:44:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 32 transitions and 108 arcs took 0 ms.
Total runtime 1261 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: 30 NrTr: 32 NrArc: 108)

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

net check time: 0m 0.000sec

init dd package: 0m 2.776sec


RS generation: 0m10.497sec


-> reachability set: #nodes 156246 (1.6e+05) #states 13,761,971,603 (10)



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

checking: AF [AG [2<=p6]]
normalized: ~ [EG [E [true U ~ [2<=p6]]]]

abstracting: (2<=p6)
states: 4,470,099,628 (9)

EG iterations: 0
-> the formula is FALSE

FORMULA TCPcondis-PT-10-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.743sec

checking: EX [EF [8<=p2]]
normalized: EX [E [true U 8<=p2]]

abstracting: (8<=p2)
states: 3,088,331 (6)
.-> the formula is TRUE

FORMULA TCPcondis-PT-10-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.482sec

checking: AG [AX [AF [p0<=p15]]]
normalized: ~ [E [true U EX [EG [~ [p0<=p15]]]]]

abstracting: (p0<=p15)
states: 9,427,312,949 (9)
.....................
EG iterations: 21
.-> the formula is FALSE

FORMULA TCPcondis-PT-10-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.446sec

checking: AF [~ [E [[~ [p23<=9] | EF [AX [p0<=2]]] U ~ [EG [AF [7<=p23]]]]]]
normalized: ~ [EG [E [[E [true U ~ [EX [~ [p0<=2]]]] | ~ [p23<=9]] U ~ [EG [~ [EG [~ [7<=p23]]]]]]]]

abstracting: (7<=p23)
states: 17,443,415 (7)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p23<=9)
states: 13,761,952,156 (10)
abstracting: (p0<=2)
states: 12,600,435,481 (10)
.
EG iterations: 0
-> the formula is FALSE

FORMULA TCPcondis-PT-10-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.509sec

checking: AF [[EG [p24<=p19] | EG [6<=p1]]]
normalized: ~ [EG [~ [[EG [6<=p1] | EG [p24<=p19]]]]]

abstracting: (p24<=p19)
states: 10,465,733,987 (10)
.
EG iterations: 1
abstracting: (6<=p1)
states: 3,324,267 (6)
.
EG iterations: 1
.........................................................................................................
EG iterations: 105
-> the formula is TRUE

FORMULA TCPcondis-PT-10-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.146sec

checking: AG [EF [[~ [p4<=p26] & ~ [p29<=p11]]]]
normalized: ~ [E [true U ~ [E [true U [~ [p29<=p11] & ~ [p4<=p26]]]]]]

abstracting: (p4<=p26)
states: 7,420,817,372 (9)
abstracting: (p29<=p11)
states: 9,753,187,019 (9)
-> the formula is TRUE

FORMULA TCPcondis-PT-10-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.427sec

checking: EG [EX [EF [[[6<=p28 & ~ [5<=p21]] | [~ [p12<=2] & AF [p5<=p3]]]]]]
normalized: EG [EX [E [true U [[~ [EG [~ [p5<=p3]]] & ~ [p12<=2]] | [6<=p28 & ~ [5<=p21]]]]]]

abstracting: (5<=p21)
states: 230,247,646 (8)
abstracting: (6<=p28)
states: 56,073,069 (7)
abstracting: (p12<=2)
states: 12,380,020,127 (10)
abstracting: (p5<=p3)
states: 5,334,186,645 (9)
...................................................................................................................
EG iterations: 115
.
EG iterations: 0
-> the formula is TRUE

FORMULA TCPcondis-PT-10-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.270sec

checking: EX [AF [[~ [A [p17<=6 U p22<=2]] & [EF [~ [p12<=p9]] & [p17<=0 | [~ [p16<=p12] | ~ [p6<=p5]]]]]]]
normalized: EX [~ [EG [~ [[[[p17<=0 | [~ [p6<=p5] | ~ [p16<=p12]]] & E [true U ~ [p12<=p9]]] & ~ [[~ [EG [~ [p22<=2]]] & ~ [E [~ [p22<=2] U [~ [p17<=6] & ~ [p22<=2]]]]]]]]]]]

abstracting: (p22<=2)
states: 12,691,271,550 (10)
abstracting: (p17<=6)
states: 13,744,528,187 (10)
abstracting: (p22<=2)
states: 12,691,271,550 (10)
abstracting: (p22<=2)
states: 12,691,271,550 (10)
.
EG iterations: 1
abstracting: (p12<=p9)
states: 8,435,472,468 (9)
abstracting: (p16<=p12)
states: 10,613,957,014 (10)
abstracting: (p6<=p5)
states: 9,972,881,872 (9)
abstracting: (p17<=0)
states: 5,891,196,171 (9)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA TCPcondis-PT-10-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.819sec

checking: EF [[[EX [~ [p17<=p1]] & AG [p19<=p22]] & [p8<=p20 & [~ [10<=p2] & [~ [4<=p17] | ~ [9<=p21]]]]]]
normalized: E [true U [[p8<=p20 & [[~ [9<=p21] | ~ [4<=p17]] & ~ [10<=p2]]] & [~ [E [true U ~ [p19<=p22]]] & EX [~ [p17<=p1]]]]]

abstracting: (p17<=p1)
states: 7,819,078,062 (9)
.abstracting: (p19<=p22)
states: 7,197,169,706 (9)
abstracting: (10<=p2)
states: 19,448 (4)
abstracting: (4<=p17)
states: 728,811,223 (8)
abstracting: (9<=p21)
states: 105,722 (5)
abstracting: (p8<=p20)
states: 11,340,384,769 (10)
-> the formula is FALSE

FORMULA TCPcondis-PT-10-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.165sec

checking: EF [~ [E [[[3<=p18 & EX [p25<=p16]] | [~ [AX [p13<=4]] | AG [p5<=3]]] U ~ [[A [p17<=p2 U 5<=p29] | ~ [p21<=4]]]]]]
normalized: E [true U ~ [E [[[~ [E [true U ~ [p5<=3]]] | EX [~ [p13<=4]]] | [3<=p18 & EX [p25<=p16]]] U ~ [[~ [p21<=4] | [~ [EG [~ [5<=p29]]] & ~ [E [~ [5<=p29] U [~ [p17<=p2] & ~ [5<=p29]]]]]]]]]]

abstracting: (5<=p29)
states: 122,549,914 (8)
abstracting: (p17<=p2)
states: 8,886,053,735 (9)
abstracting: (5<=p29)
states: 122,549,914 (8)
abstracting: (5<=p29)
states: 122,549,914 (8)
.
EG iterations: 1
abstracting: (p21<=4)
states: 13,531,723,957 (10)
abstracting: (p25<=p16)
states: 7,719,007,238 (9)
.abstracting: (3<=p18)
states: 841,042,880 (8)
abstracting: (p13<=4)
states: 13,553,547,501 (10)
.abstracting: (p5<=3)
states: 11,406,266,003 (10)
-> the formula is TRUE

FORMULA TCPcondis-PT-10-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m22.612sec

checking: AG [~ [A [~ [[[p1<=9 | [9<=p2 & p9<=p27]] & ~ [AF [p17<=p24]]]] U [A [p13<=2 U p15<=p26] | [5<=p27 | ~ [1<=p15]]]]]]
normalized: ~ [E [true U [~ [EG [~ [[[5<=p27 | ~ [1<=p15]] | [~ [EG [~ [p15<=p26]]] & ~ [E [~ [p15<=p26] U [~ [p13<=2] & ~ [p15<=p26]]]]]]]]] & ~ [E [~ [[[5<=p27 | ~ [1<=p15]] | [~ [EG [~ [p15<=p26]]] & ~ [E [~ [p15<=p26] U [~ [p13<=2] & ~ [p15<=p26]]]]]]] U [[EG [~ [p17<=p24]] & [p1<=9 | [9<=p2 & p9<=p27]]] & ~ [[[5<=p27 | ~ [1<=p15]] | [~ [EG [~ [p15<=p26]]] & ~ [E [~ [p15<=p26] U [~ [p13<=2] & ~ [p15<=p26]]]]]]]]]]]]]

abstracting: (p15<=p26)
states: 9,722,992,297 (9)
abstracting: (p13<=2)
states: 12,048,469,643 (10)
abstracting: (p15<=p26)
states: 9,722,992,297 (9)
abstracting: (p15<=p26)
states: 9,722,992,297 (9)
............................................................
EG iterations: 60
abstracting: (1<=p15)
states: 6,625,542,544 (9)
abstracting: (5<=p27)
states: 109,356,430 (8)
abstracting: (p9<=p27)
states: 9,722,992,297 (9)
abstracting: (9<=p2)
states: 357,569 (5)
abstracting: (p1<=9)
states: 13,761,971,592 (10)
abstracting: (p17<=p24)
states: 8,235,072,707 (9)
.
EG iterations: 1
abstracting: (p15<=p26)
states: 9,722,992,297 (9)
abstracting: (p13<=2)
states: 12,048,469,643 (10)
abstracting: (p15<=p26)
states: 9,722,992,297 (9)
abstracting: (p15<=p26)
states: 9,722,992,297 (9)
............................................................
EG iterations: 60
abstracting: (1<=p15)
states: 6,625,542,544 (9)
abstracting: (5<=p27)
states: 109,356,430 (8)
abstracting: (p15<=p26)
states: 9,722,992,297 (9)
abstracting: (p13<=2)
states: 12,048,469,643 (10)
abstracting: (p15<=p26)
states: 9,722,992,297 (9)
abstracting: (p15<=p26)
states: 9,722,992,297 (9)
............................................................
EG iterations: 60
abstracting: (1<=p15)
states: 6,625,542,544 (9)
abstracting: (5<=p27)
states: 109,356,430 (8)
..........................................................
EG iterations: 58
-> the formula is FALSE

FORMULA TCPcondis-PT-10-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.317sec

checking: [EX [AF [~ [2<=p28]]] & AG [[[AF [~ [p15<=7]] | EF [[EX [~ [p1<=p7]] & [~ [p0<=2] & ~ [4<=p17]]]]] | [p6<=p11 | [p3<=p14 | ~ [p10<=p6]]]]]]
normalized: [~ [E [true U ~ [[[p6<=p11 | [p3<=p14 | ~ [p10<=p6]]] | [E [true U [[~ [4<=p17] & ~ [p0<=2]] & EX [~ [p1<=p7]]]] | ~ [EG [p15<=7]]]]]]] & EX [~ [EG [2<=p28]]]]

abstracting: (2<=p28)
states: 3,982,092,948 (9)
.
EG iterations: 1
.abstracting: (p15<=7)
states: 13,761,129,106 (10)
.
EG iterations: 1
abstracting: (p1<=p7)
states: 10,352,806,162 (10)
.abstracting: (p0<=2)
states: 12,600,435,481 (10)
abstracting: (4<=p17)
states: 728,811,223 (8)
abstracting: (p10<=p6)
states: 9,045,056,727 (9)
abstracting: (p3<=p14)
states: 9,594,407,235 (9)
abstracting: (p6<=p11)
states: 8,469,130,345 (9)
-> the formula is TRUE

FORMULA TCPcondis-PT-10-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.493sec

checking: A [AX [[AX [E [p26<=2 U p2<=8]] & p14<=p25]] U EG [[[AG [p1<=6] & [E [~ [8<=p2] U [9<=p6 | p21<=p3]] & [AG [p11<=p12] | [p18<=1 & 3<=p25]]]] | [p18<=p29 & ~ [EX [p2<=4]]]]]]
normalized: [~ [EG [~ [EG [[[p18<=p29 & ~ [EX [p2<=4]]] | [[[[p18<=1 & 3<=p25] | ~ [E [true U ~ [p11<=p12]]]] & E [~ [8<=p2] U [9<=p6 | p21<=p3]]] & ~ [E [true U ~ [p1<=6]]]]]]]]] & ~ [E [~ [EG [[[p18<=p29 & ~ [EX [p2<=4]]] | [[[[p18<=1 & 3<=p25] | ~ [E [true U ~ [p11<=p12]]]] & E [~ [8<=p2] U [9<=p6 | p21<=p3]]] & ~ [E [true U ~ [p1<=6]]]]]]] U [EX [~ [[p14<=p25 & ~ [EX [~ [E [p26<=2 U p2<=8]]]]]]] & ~ [EG [[[p18<=p29 & ~ [EX [p2<=4]]] | [[[[p18<=1 & 3<=p25] | ~ [E [true U ~ [p11<=p12]]]] & E [~ [8<=p2] U [9<=p6 | p21<=p3]]] & ~ [E [true U ~ [p1<=6]]]]]]]]]]]

abstracting: (p1<=6)
states: 13,761,631,956 (10)
abstracting: (p21<=p3)
states: 7,772,760,687 (9)
abstracting: (9<=p6)
states: 105,722 (5)
abstracting: (8<=p2)
states: 3,088,331 (6)
abstracting: (p11<=p12)
states: 9,735,452,081 (9)
abstracting: (3<=p25)
states: 1,713,501,960 (9)
abstracting: (p18<=1)
states: 11,228,212,921 (10)
abstracting: (p2<=4)
states: 13,509,291,435 (10)
.abstracting: (p18<=p29)
states: 9,594,407,235 (9)
............................................................................
EG iterations: 76
abstracting: (p2<=8)
states: 13,761,614,034 (10)
abstracting: (p26<=2)
states: 12,380,020,127 (10)
.abstracting: (p14<=p25)
states: 9,970,528,143 (9)
.abstracting: (p1<=6)
states: 13,761,631,956 (10)
abstracting: (p21<=p3)
states: 7,772,760,687 (9)
abstracting: (9<=p6)
states: 105,722 (5)
abstracting: (8<=p2)
states: 3,088,331 (6)
abstracting: (p11<=p12)
states: 9,735,452,081 (9)
abstracting: (3<=p25)
states: 1,713,501,960 (9)
abstracting: (p18<=1)
states: 11,228,212,921 (10)
abstracting: (p2<=4)
states: 13,509,291,435 (10)
.abstracting: (p18<=p29)
states: 9,594,407,235 (9)
............................................................................
EG iterations: 76
abstracting: (p1<=6)
states: 13,761,631,956 (10)
abstracting: (p21<=p3)
states: 7,772,760,687 (9)
abstracting: (9<=p6)
states: 105,722 (5)
abstracting: (8<=p2)
states: 3,088,331 (6)
abstracting: (p11<=p12)
states: 9,735,452,081 (9)
abstracting: (3<=p25)
states: 1,713,501,960 (9)
abstracting: (p18<=1)
states: 11,228,212,921 (10)
abstracting: (p2<=4)
states: 13,509,291,435 (10)
.abstracting: (p18<=p29)
states: 9,594,407,235 (9)
............................................................................
EG iterations: 76
...................
EG iterations: 19
-> the formula is FALSE

FORMULA TCPcondis-PT-10-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m12.435sec

checking: [EF [AG [[EF [~ [p4<=9]] & ~ [5<=p17]]]] & [~ [E [~ [[~ [10<=p27] & [~ [p24<=p5] | EG [p25<=p19]]]] U [AG [~ [p18<=p29]] & EG [EX [p14<=p28]]]]] | EF [[[[~ [9<=p9] & ~ [p22<=p18]] & p9<=0] | AG [p14<=6]]]]]
normalized: [[E [true U [~ [E [true U ~ [p14<=6]]] | [p9<=0 & [~ [p22<=p18] & ~ [9<=p9]]]]] | ~ [E [~ [[[EG [p25<=p19] | ~ [p24<=p5]] & ~ [10<=p27]]] U [EG [EX [p14<=p28]] & ~ [E [true U p18<=p29]]]]]] & E [true U ~ [E [true U ~ [[~ [5<=p17] & E [true U ~ [p4<=9]]]]]]]]

abstracting: (p4<=9)
states: 13,761,966,598 (10)
abstracting: (5<=p17)
states: 252,680,168 (8)
abstracting: (p18<=p29)
states: 9,594,407,235 (9)
abstracting: (p14<=p28)
states: 9,970,528,143 (9)
..
EG iterations: 1
abstracting: (10<=p27)
states: 286
abstracting: (p24<=p5)
states: 10,965,188,249 (10)
abstracting: (p25<=p19)
states: 9,544,550,622 (9)
..................................................................................
EG iterations: 82
abstracting: (9<=p9)
states: 74,558 (4)
abstracting: (p22<=p18)
states: 8,845,355,342 (9)
abstracting: (p9<=0)
states: 7,136,429,059 (9)
abstracting: (p14<=6)
states: 13,756,009,259 (10)
-> the formula is FALSE

FORMULA TCPcondis-PT-10-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m13.343sec

checking: E [p21<=p26 U A [[E [[~ [p13<=p24] & AG [p14<=p21]] U AF [p29<=p8]] | p16<=p0] U AG [[E [3<=p8 U p19<=p16] & [~ [p16<=p26] & p3<=6]]]]]
normalized: E [p21<=p26 U [~ [EG [E [true U ~ [[[p3<=6 & ~ [p16<=p26]] & E [3<=p8 U p19<=p16]]]]]] & ~ [E [E [true U ~ [[[p3<=6 & ~ [p16<=p26]] & E [3<=p8 U p19<=p16]]]] U [~ [[p16<=p0 | E [[~ [E [true U ~ [p14<=p21]]] & ~ [p13<=p24]] U ~ [EG [~ [p29<=p8]]]]]] & E [true U ~ [[[p3<=6 & ~ [p16<=p26]] & E [3<=p8 U p19<=p16]]]]]]]]]

abstracting: (p19<=p16)
states: 6,373,215,818 (9)
abstracting: (3<=p8)
states: 1,822,240,808 (9)
abstracting: (p16<=p26)
states: 10,613,957,014 (10)
abstracting: (p3<=6)
states: 13,760,906,249 (10)
abstracting: (p29<=p8)
states: 9,923,425,265 (9)
..................
EG iterations: 18
abstracting: (p13<=p24)
states: 8,259,556,942 (9)
abstracting: (p14<=p21)
states: 10,042,970,639 (10)
abstracting: (p16<=p0)
states: 10,148,030,033 (10)
abstracting: (p19<=p16)
states: 6,373,215,818 (9)
abstracting: (3<=p8)
states: 1,822,240,808 (9)
abstracting: (p16<=p26)
states: 10,613,957,014 (10)
abstracting: (p3<=6)
states: 13,760,906,249 (10)
abstracting: (p19<=p16)
states: 6,373,215,818 (9)
abstracting: (3<=p8)
states: 1,822,240,808 (9)
abstracting: (p16<=p26)
states: 10,613,957,014 (10)
abstracting: (p3<=6)
states: 13,760,906,249 (10)

EG iterations: 0
abstracting: (p21<=p26)
states: 8,469,130,345 (9)
-> the formula is FALSE

FORMULA TCPcondis-PT-10-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m54.862sec

checking: EF [[EG [[~ [p20<=1] | [~ [p28<=p24] & ~ [8<=p12]]]] | [EG [[p29<=6 & AG [~ [7<=p29]]]] | [[EX [~ [p29<=p21]] & AG [p26<=p19]] & [[E [p4<=3 U 10<=p7] | AG [p15<=4]] & [[p23<=p9 | ~ [p6<=4]] & [~ [p16<=p29] | [[1<=p27 & p14<=p17] | [~ [p8<=0] & ~ [p19<=2]]]]]]]]]]
normalized: E [true U [[[[[[[[~ [p19<=2] & ~ [p8<=0]] | [1<=p27 & p14<=p17]] | ~ [p16<=p29]] & [p23<=p9 | ~ [p6<=4]]] & [~ [E [true U ~ [p15<=4]]] | E [p4<=3 U 10<=p7]]] & [~ [E [true U ~ [p26<=p19]]] & EX [~ [p29<=p21]]]] | EG [[p29<=6 & ~ [E [true U 7<=p29]]]]] | EG [[[~ [8<=p12] & ~ [p28<=p24]] | ~ [p20<=1]]]]]

abstracting: (p20<=1)
states: 6,384,130,492 (9)
abstracting: (p28<=p24)
states: 8,128,453,827 (9)
abstracting: (8<=p12)
states: 294,673 (5)
.
EG iterations: 1
abstracting: (7<=p29)
states: 5,962,344 (6)
abstracting: (p29<=6)
states: 13,756,009,259 (10)
.
EG iterations: 1
abstracting: (p29<=p21)

before gc: list nodes free: 1570251

after gc: idd nodes used:3847640, unused:60152360; list nodes free:420872452
states: 10,038,446,666 (10)
.abstracting: (p26<=p19)
states: 10,026,837,731 (10)
abstracting: (10<=p7)
states: 66
abstracting: (p4<=3)
states: 12,706,343,641 (10)
abstracting: (p15<=4)
states: 13,639,421,689 (10)
abstracting: (p6<=4)
states: 13,531,723,957 (10)
abstracting: (p23<=p9)
states: 8,344,709,820 (9)
abstracting: (p16<=p29)
states: 10,050,574,761 (10)
abstracting: (p14<=p17)
states: 9,923,425,265 (9)
abstracting: (1<=p27)
states: 7,899,601,936 (9)
abstracting: (p8<=0)
states: 5,891,196,172 (9)
abstracting: (p19<=2)
states: 11,118,976,284 (10)
-> the formula is TRUE

FORMULA TCPcondis-PT-10-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m57.826sec

totally nodes used: 70261125 (7.0e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 746359033 413436744 1159795777
used/not used/entry size/cache size: 30447846 36661018 16 1024MB
basic ops cache: hits/miss/sum: 131998011 81909968 213907979
used/not used/entry size/cache size: 10267959 6509257 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: 9029852 4995437 14025289
used/not used/entry size/cache size: 1079448 7309160 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 58470491
1 7709292
2 733902
3 104657
4 32040
5 14365
6 9929
7 8755
8 5083
9 3985
>= 10 16365

Total processing time: 7m54.844sec


BK_STOP 1679273570443

--------------------
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


iterations count:6378 (199), effective:883 (27)

initing FirstDep: 0m 0.015sec


iterations count:336 (10), effective:40 (1)

iterations count:6500 (203), effective:897 (28)

iterations count:1228 (38), effective:176 (5)

iterations count:227 (7), effective:19 (0)

iterations count:180 (5), effective:12 (0)

iterations count:1392 (43), effective:187 (5)

iterations count:3554 (111), effective:508 (15)

iterations count:3154 (98), effective:436 (13)

iterations count:506 (15), effective:75 (2)

iterations count:553 (17), effective:67 (2)

iterations count:1298 (40), effective:153 (4)

iterations count:1973 (61), effective:292 (9)

iterations count:239 (7), effective:22 (0)

iterations count:3924 (122), effective:523 (16)

iterations count:546 (17), effective:77 (2)

iterations count:546 (17), effective:77 (2)

iterations count:2213 (69), effective:314 (9)

iterations count:546 (17), effective:77 (2)

iterations count:1945 (60), effective:308 (9)

iterations count:1922 (60), effective:254 (7)

iterations count:5782 (180), effective:737 (23)

iterations count:426 (13), effective:59 (1)

iterations count:595 (18), effective:75 (2)

iterations count:98 (3), effective:7 (0)

iterations count:5782 (180), effective:737 (23)

iterations count:426 (13), effective:59 (1)

iterations count:595 (18), effective:75 (2)

iterations count:1843 (57), effective:252 (7)

iterations count:5782 (180), effective:737 (23)

iterations count:426 (13), effective:59 (1)

iterations count:595 (18), effective:75 (2)

iterations count:3861 (120), effective:534 (16)

iterations count:2810 (87), effective:407 (12)

iterations count:339 (10), effective:39 (1)

iterations count:5339 (166), effective:685 (21)

iterations count:723 (22), effective:102 (3)

iterations count:338 (10), effective:42 (1)

iterations count:49 (1), effective:12 (0)

iterations count:748 (23), effective:104 (3)

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

iterations count:338 (10), effective:42 (1)

iterations count:49 (1), effective:12 (0)

iterations count:1860 (58), effective:240 (7)

iterations count:338 (10), effective:42 (1)

iterations count:49 (1), effective:12 (0)

iterations count:3904 (122), effective:576 (18)

iterations count:922 (28), effective:137 (4)

iterations count:6769 (211), effective:922 (28)

iterations count:2582 (80), effective:365 (11)

iterations count:724 (22), effective:90 (2)

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="TCPcondis-PT-10"
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 TCPcondis-PT-10, 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-167912708700505"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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