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.r362-smll-167891812100025.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 RobotManipulation-PT-00010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r362-smll-167891812100025
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 7.9K Feb 26 05:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 05:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 05:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 05:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 05:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K Feb 26 05:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 05:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 139K Feb 26 05:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.4K 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 RobotManipulation-PT-00010-CTLCardinality-00
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-01
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-02
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-03
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-04
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-05
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-06
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-07
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-08
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-09
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-10
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-11
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-12
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-13
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-14
FORMULA_NAME RobotManipulation-PT-00010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678978202322

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=RobotManipulation-PT-00010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 14:50:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 14:50:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 14:50:06] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2023-03-16 14:50:06] [INFO ] Transformed 15 places.
[2023-03-16 14:50:06] [INFO ] Transformed 11 transitions.
[2023-03-16 14:50:06] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 145 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
Support contains 15 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 13 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 15 cols
[2023-03-16 14:50:06] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-16 14:50:06] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-16 14:50:06] [INFO ] Invariant cache hit.
[2023-03-16 14:50:06] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2023-03-16 14:50:06] [INFO ] Invariant cache hit.
[2023-03-16 14:50:06] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 301 ms. Remains : 15/15 places, 11/11 transitions.
Support contains 15 out of 15 places after structural reductions.
[2023-03-16 14:50:07] [INFO ] Flatten gal took : 32 ms
[2023-03-16 14:50:07] [INFO ] Flatten gal took : 11 ms
[2023-03-16 14:50:07] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 89) seen :78
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :1
Running SMT prover for 7 properties.
[2023-03-16 14:50:08] [INFO ] Invariant cache hit.
[2023-03-16 14:50:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 14:50:08] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 14:50:08] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-16 14:50:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 14:50:08] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 14:50:08] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
[2023-03-16 14:50:08] [INFO ] Flatten gal took : 7 ms
[2023-03-16 14:50:08] [INFO ] Flatten gal took : 6 ms
[2023-03-16 14:50:08] [INFO ] Input system was already deterministic with 11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 11 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 14/15 places, 11/11 transitions.
[2023-03-16 14:50:08] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:50:08] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:50:08] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 15/15 places, 11/11 transitions.
[2023-03-16 14:50:08] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:50:08] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:50:08] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/15 places, 11/11 transitions.
[2023-03-16 14:50:08] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:08] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:50:08] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 2 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 13/15 places, 11/11 transitions.
[2023-03-16 14:50:08] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:09] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 2 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 13/15 places, 11/11 transitions.
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:50:09] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/15 places, 11/11 transitions.
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:50:09] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 12 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 11 transition count 8
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 8 place count 10 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 10 place count 9 transition count 7
Applied a total of 10 rules in 16 ms. Remains 9 /15 variables (removed 6) and now considering 7/11 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 9/15 places, 7/11 transitions.
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:09] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 13/15 places, 11/11 transitions.
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:09] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 0 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/15 places, 11/11 transitions.
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:50:09] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 13/15 places, 11/11 transitions.
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:09] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 15/15 places, 11/11 transitions.
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:09] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 13/15 places, 11/11 transitions.
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:09] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 2 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 13/15 places, 11/11 transitions.
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:50:09] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 14/15 places, 11/11 transitions.
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:09] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 15/15 places, 11/11 transitions.
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:50:09] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 13/15 places, 11/11 transitions.
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:50:09] [INFO ] Input system was already deterministic with 11 transitions.
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:50:09] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:50:09] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-16 14:50:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 15 places, 11 transitions and 34 arcs took 0 ms.
Total runtime 3017 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: 15 NrTr: 11 NrArc: 34)

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

net check time: 0m 0.000sec

init dd package: 0m 3.550sec


RS generation: 0m 0.088sec


-> reachability set: #nodes 9437 (9.4e+03) #states 20,030,010 (7)



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

checking: EX [p14<=p12]
normalized: EX [p14<=p12]

