About the Execution of Marcie+red for RobotManipulation-PT-00020
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
10061.924 | 248900.00 | 254564.00 | 1465.00 | FTFTTFFFFTTFTFTF | 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.r362-smll-167891812100034.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-00020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r362-smll-167891812100034
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 5.9K Feb 26 05:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 05:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 05:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 05:30 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 4.4K Feb 25 16:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 16K Feb 25 16:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 05:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 05:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 05:31 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-00020-CTLFireability-00
FORMULA_NAME RobotManipulation-PT-00020-CTLFireability-01
FORMULA_NAME RobotManipulation-PT-00020-CTLFireability-02
FORMULA_NAME RobotManipulation-PT-00020-CTLFireability-03
FORMULA_NAME RobotManipulation-PT-00020-CTLFireability-04
FORMULA_NAME RobotManipulation-PT-00020-CTLFireability-05
FORMULA_NAME RobotManipulation-PT-00020-CTLFireability-06
FORMULA_NAME RobotManipulation-PT-00020-CTLFireability-07
FORMULA_NAME RobotManipulation-PT-00020-CTLFireability-08
FORMULA_NAME RobotManipulation-PT-00020-CTLFireability-09
FORMULA_NAME RobotManipulation-PT-00020-CTLFireability-10
FORMULA_NAME RobotManipulation-PT-00020-CTLFireability-11
FORMULA_NAME RobotManipulation-PT-00020-CTLFireability-12
FORMULA_NAME RobotManipulation-PT-00020-CTLFireability-13
FORMULA_NAME RobotManipulation-PT-00020-CTLFireability-14
FORMULA_NAME RobotManipulation-PT-00020-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678978334966
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RobotManipulation-PT-00020
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 14:52:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 14:52:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 14:52:18] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2023-03-16 14:52:18] [INFO ] Transformed 15 places.
[2023-03-16 14:52:18] [INFO ] Transformed 11 transitions.
[2023-03-16 14:52:18] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 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 19 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:52:18] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-16 14:52:19] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-16 14:52:19] [INFO ] Invariant cache hit.
[2023-03-16 14:52:19] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2023-03-16 14:52:19] [INFO ] Invariant cache hit.
[2023-03-16 14:52:19] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 440 ms. Remains : 15/15 places, 11/11 transitions.
Support contains 15 out of 15 places after structural reductions.
[2023-03-16 14:52:19] [INFO ] Flatten gal took : 30 ms
[2023-03-16 14:52:19] [INFO ] Flatten gal took : 10 ms
[2023-03-16 14:52:19] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 26) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 14:52:19] [INFO ] Invariant cache hit.
[2023-03-16 14:52:19] [INFO ] After 34ms 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-16 14:52:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-16 14:52:19] [INFO ] Flatten gal took : 6 ms
FORMULA RobotManipulation-PT-00020-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 14:52:19] [INFO ] Flatten gal took : 6 ms
[2023-03-16 14:52:19] [INFO ] Input system was already deterministic with 11 transitions.
Computed a total of 0 stabilizing places and 0 stable 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
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 13 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 10
Applied a total of 4 rules in 11 ms. Remains 12 /15 variables (removed 3) and now considering 10/11 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 12/15 places, 10/11 transitions.
[2023-03-16 14:52:19] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:52:19] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:52:19] [INFO ] Input system was already deterministic with 10 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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6 place count 11 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 10 place count 9 transition count 7
Applied a total of 10 rules in 7 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 7 ms. Remains : 9/15 places, 7/11 transitions.
[2023-03-16 14:52:20] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:52:20] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:52:20] [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 1 ms. Remains : 13/15 places, 11/11 transitions.
[2023-03-16 14:52:20] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:52:20] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:52:20] [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.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 12 transition count 10
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 2 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Applied a total of 6 rules in 3 ms. Remains 11 /15 variables (removed 4) and now considering 9/11 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 11/15 places, 9/11 transitions.
[2023-03-16 14:52:20] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:52:20] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:52:20] [INFO ] Input system was already deterministic with 9 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 13 transition count 8
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 10 transition count 8
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 2 with 4 rules applied. Total rules applied 12 place count 8 transition count 6
Applied a total of 12 rules in 3 ms. Remains 8 /15 variables (removed 7) and now considering 6/11 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 8/15 places, 6/11 transitions.
[2023-03-16 14:52:20] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:52:20] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:52:20] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 42 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
FORMULA RobotManipulation-PT-00020-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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:52:20] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:52:20] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:52:20] [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:52:20] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:52:20] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:52:20] [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:52:20] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:52:20] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:52:20] [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 0 ms. Remains : 15/15 places, 11/11 transitions.
[2023-03-16 14:52:20] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:52:20] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:52:20] [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 0 ms. Remains : 15/15 places, 11/11 transitions.
[2023-03-16 14:52:20] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:52:20] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:52:20] [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:52:20] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:52:20] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:52:20] [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 2 ms. Remains : 13/15 places, 11/11 transitions.
[2023-03-16 14:52:20] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:52:20] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:52:20] [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:52:20] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:52:20] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:52:20] [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:52:20] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:52:20] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:52:20] [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 0 ms. Remains : 14/15 places, 11/11 transitions.
[2023-03-16 14:52:20] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:52:20] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:52:20] [INFO ] Input system was already deterministic with 11 transitions.
[2023-03-16 14:52:20] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:52:20] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:52:20] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-16 14:52:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 15 places, 11 transitions and 34 arcs took 1 ms.
Total runtime 1808 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 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.680sec
RS generation: 0m 0.773sec
-> reachability set: #nodes 58057 (5.8e+04) #states 4,108,911,268 (9)
starting MCC model checker
--------------------------
checking: AF [EX [1<=p8]]
normalized: ~ [EG [~ [EX [1<=p8]]]]
abstracting: (1<=p8)
states: 3,354,213,280 (9)
............................................................................................................................
EG iterations: 123
-> the formula is TRUE
FORMULA RobotManipulation-PT-00020-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m29.130sec
checking: AG [EF [[1<=p7 & 1<=p11]]]
normalized: ~ [E [true U ~ [E [true U [1<=p7 & 1<=p11]]]]]
abstracting: (1<=p11)
states: 4,108,639,766 (9)
abstracting: (1<=p7)
states: 3,354,213,280 (9)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00020-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.973sec
checking: EX [[1<=p2 & 1<=p9]]
normalized: EX [[1<=p2 & 1<=p9]]
abstracting: (1<=p9)
states: 4,090,177,630 (9)
abstracting: (1<=p2)
states: 3,354,213,280 (9)
.-> the formula is FALSE
FORMULA RobotManipulation-PT-00020-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.763sec
checking: A [[AF [~ [[1<=p5 & 1<=p1]]] & 1<=p12] U [1<=p7 & 1<=p11]]
normalized: [~ [EG [~ [[1<=p7 & 1<=p11]]]] & ~ [E [~ [[1<=p7 & 1<=p11]] U [~ [[1<=p12 & ~ [EG [[1<=p5 & 1<=p1]]]]] & ~ [[1<=p7 & 1<=p11]]]]]]
abstracting: (1<=p11)
states: 4,108,639,766 (9)
abstracting: (1<=p7)
states: 3,354,213,280 (9)
abstracting: (1<=p1)
states: 3,354,213,280 (9)
abstracting: (1<=p5)
states: 4,108,910,366 (9)
.
EG iterations: 1
abstracting: (1<=p12)
states: 3,731,562,274 (9)
abstracting: (1<=p11)
states: 4,108,639,766 (9)
abstracting: (1<=p7)
states: 3,354,213,280 (9)
abstracting: (1<=p11)
states: 4,108,639,766 (9)
abstracting: (1<=p7)
states: 3,354,213,280 (9)
...................................................................................................................................................................
EG iterations: 163
-> the formula is FALSE
FORMULA RobotManipulation-PT-00020-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m26.416sec
checking: AG [A [[EF [1<=p10] | [1<=p0 & 1<=p4]] U EF [[1<=p3 & 1<=p5]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [E [true U [1<=p3 & 1<=p5]]]]] & ~ [E [~ [E [true U [1<=p3 & 1<=p5]]] U [~ [[[1<=p0 & 1<=p4] | E [true U 1<=p10]]] & ~ [E [true U [1<=p3 & 1<=p5]]]]]]]]]]
abstracting: (1<=p5)
states: 4,108,910,366 (9)
abstracting: (1<=p3)
states: 3,668,670,775 (9)
abstracting: (1<=p10)
states: 3,354,213,280 (9)
abstracting: (1<=p4)
states: 3,668,670,775 (9)
abstracting: (1<=p0)
states: 3,731,562,274 (9)
abstracting: (1<=p5)
states: 4,108,910,366 (9)
abstracting: (1<=p3)
states: 3,668,670,775 (9)
abstracting: (1<=p5)
states: 4,108,910,366 (9)
abstracting: (1<=p3)
states: 3,668,670,775 (9)
.
EG iterations: 1
-> the formula is TRUE
FORMULA RobotManipulation-PT-00020-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.410sec
checking: EF [[AG [AF [E [[1<=p3 & 1<=p5] U [1<=p0 & 1<=p4]]]] & EX [[1<=p3 & 1<=p5]]]]
normalized: E [true U [EX [[1<=p3 & 1<=p5]] & ~ [E [true U EG [~ [E [[1<=p3 & 1<=p5] U [1<=p0 & 1<=p4]]]]]]]]
abstracting: (1<=p4)
states: 3,668,670,775 (9)
abstracting: (1<=p0)
states: 3,731,562,274 (9)
abstracting: (1<=p5)
states: 4,108,910,366 (9)
abstracting: (1<=p3)
states: 3,668,670,775 (9)
..
EG iterations: 2
abstracting: (1<=p5)
states: 4,108,910,366 (9)
abstracting: (1<=p3)
states: 3,668,670,775 (9)
.-> the formula is FALSE
FORMULA RobotManipulation-PT-00020-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 8.948sec
checking: AF [EX [~ [E [[[1<=p2 & 1<=p9] & [1<=p13 & [1<=p14 & p8<=0]]] U ~ [EG [[1<=p3 & 1<=p5]]]]]]]
normalized: ~ [EG [~ [EX [~ [E [[[1<=p13 & [1<=p14 & p8<=0]] & [1<=p2 & 1<=p9]] U ~ [EG [[1<=p3 & 1<=p5]]]]]]]]]
abstracting: (1<=p5)
states: 4,108,910,366 (9)
abstracting: (1<=p3)
states: 3,668,670,775 (9)
.
EG iterations: 1
abstracting: (1<=p9)
states: 4,090,177,630 (9)
abstracting: (1<=p2)
states: 3,354,213,280 (9)
abstracting: (p8<=0)
states: 754,697,988 (8)
abstracting: (1<=p14)
states: 4,046,019,769 (9)
abstracting: (1<=p13)
states: 3,354,213,280 (9)
....................................................................................................................................................................
EG iterations: 163
-> the formula is TRUE
FORMULA RobotManipulation-PT-00020-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m51.831sec
checking: [EG [AX [AX [[[p1<=0 | p5<=0] & [p3<=0 | p5<=0]]]]] & EX [[~ [A [E [[1<=p2 & 1<=p9] U 1<=p8] U AX [1<=p8]]] | AF [p12<=0]]]]
normalized: [EX [[~ [EG [~ [p12<=0]]] | ~ [[~ [EG [EX [~ [1<=p8]]]] & ~ [E [EX [~ [1<=p8]] U [~ [E [[1<=p2 & 1<=p9] U 1<=p8]] & EX [~ [1<=p8]]]]]]]]] & EG [~ [EX [EX [~ [[[p3<=0 | p5<=0] & [p1<=0 | p5<=0]]]]]]]]
abstracting: (p5<=0)
states: 902
abstracting: (p1<=0)
states: 754,697,988 (8)
abstracting: (p5<=0)
states: 902
abstracting: (p3<=0)
states: 440,240,493 (8)
.............................................
EG iterations: 43
abstracting: (1<=p8)
states: 3,354,213,280 (9)
.abstracting: (1<=p8)
states: 3,354,213,280 (9)
abstracting: (1<=p9)
states: 4,090,177,630 (9)
abstracting: (1<=p2)
states: 3,354,213,280 (9)
abstracting: (1<=p8)
states: 3,354,213,280 (9)
.abstracting: (1<=p8)
states: 3,354,213,280 (9)
..
EG iterations: 1
abstracting: (p12<=0)
states: 377,348,994 (8)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA RobotManipulation-PT-00020-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 8.694sec
checking: AX [[EG [~ [E [EG [1<=p8] U [[1<=p3 & 1<=p5] | [1<=p13 & 1<=p14]]]]] | [AG [p10<=0] | [EX [1<=p7] & EF [[p10<=0 & p7<=0]]]]]]
normalized: ~ [EX [~ [[[[E [true U [p10<=0 & p7<=0]] & EX [1<=p7]] | ~ [E [true U ~ [p10<=0]]]] | EG [~ [E [EG [1<=p8] U [[1<=p13 & 1<=p14] | [1<=p3 & 1<=p5]]]]]]]]]
abstracting: (1<=p5)
states: 4,108,910,366 (9)
abstracting: (1<=p3)
states: 3,668,670,775 (9)
abstracting: (1<=p14)
states: 4,046,019,769 (9)
abstracting: (1<=p13)
states: 3,354,213,280 (9)
abstracting: (1<=p8)
states: 3,354,213,280 (9)
.
EG iterations: 1
...................................................................................................................................................................
EG iterations: 163
abstracting: (p10<=0)
states: 754,697,988 (8)
abstracting: (1<=p7)
states: 3,354,213,280 (9)
.abstracting: (p7<=0)
states: 754,697,988 (8)
abstracting: (p10<=0)
states: 754,697,988 (8)
.-> the formula is FALSE
FORMULA RobotManipulation-PT-00020-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m13.967sec
checking: EG [[AF [[1<=p6 | [AX [1<=p12] & [p7<=0 | [p11<=0 | p10<=0]]]]] & [EG [AF [[p7<=0 | p11<=0]]] & [EX [p8<=0] | [1<=p13 & 1<=p14]]]]]
normalized: EG [[[[[1<=p13 & 1<=p14] | EX [p8<=0]] & EG [~ [EG [~ [[p7<=0 | p11<=0]]]]]] & ~ [EG [~ [[1<=p6 | [[p7<=0 | [p11<=0 | p10<=0]] & ~ [EX [~ [1<=p12]]]]]]]]]]
abstracting: (1<=p12)
states: 3,731,562,274 (9)
.abstracting: (p10<=0)
states: 754,697,988 (8)
abstracting: (p11<=0)
states: 271,502 (5)
abstracting: (p7<=0)
states: 754,697,988 (8)
abstracting: (1<=p6)
states: 3,354,213,280 (9)
...........................................
EG iterations: 43
abstracting: (p11<=0)
states: 271,502 (5)
abstracting: (p7<=0)
states: 754,697,988 (8)
.
EG iterations: 1
...................................................................................................................................................................
EG iterations: 163
abstracting: (p8<=0)
states: 754,697,988 (8)
.abstracting: (1<=p14)
states: 4,046,019,769 (9)
abstracting: (1<=p13)
states: 3,354,213,280 (9)
.
EG iterations: 1
-> the formula is FALSE
FORMULA RobotManipulation-PT-00020-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m17.834sec
checking: E [[~ [[A [EX [[1<=p0 & 1<=p4]] U [[1<=p1 & 1<=p5] | [1<=p8 | ~ [[1<=p3 & 1<=p5]]]]] & [1<=p13 & 1<=p14]]] | [1<=p3 & 1<=p5]] U [1<=p6 & AF [[1<=p13 & 1<=p14]]]]
normalized: E [[[1<=p3 & 1<=p5] | ~ [[[1<=p13 & 1<=p14] & [~ [EG [~ [[[1<=p8 | ~ [[1<=p3 & 1<=p5]]] | [1<=p1 & 1<=p5]]]]] & ~ [E [~ [[[1<=p8 | ~ [[1<=p3 & 1<=p5]]] | [1<=p1 & 1<=p5]]] U [~ [EX [[1<=p0 & 1<=p4]]] & ~ [[[1<=p8 | ~ [[1<=p3 & 1<=p5]]] | [1<=p1 & 1<=p5]]]]]]]]]] U [1<=p6 & ~ [EG [~ [[1<=p13 & 1<=p14]]]]]]
abstracting: (1<=p14)
states: 4,046,019,769 (9)
abstracting: (1<=p13)
states: 3,354,213,280 (9)
...................................................................................
EG iterations: 83
abstracting: (1<=p6)
states: 3,354,213,280 (9)
abstracting: (1<=p5)
states: 4,108,910,366 (9)
abstracting: (1<=p1)
states: 3,354,213,280 (9)
abstracting: (1<=p5)
states: 4,108,910,366 (9)
abstracting: (1<=p3)
states: 3,668,670,775 (9)
abstracting: (1<=p8)
states: 3,354,213,280 (9)
abstracting: (1<=p4)
states: 3,668,670,775 (9)
abstracting: (1<=p0)
states: 3,731,562,274 (9)
.abstracting: (1<=p5)
states: 4,108,910,366 (9)
abstracting: (1<=p1)
states: 3,354,213,280 (9)
abstracting: (1<=p5)
states: 4,108,910,366 (9)
abstracting: (1<=p3)
states: 3,668,670,775 (9)
abstracting: (1<=p8)
states: 3,354,213,280 (9)
abstracting: (1<=p5)
states: 4,108,910,366 (9)
abstracting: (1<=p1)
states: 3,354,213,280 (9)
abstracting: (1<=p5)
states: 4,108,910,366 (9)
abstracting: (1<=p3)
states: 3,668,670,775 (9)
abstracting: (1<=p8)
states: 3,354,213,280 (9)
.
EG iterations: 1
abstracting: (1<=p14)
states: 4,046,019,769 (9)
abstracting: (1<=p13)
states: 3,354,213,280 (9)
abstracting: (1<=p5)
states: 4,108,910,366 (9)
abstracting: (1<=p3)
states: 3,668,670,775 (9)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00020-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m14.203sec
checking: [EG [E [~ [[AF [1<=p7] | [1<=p10 & [1<=p1 & 1<=p5]]]] U AG [[AX [[1<=p0 & 1<=p4]] | E [[1<=p13 & 1<=p14] U [1<=p13 & 1<=p14]]]]]] & A [AX [[EF [~ [[1<=p3 & 1<=p5]]] | ~ [E [[1<=p2 & 1<=p9] U 1<=p10]]]] U 1<=p7]]
normalized: [[~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [EX [~ [[~ [E [[1<=p2 & 1<=p9] U 1<=p10]] | E [true U ~ [[1<=p3 & 1<=p5]]]]]] & ~ [1<=p7]]]]] & EG [E [~ [[[1<=p10 & [1<=p1 & 1<=p5]] | ~ [EG [~ [1<=p7]]]]] U ~ [E [true U ~ [[E [[1<=p13 & 1<=p14] U [1<=p13 & 1<=p14]] | ~ [EX [~ [[1<=p0 & 1<=p4]]]]]]]]]]]
abstracting: (1<=p4)
states: 3,668,670,775 (9)
abstracting: (1<=p0)
states: 3,731,562,274 (9)
.abstracting: (1<=p14)
states: 4,046,019,769 (9)
abstracting: (1<=p13)
states: 3,354,213,280 (9)
abstracting: (1<=p14)
states: 4,046,019,769 (9)
abstracting: (1<=p13)
states: 3,354,213,280 (9)
abstracting: (1<=p7)
states: 3,354,213,280 (9)
...................................................................................................................................................................
EG iterations: 163
abstracting: (1<=p5)
states: 4,108,910,366 (9)
abstracting: (1<=p1)
states: 3,354,213,280 (9)
abstracting: (1<=p10)
states: 3,354,213,280 (9)
.
EG iterations: 1
abstracting: (1<=p7)
states: 3,354,213,280 (9)
abstracting: (1<=p5)
states: 4,108,910,366 (9)
abstracting: (1<=p3)
states: 3,668,670,775 (9)
abstracting: (1<=p10)
states: 3,354,213,280 (9)
abstracting: (1<=p9)
states: 4,090,177,630 (9)
abstracting: (1<=p2)
states: 3,354,213,280 (9)
.abstracting: (1<=p7)
states: 3,354,213,280 (9)
abstracting: (1<=p7)
states: 3,354,213,280 (9)
...................................................................................................................................................................
EG iterations: 163
-> the formula is FALSE
FORMULA RobotManipulation-PT-00020-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m23.979sec
checking: [EF [[[[E [1<=p7 U [1<=p3 & 1<=p5]] | [[[1<=p7 & 1<=p11] & [1<=p0 & 1<=p4]] | [1<=p2 & 1<=p9]]] & ~ [A [AG [1<=p7] U EX [[1<=p0 & 1<=p4]]]]] & [~ [E [[1<=p3 & 1<=p5] U [1<=p3 & 1<=p5]]] & [p3<=0 | p5<=0]]]] & EF [~ [A [1<=p7 U ~ [[AX [1<=p8] | EF [[1<=p13 & 1<=p14]]]]]]]]
normalized: [E [true U ~ [[~ [EG [[E [true U [1<=p13 & 1<=p14]] | ~ [EX [~ [1<=p8]]]]]] & ~ [E [[E [true U [1<=p13 & 1<=p14]] | ~ [EX [~ [1<=p8]]]] U [~ [1<=p7] & [E [true U [1<=p13 & 1<=p14]] | ~ [EX [~ [1<=p8]]]]]]]]]] & E [true U [[[p3<=0 | p5<=0] & ~ [E [[1<=p3 & 1<=p5] U [1<=p3 & 1<=p5]]]] & [~ [[~ [EG [~ [EX [[1<=p0 & 1<=p4]]]]] & ~ [E [~ [EX [[1<=p0 & 1<=p4]]] U [E [true U ~ [1<=p7]] & ~ [EX [[1<=p0 & 1<=p4]]]]]]]] & [[[1<=p2 & 1<=p9] | [[1<=p0 & 1<=p4] & [1<=p7 & 1<=p11]]] | E [1<=p7 U [1<=p3 & 1<=p5]]]]]]]
abstracting: (1<=p5)
states: 4,108,910,366 (9)
abstracting: (1<=p3)
states: 3,668,670,775 (9)
abstracting: (1<=p7)
states: 3,354,213,280 (9)
abstracting: (1<=p11)
states: 4,108,639,766 (9)
abstracting: (1<=p7)
states: 3,354,213,280 (9)
abstracting: (1<=p4)
states: 3,668,670,775 (9)
abstracting: (1<=p0)
states: 3,731,562,274 (9)
abstracting: (1<=p9)
states: 4,090,177,630 (9)
abstracting: (1<=p2)
states: 3,354,213,280 (9)
abstracting: (1<=p4)
states: 3,668,670,775 (9)
abstracting: (1<=p0)
states: 3,731,562,274 (9)
.abstracting: (1<=p7)
states: 3,354,213,280 (9)
abstracting: (1<=p4)
states: 3,668,670,775 (9)
abstracting: (1<=p0)
states: 3,731,562,274 (9)
.abstracting: (1<=p4)
states: 3,668,670,775 (9)
abstracting: (1<=p0)
states: 3,731,562,274 (9)
...
EG iterations: 2
abstracting: (1<=p5)
states: 4,108,910,366 (9)
abstracting: (1<=p3)
states: 3,668,670,775 (9)
abstracting: (1<=p5)
states: 4,108,910,366 (9)
abstracting: (1<=p3)
states: 3,668,670,775 (9)
abstracting: (p5<=0)
states: 902
abstracting: (p3<=0)
states: 440,240,493 (8)
abstracting: (1<=p8)
states: 3,354,213,280 (9)
.abstracting: (1<=p14)
states: 4,046,019,769 (9)
abstracting: (1<=p13)
states: 3,354,213,280 (9)
abstracting: (1<=p7)
states: 3,354,213,280 (9)
abstracting: (1<=p8)
states: 3,354,213,280 (9)
.abstracting: (1<=p14)
states: 4,046,019,769 (9)
abstracting: (1<=p13)
states: 3,354,213,280 (9)
abstracting: (1<=p8)
states: 3,354,213,280 (9)
.abstracting: (1<=p14)
states: 4,046,019,769 (9)
abstracting: (1<=p13)
states: 3,354,213,280 (9)
EG iterations: 0
-> the formula is TRUE
FORMULA RobotManipulation-PT-00020-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 7.645sec
checking: [AG [~ [A [AG [[[1<=p2 & 1<=p9] & [1<=p7 & 1<=p11]]] U [[AG [[1<=p10 & [1<=p1 & 1<=p5]]] & 1<=p8] & [1<=p12 & [1<=p13 & 1<=p14]]]]]] | EF [[[EG [[p7<=0 & p8<=0]] | ~ [E [EX [[1<=p7 & 1<=p11]] U A [1<=p6 U 1<=p6]]]] & A [[1<=p13 & [1<=p14 & 1<=p8]] U A [[1<=p2 & 1<=p9] U [1<=p7 & 1<=p11]]]]]]
normalized: [E [true U [[~ [EG [~ [[~ [EG [~ [[1<=p7 & 1<=p11]]]] & ~ [E [~ [[1<=p7 & 1<=p11]] U [~ [[1<=p2 & 1<=p9]] & ~ [[1<=p7 & 1<=p11]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[1<=p7 & 1<=p11]]]] & ~ [E [~ [[1<=p7 & 1<=p11]] U [~ [[1<=p2 & 1<=p9]] & ~ [[1<=p7 & 1<=p11]]]]]]] U [~ [[1<=p13 & [1<=p14 & 1<=p8]]] & ~ [[~ [EG [~ [[1<=p7 & 1<=p11]]]] & ~ [E [~ [[1<=p7 & 1<=p11]] U [~ [[1<=p2 & 1<=p9]] & ~ [[1<=p7 & 1<=p11]]]]]]]]]]] & [~ [E [EX [[1<=p7 & 1<=p11]] U [~ [EG [~ [1<=p6]]] & ~ [E [~ [1<=p6] U [~ [1<=p6] & ~ [1<=p6]]]]]]] | EG [[p7<=0 & p8<=0]]]]] | ~ [E [true U [~ [EG [~ [[[1<=p12 & [1<=p13 & 1<=p14]] & [1<=p8 & ~ [E [true U ~ [[1<=p10 & [1<=p1 & 1<=p5]]]]]]]]]] & ~ [E [~ [[[1<=p12 & [1<=p13 & 1<=p14]] & [1<=p8 & ~ [E [true U ~ [[1<=p10 & [1<=p1 & 1<=p5]]]]]]]] U [E [true U ~ [[[1<=p7 & 1<=p11] & [1<=p2 & 1<=p9]]]] & ~ [[[1<=p12 & [1<=p13 & 1<=p14]] & [1<=p8 & ~ [E [true U ~ [[1<=p10 & [1<=p1 & 1<=p5]]]]]]]]]]]]]]]
abstracting: (1<=p5)
states: 4,108,910,366 (9)
abstracting: (1<=p1)
states: 3,354,213,280 (9)
abstracting: (1<=p10)
states: 3,354,213,280 (9)
abstracting: (1<=p8)
states: 3,354,213,280 (9)
abstracting: (1<=p14)
states: 4,046,019,769 (9)
abstracting: (1<=p13)
states: 3,354,213,280 (9)
abstracting: (1<=p12)
states: 3,731,562,274 (9)
abstracting: (1<=p9)
states: 4,090,177,630 (9)
abstracting: (1<=p2)
states: 3,354,213,280 (9)
abstracting: (1<=p11)
states: 4,108,639,766 (9)
abstracting: (1<=p7)
states: 3,354,213,280 (9)
abstracting: (1<=p5)
states: 4,108,910,366 (9)
abstracting: (1<=p1)
states: 3,354,213,280 (9)
abstracting: (1<=p10)
states: 3,354,213,280 (9)
abstracting: (1<=p8)
states: 3,354,213,280 (9)
abstracting: (1<=p14)
states: 4,046,019,769 (9)
abstracting: (1<=p13)
states: 3,354,213,280 (9)
abstracting: (1<=p12)
states: 3,731,562,274 (9)
abstracting: (1<=p5)
states: 4,108,910,366 (9)
abstracting: (1<=p1)
states: 3,354,213,280 (9)
abstracting: (1<=p10)
states: 3,354,213,280 (9)
abstracting: (1<=p8)
states: 3,354,213,280 (9)
abstracting: (1<=p14)
states: 4,046,019,769 (9)
abstracting: (1<=p13)
states: 3,354,213,280 (9)
abstracting: (1<=p12)
states: 3,731,562,274 (9)
EG iterations: 0
abstracting: (p8<=0)
states: 754,697,988 (8)
abstracting: (p7<=0)
states: 754,697,988 (8)
...........................................................................................................................
EG iterations: 123
abstracting: (1<=p6)
states: 3,354,213,280 (9)
abstracting: (1<=p6)
states: 3,354,213,280 (9)
abstracting: (1<=p6)
states: 3,354,213,280 (9)
abstracting: (1<=p6)
states: 3,354,213,280 (9)
...........................................
EG iterations: 43
abstracting: (1<=p11)
states: 4,108,639,766 (9)
abstracting: (1<=p7)
states: 3,354,213,280 (9)
.abstracting: (1<=p11)
states: 4,108,639,766 (9)
abstracting: (1<=p7)
states: 3,354,213,280 (9)
abstracting: (1<=p9)
states: 4,090,177,630 (9)
abstracting: (1<=p2)
states: 3,354,213,280 (9)
abstracting: (1<=p11)
states: 4,108,639,766 (9)
abstracting: (1<=p7)
states: 3,354,213,280 (9)
abstracting: (1<=p11)
states: 4,108,639,766 (9)
abstracting: (1<=p7)
states: 3,354,213,280 (9)
...................................................................................................................................................................
EG iterations: 163
abstracting: (1<=p8)
states: 3,354,213,280 (9)
abstracting: (1<=p14)
states: 4,046,019,769 (9)
abstracting: (1<=p13)
states: 3,354,213,280 (9)
abstracting: (1<=p11)
states: 4,108,639,766 (9)
abstracting: (1<=p7)
states: 3,354,213,280 (9)
abstracting: (1<=p9)
states: 4,090,177,630 (9)
abstracting: (1<=p2)
states: 3,354,213,280 (9)
abstracting: (1<=p11)
states: 4,108,639,766 (9)
abstracting: (1<=p7)
states: 3,354,213,280 (9)
abstracting: (1<=p11)
states: 4,108,639,766 (9)
abstracting: (1<=p7)
states: 3,354,213,280 (9)
...................................................................................................................................................................
EG iterations: 163
abstracting: (1<=p11)
states: 4,108,639,766 (9)
abstracting: (1<=p7)
states: 3,354,213,280 (9)
abstracting: (1<=p9)
states: 4,090,177,630 (9)
abstracting: (1<=p2)
states: 3,354,213,280 (9)
abstracting: (1<=p11)
states: 4,108,639,766 (9)
abstracting: (1<=p7)
states: 3,354,213,280 (9)
abstracting: (1<=p11)
states: 4,108,639,766 (9)
abstracting: (1<=p7)
states: 3,354,213,280 (9)
...................................................................................................................................................................
EG iterations: 163
...................................................................................................................................................................
EG iterations: 163
-> the formula is TRUE
FORMULA RobotManipulation-PT-00020-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m26.506sec
totally nodes used: 31325762 (3.1e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 273426310 100508519 373934829
used/not used/entry size/cache size: 53807590 13301274 16 1024MB
basic ops cache: hits/miss/sum: 93456810 35208512 128665322
used/not used/entry size/cache size: 15444387 1332829 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: 1943787 582185 2525972
used/not used/entry size/cache size: 563203 7825405 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 44445169
1 17476241
2 3971435
3 864865
4 209892
5 49258
6 14326
7 11172
8 5904
9 3438
>= 10 57164
Total processing time: 4m 2.233sec
BK_STOP 1678978583866
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:1693 (153), effective:401 (36)
initing FirstDep: 0m 0.000sec
iterations count:51 (4), effective:9 (0)
iterations count:93 (8), effective:41 (3)
iterations count:52 (4), effective:9 (0)
iterations count:50 (4), effective:9 (0)
iterations count:52 (4), effective:9 (0)
iterations count:52 (4), effective:9 (0)
iterations count:16 (1), effective:2 (0)
iterations count:410 (37), effective:120 (10)
iterations count:125 (11), effective:38 (3)
iterations count:44 (4), effective:9 (0)
iterations count:421 (38), effective:41 (3)
iterations count:48 (4), effective:8 (0)
iterations count:50 (4), effective:9 (0)
iterations count:331 (30), effective:80 (7)
iterations count:412 (37), effective:129 (11)
iterations count:93 (8), effective:19 (1)
iterations count:11 (1), effective:0 (0)
iterations count:332 (30), effective:81 (7)
iterations count:131 (11), effective:40 (3)
iterations count:21 (1), effective:1 (0)
iterations count:15 (1), effective:1 (0)
iterations count:171 (15), effective:40 (3)
iterations count:11 (1), effective:0 (0)
iterations count:11 (1), effective:0 (0)
iterations count:392 (35), effective:125 (11)
iterations count:51 (4), effective:9 (0)
iterations count:51 (4), effective:9 (0)
iterations count:171 (15), effective:40 (3)
iterations count:51 (4), effective:9 (0)
iterations count:11 (1), effective:0 (0)
iterations count:50 (4), effective:39 (3)
iterations count:167 (15), effective:39 (3)
iterations count:50 (4), effective:39 (3)
iterations count:11 (1), effective:0 (0)
iterations count:50 (4), effective:39 (3)
iterations count:11 (1), effective:0 (0)
iterations count:52 (4), effective:9 (0)
iterations count:411 (37), effective:40 (3)
iterations count:411 (37), effective:40 (3)
iterations count:401 (36), effective:39 (3)
iterations count:411 (37), effective:40 (3)
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-00020"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is RobotManipulation-PT-00020, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r362-smll-167891812100034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-00020.tgz
mv RobotManipulation-PT-00020 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;