abstracting: (p14<=p12)
states: 7,790,068 (6)
.-> the formula is TRUE

FORMULA RobotManipulation-PT-00010-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.054sec

checking: [AF [AX [~ [p8<=8]]] | EX [AX [AG [p10<=p12]]]]
normalized: [EX [~ [EX [E [true U ~ [p10<=p12]]]]] | ~ [EG [EX [p8<=8]]]]

abstracting: (p8<=8)
states: 19,694,090 (7)
..
EG iterations: 1
abstracting: (p10<=p12)
states: 14,254,526 (7)
..-> the formula is FALSE

FORMULA RobotManipulation-PT-00010-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.128sec

checking: [EF [[p4<=p5 | EG [EX [17<=p7]]]] | AX [AG [~ [p6<=15]]]]
normalized: [~ [EX [E [true U p6<=15]]] | E [true U [p4<=p5 | EG [EX [17<=p7]]]]]

abstracting: (17<=p7)
states: 440
..
EG iterations: 1
abstracting: (p4<=p5)
states: 19,373,640 (7)
abstracting: (p6<=15)
states: 20,028,580 (7)
.-> the formula is TRUE

FORMULA RobotManipulation-PT-00010-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.096sec

checking: AF [E [20<=p4 U E [AF [~ [p2<=p4]] U ~ [AF [p2<=12]]]]]
normalized: ~ [EG [~ [E [20<=p4 U E [~ [EG [p2<=p4]] U EG [~ [p2<=12]]]]]]]

abstracting: (p2<=12)
states: 20,007,130 (7)
.
EG iterations: 1
abstracting: (p2<=p4)
states: 13,495,768 (7)
...........................................
EG iterations: 43
abstracting: (20<=p4)
states: 22
.
EG iterations: 1
-> the formula is FALSE

FORMULA RobotManipulation-PT-00010-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.237sec

checking: EF [[AG [p2<=p1] | EF [EX [~ [p6<=p4]]]]]
normalized: E [true U [E [true U EX [~ [p6<=p4]]] | ~ [E [true U ~ [p2<=p1]]]]]

abstracting: (p2<=p1)
states: 11,823,526 (7)
abstracting: (p6<=p4)
states: 13,495,768 (7)
.-> the formula is TRUE

FORMULA RobotManipulation-PT-00010-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.514sec

checking: AF [~ [E [AG [[~ [p7<=5] | EX [p8<=18]]] U AF [p13<=p10]]]]
normalized: ~ [EG [E [~ [E [true U ~ [[EX [p8<=18] | ~ [p7<=5]]]]] U ~ [EG [~ [p13<=p10]]]]]]

abstracting: (p13<=p10)
states: 11,823,526 (7)
............................................................
EG iterations: 60
abstracting: (p7<=5)
states: 18,395,630 (7)
abstracting: (p8<=18)
states: 20,029,990 (7)
............................................
EG iterations: 43
-> the formula is TRUE

FORMULA RobotManipulation-PT-00010-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.534sec

checking: EF [[AG [[EX [[p7<=14 & 18<=p3]] | 1<=p11]] & p2<=p11]]
normalized: E [true U [p2<=p11 & ~ [E [true U ~ [[1<=p11 | EX [[p7<=14 & 18<=p3]]]]]]]]

abstracting: (18<=p3)
states: 920
abstracting: (p7<=14)
states: 20,026,006 (7)
.abstracting: (1<=p11)
states: 20,008,758 (7)
abstracting: (p2<=p11)
states: 19,034,730 (7)
-> the formula is FALSE

FORMULA RobotManipulation-PT-00010-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.176sec

checking: AX [[EF [[~ [p14<=p3] & A [19<=p1 U 19<=p8]]] & [AG [EF [p7<=p2]] & 12<=p6]]]
normalized: ~ [EX [~ [[[12<=p6 & ~ [E [true U ~ [E [true U p7<=p2]]]]] & E [true U [[~ [EG [~ [19<=p8]]] & ~ [E [~ [19<=p8] U [~ [19<=p1] & ~ [19<=p8]]]]] & ~ [p14<=p3]]]]]]]

abstracting: (p14<=p3)
states: 5,911,763 (6)
abstracting: (19<=p8)
states: 20
abstracting: (19<=p1)
states: 20
abstracting: (19<=p8)
states: 20
abstracting: (19<=p8)
states: 20
.
EG iterations: 1
abstracting: (p7<=p2)
states: 11,823,526 (7)
abstracting: (12<=p6)
states: 48,620 (4)
.-> the formula is FALSE

FORMULA RobotManipulation-PT-00010-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.267sec

checking: EF [[~ [4<=p14] & [~ [A [p12<=p13 U p6<=16]] & EX [[p12<=p4 | [p11<=p1 | p5<=16]]]]]]
normalized: E [true U [[EX [[p12<=p4 | [p11<=p1 | p5<=16]]] & ~ [[~ [EG [~ [p6<=16]]] & ~ [E [~ [p6<=16] U [~ [p12<=p13] & ~ [p6<=16]]]]]]] & ~ [4<=p14]]]

abstracting: (4<=p14)
states: 13,430,758 (7)
abstracting: (p6<=16)
states: 20,029,570 (7)
abstracting: (p12<=p13)
states: 8,342,763 (6)
abstracting: (p6<=16)
states: 20,029,570 (7)
abstracting: (p6<=16)
states: 20,029,570 (7)
.
EG iterations: 1
abstracting: (p5<=16)
states: 12,421,288 (7)
abstracting: (p11<=p1)
states: 1,400,256 (6)
abstracting: (p12<=p4)
states: 10,015,005 (7)
.-> the formula is TRUE

FORMULA RobotManipulation-PT-00010-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.675sec

checking: EX [[EG [[p10<=p8 & 19<=p3]] | ~ [E [A [A [p10<=15 U p4<=5] U [5<=p7 | p3<=p12]] U AX [p13<=p1]]]]]
normalized: EX [[~ [E [[~ [EG [~ [[5<=p7 | p3<=p12]]]] & ~ [E [~ [[5<=p7 | p3<=p12]] U [~ [[~ [EG [~ [p4<=5]]] & ~ [E [~ [p4<=5] U [~ [p10<=15] & ~ [p4<=5]]]]]] & ~ [[5<=p7 | p3<=p12]]]]]] U ~ [EX [~ [p13<=p1]]]]] | EG [[p10<=p8 & 19<=p3]]]]

abstracting: (19<=p3)
states: 191
abstracting: (p10<=p8)
states: 11,823,526 (7)
.........................
EG iterations: 25
abstracting: (p13<=p1)
states: 11,823,526 (7)
.abstracting: (p3<=p12)
states: 13,123,110 (7)
abstracting: (5<=p7)
states: 2,615,008 (6)
abstracting: (p4<=5)
states: 16,477,010 (7)
abstracting: (p10<=15)
states: 20,028,580 (7)
abstracting: (p4<=5)
states: 16,477,010 (7)
abstracting: (p4<=5)
states: 16,477,010 (7)
.
EG iterations: 1
abstracting: (p3<=p12)
states: 13,123,110 (7)
abstracting: (5<=p7)
states: 2,615,008 (6)
abstracting: (p3<=p12)
states: 13,123,110 (7)
abstracting: (5<=p7)
states: 2,615,008 (6)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA RobotManipulation-PT-00010-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.141sec

checking: E [A [EX [A [AF [18<=p6] U [p2<=19 & 12<=p13]]] U AG [[~ [[p4<=3 & p11<=20]] | [AX [p10<=1] & [p9<=p13 & 10<=p9]]]]] U AX [AX [~ [E [p14<=1 U 1<=p6]]]]]
normalized: E [[~ [EG [E [true U ~ [[[[p9<=p13 & 10<=p9] & ~ [EX [~ [p10<=1]]]] | ~ [[p4<=3 & p11<=20]]]]]]] & ~ [E [E [true U ~ [[[[p9<=p13 & 10<=p9] & ~ [EX [~ [p10<=1]]]] | ~ [[p4<=3 & p11<=20]]]]] U [~ [EX [[~ [EG [~ [[p2<=19 & 12<=p13]]]] & ~ [E [~ [[p2<=19 & 12<=p13]] U [~ [[p2<=19 & 12<=p13]] & EG [~ [18<=p6]]]]]]]] & E [true U ~ [[[[p9<=p13 & 10<=p9] & ~ [EX [~ [p10<=1]]]] | ~ [[p4<=3 & p11<=20]]]]]]]]] U ~ [EX [EX [E [p14<=1 U 1<=p6]]]]]

abstracting: (1<=p6)
states: 13,813,800 (7)
abstracting: (p14<=1)
states: 2,433,860 (6)
..abstracting: (p11<=20)
states: 20,030,010 (7)
abstracting: (p4<=3)
states: 13,002,176 (7)
abstracting: (p10<=1)
states: 10,656,360 (7)
.abstracting: (10<=p9)
states: 3,199,196 (6)
abstracting: (p9<=p13)
states: 4,088,656 (6)
abstracting: (18<=p6)
states: 110
.
EG iterations: 1
abstracting: (12<=p13)
states: 48,620 (4)
abstracting: (p2<=19)
states: 20,030,008 (7)
abstracting: (12<=p13)
states: 48,620 (4)
abstracting: (p2<=19)
states: 20,030,008 (7)
abstracting: (12<=p13)
states: 48,620 (4)
abstracting: (p2<=19)
states: 20,030,008 (7)
.
EG iterations: 1
.abstracting: (p11<=20)
states: 20,030,010 (7)
abstracting: (p4<=3)
states: 13,002,176 (7)
abstracting: (p10<=1)
states: 10,656,360 (7)
.abstracting: (10<=p9)
states: 3,199,196 (6)
abstracting: (p9<=p13)
states: 4,088,656 (6)
abstracting: (p11<=20)
states: 20,030,010 (7)
abstracting: (p4<=3)
states: 13,002,176 (7)
abstracting: (p10<=1)
states: 10,656,360 (7)
.abstracting: (10<=p9)
states: 3,199,196 (6)
abstracting: (p9<=p13)
states: 4,088,656 (6)

EG iterations: 0
-> the formula is FALSE

FORMULA RobotManipulation-PT-00010-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.726sec

checking: [EG [[AG [~ [E [p14<=p11 U p4<=p13]]] & EG [[~ [4<=p1] & AX [~ [9<=p13]]]]]] & EG [[[EX [0<=0] | EG [19<=p10]] | [EF [~ [p12<=p14]] | [p14<=p4 | EF [18<=p4]]]]]]
normalized: [EG [[[[p14<=p4 | E [true U 18<=p4]] | E [true U ~ [p12<=p14]]] | [EG [19<=p10] | EX [0<=0]]]] & EG [[EG [[~ [EX [9<=p13]] & ~ [4<=p1]]] & ~ [E [true U E [p14<=p11 U p4<=p13]]]]]]

abstracting: (p4<=p13)
states: 9,392,526 (6)
abstracting: (p14<=p11)
states: 19,141,980 (7)
abstracting: (4<=p1)
states: 4,085,950 (6)
abstracting: (9<=p13)
states: 335,920 (5)
..
EG iterations: 1
.
EG iterations: 1
abstracting: (0<=0)
states: 20,030,010 (7)
.abstracting: (19<=p10)
states: 20
.
EG iterations: 1
abstracting: (p12<=p14)
states: 13,565,552 (7)
abstracting: (18<=p4)
states: 920
abstracting: (p14<=p4)
states: 5,911,763 (6)

EG iterations: 0
-> the formula is FALSE

FORMULA RobotManipulation-PT-00010-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.770sec

checking: [AG [[[p7<=p0 & p10<=p12] | A [10<=p4 U [EF [p8<=p2] & EX [p1<=19]]]]] & AX [[AX [~ [p4<=p1]] | EF [[EF [~ [p7<=p2]] | [~ [p9<=7] | ~ [p10<=3]]]]]]]
normalized: [~ [EX [~ [[E [true U [[~ [p10<=3] | ~ [p9<=7]] | E [true U ~ [p7<=p2]]]] | ~ [EX [p4<=p1]]]]]] & ~ [E [true U ~ [[[~ [EG [~ [[EX [p1<=19] & E [true U p8<=p2]]]]] & ~ [E [~ [[EX [p1<=19] & E [true U p8<=p2]]] U [~ [10<=p4] & ~ [[EX [p1<=19] & E [true U p8<=p2]]]]]]] | [p7<=p0 & p10<=p12]]]]]]

abstracting: (p10<=p12)
states: 14,254,526 (7)
abstracting: (p7<=p0)
states: 14,254,526 (7)
abstracting: (p8<=p2)
states: 11,823,526 (7)
abstracting: (p1<=19)
states: 20,030,008 (7)
.abstracting: (10<=p4)
states: 622,336 (5)
abstracting: (p8<=p2)
states: 11,823,526 (7)
abstracting: (p1<=19)
states: 20,030,008 (7)
.abstracting: (p8<=p2)
states: 11,823,526 (7)
abstracting: (p1<=19)
states: 20,030,008 (7)
..
EG iterations: 1
abstracting: (p4<=p1)
states: 9,392,526 (6)
.abstracting: (p7<=p2)
states: 11,823,526 (7)
abstracting: (p9<=7)
states: 13,798,694 (7)
abstracting: (p10<=3)
states: 15,944,060 (7)
.-> the formula is TRUE

FORMULA RobotManipulation-PT-00010-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.583sec

checking: [EF [[[AG [[EX [0<=0] | [p10<=5 | p1<=p11]]] | E [~ [[11<=p3 | p7<=10]] U [[11<=p11 & 8<=p8] | EX [p12<=p2]]]] & [AX [E [p3<=10 U 1<=p0]] | EG [[~ [p0<=14] & ~ [p12<=4]]]]]] & AG [~ [A [EX [2<=p2] U AX [19<=p7]]]]]
normalized: [~ [E [true U [~ [EG [EX [~ [19<=p7]]]] & ~ [E [EX [~ [19<=p7]] U [~ [EX [2<=p2]] & EX [~ [19<=p7]]]]]]]] & E [true U [[EG [[~ [p12<=4] & ~ [p0<=14]]] | ~ [EX [~ [E [p3<=10 U 1<=p0]]]]] & [E [~ [[11<=p3 | p7<=10]] U [EX [p12<=p2] | [11<=p11 & 8<=p8]]] | ~ [E [true U ~ [[[p10<=5 | p1<=p11] | EX [0<=0]]]]]]]]]

abstracting: (0<=0)
states: 20,030,010 (7)
.abstracting: (p1<=p11)
states: 19,034,730 (7)
abstracting: (p10<=5)
states: 18,395,630 (7)
abstracting: (8<=p8)
states: 587,860 (5)
abstracting: (11<=p11)
states: 9,013,004 (6)
abstracting: (p12<=p2)
states: 8,342,763 (6)
.abstracting: (p7<=10)
states: 19,932,770 (7)
abstracting: (11<=p3)
states: 364,650 (5)
abstracting: (1<=p0)
states: 16,921,905 (7)
abstracting: (p3<=10)
states: 19,665,360 (7)
.abstracting: (p0<=14)
states: 19,980,961 (7)
abstracting: (p12<=4)
states: 13,737,647 (7)
.
EG iterations: 1
abstracting: (19<=p7)
states: 20
.abstracting: (2<=p2)
states: 9,373,650 (6)
.abstracting: (19<=p7)
states: 20
.abstracting: (19<=p7)
states: 20
..
EG iterations: 1
-> the formula is FALSE

FORMULA RobotManipulation-PT-00010-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.859sec

checking: AG [[EF [EG [~ [p3<=p7]]] | [[EG [[~ [p9<=16] | p13<=16]] & ~ [5<=p0]] & [A [p10<=10 U p6<=p13] & [A [13<=p13 U p10<=p0] & EG [[[~ [p14<=p2] & ~ [16<=p0]] | E [18<=p8 U p13<=18]]]]]]]]
normalized: ~ [E [true U ~ [[[[[EG [[E [18<=p8 U p13<=18] | [~ [16<=p0] & ~ [p14<=p2]]]] & [~ [EG [~ [p10<=p0]]] & ~ [E [~ [p10<=p0] U [~ [13<=p13] & ~ [p10<=p0]]]]]] & [~ [EG [~ [p6<=p13]]] & ~ [E [~ [p6<=p13] U [~ [p10<=10] & ~ [p6<=p13]]]]]] & [~ [5<=p0] & EG [[p13<=16 | ~ [p9<=16]]]]] | E [true U EG [~ [p3<=p7]]]]]]]

abstracting: (p3<=p7)
states: 9,392,526 (6)
................................................................................
EG iterations: 80
abstracting: (p9<=16)
states: 19,987,240 (7)
abstracting: (p13<=16)
states: 20,029,570 (7)
.
EG iterations: 1
abstracting: (5<=p0)
states: 6,292,363 (6)
abstracting: (p6<=p13)
states: 11,823,526 (7)
abstracting: (p10<=10)
states: 19,932,770 (7)
abstracting: (p6<=p13)
states: 11,823,526 (7)
abstracting: (p6<=p13)
states: 11,823,526 (7)
.........................................
EG iterations: 41
abstracting: (p10<=p0)
states: 14,254,526 (7)
abstracting: (13<=p13)
states: 22,880 (4)
abstracting: (p10<=p0)
states: 14,254,526 (7)
abstracting: (p10<=p0)
states: 14,254,526 (7)
.....................
EG iterations: 21
abstracting: (p14<=p2)
states: 4,917,198 (6)
abstracting: (16<=p0)
states: 22,022 (4)
abstracting: (p13<=18)
states: 20,029,990 (7)
abstracting: (18<=p8)
states: 110

EG iterations: 0
-> the formula is TRUE

FORMULA RobotManipulation-PT-00010-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.691sec

checking: [[[EG [~ [p12<=p13]] | AX [~ [p12<=p2]]] | [EX [0<=0] | ~ [A [EX [2<=p9] U p9<=p2]]]] | [[AF [[~ [p14<=p9] | ~ [p14<=18]]] | AX [1<=0]] | [~ [A [[p6<=4 | p7<=p0] U ~ [p12<=p8]]] | EX [EG [AG [[1<=p2 & p2<=21]]]]]]]
normalized: [[[EX [EG [~ [E [true U ~ [[1<=p2 & p2<=21]]]]]] | ~ [[~ [EG [p12<=p8]] & ~ [E [p12<=p8 U [p12<=p8 & ~ [[p6<=4 | p7<=p0]]]]]]]] | [~ [EX [~ [1<=0]]] | ~ [EG [~ [[~ [p14<=18] | ~ [p14<=p9]]]]]]] | [[~ [[~ [EG [~ [p9<=p2]]] & ~ [E [~ [p9<=p2] U [~ [EX [2<=p9]] & ~ [p9<=p2]]]]]] | EX [0<=0]] | [~ [EX [p12<=p2]] | EG [~ [p12<=p13]]]]]

abstracting: (p12<=p13)
states: 8,342,763 (6)
......................
EG iterations: 22
abstracting: (p12<=p2)
states: 8,342,763 (6)
.abstracting: (0<=0)
states: 20,030,010 (7)
.abstracting: (p9<=p2)
states: 1,776,060 (6)
abstracting: (2<=p9)
states: 18,506,950 (7)
.abstracting: (p9<=p2)
states: 1,776,060 (6)
abstracting: (p9<=p2)
states: 1,776,060 (6)
.
EG iterations: 1
abstracting: (p14<=p9)
states: 11,585,717 (7)
abstracting: (p14<=18)
states: 20,022,808 (7)
......................
EG iterations: 22
abstracting: (1<=0)
states: 0
.abstracting: (p7<=p0)
states: 14,254,526 (7)
abstracting: (p6<=4)
states: 17,415,002 (7)
abstracting: (p12<=p8)
states: 8,342,763 (6)
abstracting: (p12<=p8)
states: 8,342,763 (6)
abstracting: (p12<=p8)
states: 8,342,763 (6)
.
EG iterations: 1
abstracting: (p2<=21)
states: 20,030,010 (7)
abstracting: (1<=p2)
states: 13,813,800 (7)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA RobotManipulation-PT-00010-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.990sec

totally nodes used: 3215425 (3.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 16795096 8376011 25171107
used/not used/entry size/cache size: 9927613 57181251 16 1024MB
basic ops cache: hits/miss/sum: 7153454 4001397 11154851
used/not used/entry size/cache size: 5014990 11762226 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: 586749 284704 871453
used/not used/entry size/cache size: 279669 8108939 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 64414565
1 2508633
2 116467
3 31620
4 12364
5 7488
6 4392
7 2308
8 1379
9 1139
>= 10 8509

Total processing time: 0m19.341sec


BK_STOP 1678978230000

--------------------
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:853 (77), effective:201 (18)

initing FirstDep: 0m 0.000sec


iterations count:90 (8), effective:29 (2)

iterations count:91 (8), effective:30 (2)

iterations count:21 (1), effective:5 (0)

iterations count:444 (40), effective:130 (11)

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

iterations count:63 (5), effective:28 (2)

iterations count:174 (15), effective:56 (5)

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

iterations count:671 (61), effective:180 (16)

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

iterations count:331 (30), effective:100 (9)

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

iterations count:643 (58), effective:173 (15)

iterations count:121 (11), effective:40 (3)

iterations count:61 (5), effective:11 (1)

iterations count:719 (65), effective:156 (14)

iterations count:259 (23), effective:56 (5)

iterations count:177 (16), effective:42 (3)

iterations count:52 (4), effective:9 (0)

iterations count:117 (10), effective:35 (3)

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

iterations count:117 (10), effective:35 (3)

iterations count:47 (4), effective:9 (0)

iterations count:117 (10), effective:35 (3)

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

iterations count:71 (6), effective:20 (1)

iterations count:51 (4), effective:10 (0)

iterations count:207 (18), effective:50 (4)

iterations count:695 (63), effective:144 (13)

iterations count:141 (12), effective:30 (2)

iterations count:141 (12), effective:30 (2)

iterations count:141 (12), effective:30 (2)

iterations count:304 (27), effective:64 (5)

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

iterations count:41 (3), effective:17 (1)

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

iterations count:41 (3), effective:10 (0)

iterations count:201 (18), effective:19 (1)

iterations count:811 (73), effective:180 (16)

iterations count:129 (11), effective:27 (2)

iterations count:491 (44), effective:117 (10)

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

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

iterations count:448 (40), effective:76 (6)

iterations count:379 (34), effective:88 (8)

iterations count:211 (19), effective:20 (1)

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="RobotManipulation-PT-00010"
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 RobotManipulation-PT-00010, 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 r362-smll-167891812100025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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