About the Execution of Marcie+red for RobotManipulation-PT-00001
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5449.363 | 12402.00 | 17163.00 | 493.70 | FFFTFTTFFFFFFFTT | 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-167891812000002.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-00001, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r362-smll-167891812000002
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 9.0K Feb 26 05:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 26 05:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 05:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 05:34 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.0K Feb 25 16:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 05:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 26 05:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 05:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 05:34 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-00001-CTLFireability-00
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-01
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-02
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-03
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-04
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-05
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-06
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-07
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-08
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-09
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-10
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-11
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-12
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-13
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-14
FORMULA_NAME RobotManipulation-PT-00001-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678977918625
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-00001
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 14:45:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 14:45:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 14:45:22] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-03-16 14:45:22] [INFO ] Transformed 15 places.
[2023-03-16 14:45:22] [INFO ] Transformed 11 transitions.
[2023-03-16 14:45:22] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Initial state reduction rules removed 3 formulas.
FORMULA RobotManipulation-PT-00001-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00001-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00001-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 22 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:45:22] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-16 14:45:22] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-03-16 14:45:22] [INFO ] Invariant cache hit.
[2023-03-16 14:45:22] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2023-03-16 14:45:22] [INFO ] Invariant cache hit.
[2023-03-16 14:45:22] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 479 ms. Remains : 15/15 places, 11/11 transitions.
Support contains 15 out of 15 places after structural reductions.
[2023-03-16 14:45:23] [INFO ] Flatten gal took : 31 ms
[2023-03-16 14:45:23] [INFO ] Flatten gal took : 11 ms
[2023-03-16 14:45:23] [INFO ] Input system was already deterministic with 11 transitions.
Finished random walk after 436 steps, including 0 resets, run visited all 25 properties in 76 ms. (steps per millisecond=5 )
[2023-03-16 14:45:23] [INFO ] Flatten gal took : 5 ms
[2023-03-16 14:45:23] [INFO ] Flatten gal took : 6 ms
[2023-03-16 14:45:23] [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 2 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:45:23] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:45:23] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:45:23] [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:45:23] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:45:23] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:45:23] [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:45:23] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:45:23] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:45:23] [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:45:23] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:45:23] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:45:23] [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:45:23] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:45:23] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:45:23] [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:45:23] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:45:23] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:45:23] [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 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 13 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 13 transition count 9
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 5 place count 12 transition count 9
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 7 place count 11 transition count 8
Applied a total of 7 rules in 15 ms. Remains 11 /15 variables (removed 4) and now considering 8/11 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 11/15 places, 8/11 transitions.
[2023-03-16 14:45:23] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:45:23] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:45:23] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 2 rules applied. Total rules applied 2 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 13 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 5 place count 12 transition count 9
Applied a total of 5 rules in 3 ms. Remains 12 /15 variables (removed 3) and now considering 9/11 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 12/15 places, 9/11 transitions.
[2023-03-16 14:45:23] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:45:23] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:45:23] [INFO ] Input system was already deterministic with 9 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:45:23] [INFO ] Flatten gal took : 10 ms
[2023-03-16 14:45:23] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:45:23] [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:45:23] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:45:23] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:45:23] [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:45:23] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:45:23] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:45:23] [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:45:23] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:45:23] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:45:23] [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:45:23] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:45:23] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:45:23] [INFO ] Input system was already deterministic with 11 transitions.
[2023-03-16 14:45:23] [INFO ] Flatten gal took : 4 ms
[2023-03-16 14:45:23] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:45:23] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-16 14:45:23] [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 1769 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 4.084sec
RS generation: 0m 0.000sec
-> reachability set: #nodes 107 (1.1e+02) #states 110
starting MCC model checker
--------------------------
checking: EX [EF [EG [AF [1<=p7]]]]
normalized: EX [E [true U EG [~ [EG [~ [1<=p7]]]]]]
abstracting: (1<=p7)
states: 20
...........
EG iterations: 11
EG iterations: 0
.-> the formula is TRUE
FORMULA RobotManipulation-PT-00001-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AF [EG [[1<=p2 & 1<=p9]]]
normalized: ~ [EG [~ [EG [[1<=p2 & 1<=p9]]]]]
abstracting: (1<=p9)
states: 54
abstracting: (1<=p2)
states: 20
.
EG iterations: 1
.......
EG iterations: 7
-> the formula is FALSE
FORMULA RobotManipulation-PT-00001-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AX [AG [~ [E [~ [[1<=p8 & 1<=p10]] U [1<=p7 & 1<=p11]]]]]
normalized: ~ [EX [E [true U E [~ [[1<=p8 & 1<=p10]] U [1<=p7 & 1<=p11]]]]]
abstracting: (1<=p11)
states: 80
abstracting: (1<=p7)
states: 20
abstracting: (1<=p10)
states: 20
abstracting: (1<=p8)
states: 20
.-> the formula is FALSE
FORMULA RobotManipulation-PT-00001-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AF [[AG [E [[1<=p1 & 1<=p5] U 1<=p6]] & [1<=p13 & 1<=p14]]]
normalized: ~ [EG [~ [[[1<=p13 & 1<=p14] & ~ [E [true U ~ [E [[1<=p1 & 1<=p5] U 1<=p6]]]]]]]]
abstracting: (1<=p6)
states: 20
abstracting: (1<=p5)
states: 101
abstracting: (1<=p1)
states: 20
abstracting: (1<=p14)
states: 74
abstracting: (1<=p13)
states: 20
EG iterations: 0
-> the formula is FALSE
FORMULA RobotManipulation-PT-00001-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EX [[1<=p10 | [EX [[1<=p2 & 1<=p9]] & [AF [EX [1<=p6]] | [1<=p3 & 1<=p5]]]]]
normalized: EX [[[[[1<=p3 & 1<=p5] | ~ [EG [~ [EX [1<=p6]]]]] & EX [[1<=p2 & 1<=p9]]] | 1<=p10]]
abstracting: (1<=p10)
states: 20
abstracting: (1<=p9)
states: 54
abstracting: (1<=p2)
states: 20
.abstracting: (1<=p6)
states: 20
....
EG iterations: 3
abstracting: (1<=p5)
states: 101
abstracting: (1<=p3)
states: 29
.-> the formula is FALSE
FORMULA RobotManipulation-PT-00001-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EX [EX [E [[~ [AX [[1<=p0 & 1<=p4]]] | ~ [[1<=p7 & 1<=p11]]] U [1<=p1 & 1<=p5]]]]
normalized: EX [EX [E [[~ [[1<=p7 & 1<=p11]] | EX [~ [[1<=p0 & 1<=p4]]]] U [1<=p1 & 1<=p5]]]]
abstracting: (1<=p5)
states: 101
abstracting: (1<=p1)
states: 20
abstracting: (1<=p4)
states: 29
abstracting: (1<=p0)
states: 65
.abstracting: (1<=p11)
states: 80
abstracting: (1<=p7)
states: 20
..-> the formula is TRUE
FORMULA RobotManipulation-PT-00001-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [~ [E [[1<=p2 & 1<=p9] U [~ [EX [[1<=p1 & 1<=p5]]] & [1<=p12 | [[1<=p1 & 1<=p5] | AG [1<=p6]]]]]]]
normalized: ~ [E [true U E [[1<=p2 & 1<=p9] U [[[~ [E [true U ~ [1<=p6]]] | [1<=p1 & 1<=p5]] | 1<=p12] & ~ [EX [[1<=p1 & 1<=p5]]]]]]]
abstracting: (1<=p5)
states: 101
abstracting: (1<=p1)
states: 20
.abstracting: (1<=p12)
states: 65
abstracting: (1<=p5)
states: 101
abstracting: (1<=p1)
states: 20
abstracting: (1<=p6)
states: 20
abstracting: (1<=p9)
states: 54
abstracting: (1<=p2)
states: 20
-> the formula is FALSE
FORMULA RobotManipulation-PT-00001-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EX [[[p13<=0 | p14<=0] & [~ [A [~ [[[1<=p0 & 1<=p4] | 1<=p6]] U p12<=0]] | [[1<=p1 & 1<=p5] & [1<=p12 & [AF [1<=p8] & [p0<=0 | p4<=0]]]]]]]
normalized: EX [[[[[[[p0<=0 | p4<=0] & ~ [EG [~ [1<=p8]]]] & 1<=p12] & [1<=p1 & 1<=p5]] | ~ [[~ [EG [~ [p12<=0]]] & ~ [E [~ [p12<=0] U [[[1<=p0 & 1<=p4] | 1<=p6] & ~ [p12<=0]]]]]]] & [p13<=0 | p14<=0]]]
abstracting: (p14<=0)
states: 36
abstracting: (p13<=0)
states: 90
abstracting: (p12<=0)
states: 45
abstracting: (1<=p6)
states: 20
abstracting: (1<=p4)
states: 29
abstracting: (1<=p0)
states: 65
abstracting: (p12<=0)
states: 45
abstracting: (p12<=0)
states: 45
.
EG iterations: 1
abstracting: (1<=p5)
states: 101
abstracting: (1<=p1)
states: 20
abstracting: (1<=p12)
states: 65
abstracting: (1<=p8)
states: 20
.
EG iterations: 1
abstracting: (p4<=0)
states: 81
abstracting: (p0<=0)
states: 45
.-> the formula is TRUE
FORMULA RobotManipulation-PT-00001-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AF [[[[AX [1<=p6] & 1<=p6] & AG [1<=p7]] & [[EF [[p0<=0 | p4<=0]] & AX [[1<=p1 & 1<=p5]]] & [A [[1<=p1 & 1<=p5] U [1<=p13 & 1<=p14]] & AG [[1<=p7 & 1<=p11]]]]]]
normalized: ~ [EG [~ [[[[~ [EX [~ [[1<=p1 & 1<=p5]]]] & E [true U [p0<=0 | p4<=0]]] & [~ [E [true U ~ [[1<=p7 & 1<=p11]]]] & [~ [EG [~ [[1<=p13 & 1<=p14]]]] & ~ [E [~ [[1<=p13 & 1<=p14]] U [~ [[1<=p1 & 1<=p5]] & ~ [[1<=p13 & 1<=p14]]]]]]]] & [~ [E [true U ~ [1<=p7]]] & [~ [EX [~ [1<=p6]]] & 1<=p6]]]]]]
abstracting: (1<=p6)
states: 20
abstracting: (1<=p6)
states: 20
.abstracting: (1<=p7)
states: 20
abstracting: (1<=p14)
states: 74
abstracting: (1<=p13)
states: 20
abstracting: (1<=p5)
states: 101
abstracting: (1<=p1)
states: 20
abstracting: (1<=p14)
states: 74
abstracting: (1<=p13)
states: 20
abstracting: (1<=p14)
states: 74
abstracting: (1<=p13)
states: 20
.......
EG iterations: 7
abstracting: (1<=p11)
states: 80
abstracting: (1<=p7)
states: 20
abstracting: (p4<=0)
states: 81
abstracting: (p0<=0)
states: 45
abstracting: (1<=p5)
states: 101
abstracting: (1<=p1)
states: 20
.
EG iterations: 0
-> the formula is FALSE
FORMULA RobotManipulation-PT-00001-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: E [[[1<=p2 & 1<=p9] | [~ [AX [p6<=0]] & [~ [[1<=p13 & 1<=p14]] & [~ [[p12<=0 & [1<=p6 | 1<=p10]]] | [AX [[1<=p3 & 1<=p5]] & ~ [[1<=p7 & 1<=p11]]]]]]] U [1<=p2 & 1<=p9]]
normalized: E [[[[[[~ [[1<=p7 & 1<=p11]] & ~ [EX [~ [[1<=p3 & 1<=p5]]]]] | ~ [[[1<=p6 | 1<=p10] & p12<=0]]] & ~ [[1<=p13 & 1<=p14]]] & EX [~ [p6<=0]]] | [1<=p2 & 1<=p9]] U [1<=p2 & 1<=p9]]
abstracting: (1<=p9)
states: 54
abstracting: (1<=p2)
states: 20
abstracting: (1<=p9)
states: 54
abstracting: (1<=p2)
states: 20
abstracting: (p6<=0)
states: 90
.abstracting: (1<=p14)
states: 74
abstracting: (1<=p13)
states: 20
abstracting: (p12<=0)
states: 45
abstracting: (1<=p10)
states: 20
abstracting: (1<=p6)
states: 20
abstracting: (1<=p5)
states: 101
abstracting: (1<=p3)
states: 29
.abstracting: (1<=p11)
states: 80
abstracting: (1<=p7)
states: 20
-> the formula is FALSE
FORMULA RobotManipulation-PT-00001-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [AX [p12<=0] & [AF [E [[1<=p13 & 1<=p14] U [1<=p2 & 1<=p9]]] & E [[[1<=p7 & 1<=p11] | ~ [A [[1<=p7 & 1<=p11] U AX [[1<=p0 & 1<=p4]]]]] U E [~ [AF [p12<=0]] U [~ [[[[1<=p1 & 1<=p5] | 1<=p8] & p10<=0]] & ~ [[1<=p2 & 1<=p9]]]]]]]
normalized: [[~ [EG [~ [E [[1<=p13 & 1<=p14] U [1<=p2 & 1<=p9]]]]] & E [[~ [[~ [EG [EX [~ [[1<=p0 & 1<=p4]]]]] & ~ [E [EX [~ [[1<=p0 & 1<=p4]]] U [~ [[1<=p7 & 1<=p11]] & EX [~ [[1<=p0 & 1<=p4]]]]]]]] | [1<=p7 & 1<=p11]] U E [EG [~ [p12<=0]] U [~ [[1<=p2 & 1<=p9]] & ~ [[[[1<=p1 & 1<=p5] | 1<=p8] & p10<=0]]]]]] & ~ [EX [~ [p12<=0]]]]
abstracting: (p12<=0)
states: 45
.abstracting: (p10<=0)
states: 90
abstracting: (1<=p8)
states: 20
abstracting: (1<=p5)
states: 101
abstracting: (1<=p1)
states: 20
abstracting: (1<=p9)
states: 54
abstracting: (1<=p2)
states: 20
abstracting: (p12<=0)
states: 45
.
EG iterations: 1
abstracting: (1<=p11)
states: 80
abstracting: (1<=p7)
states: 20
abstracting: (1<=p4)
states: 29
abstracting: (1<=p0)
states: 65
.abstracting: (1<=p11)
states: 80
abstracting: (1<=p7)
states: 20
abstracting: (1<=p4)
states: 29
abstracting: (1<=p0)
states: 65
.abstracting: (1<=p4)
states: 29
abstracting: (1<=p0)
states: 65
..
EG iterations: 1
abstracting: (1<=p9)
states: 54
abstracting: (1<=p2)
states: 20
abstracting: (1<=p14)
states: 74
abstracting: (1<=p13)
states: 20
...........
EG iterations: 11
-> the formula is FALSE
FORMULA RobotManipulation-PT-00001-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: E [E [A [~ [A [1<=p7 U 1<=p10]] U EX [[1<=p10 | [1<=p3 & 1<=p5]]]] U [1<=p7 & p8<=0]] U [~ [E [[[1<=p3 & 1<=p5] | [~ [[1<=p1 & 1<=p5]] & [1<=p7 | 1<=p8]]] U AF [1<=p8]]] & [AF [AG [[[1<=p7 & 1<=p11] | [1<=p1 & 1<=p5]]]] | 1<=p8]]]
normalized: E [E [[~ [EG [~ [EX [[[1<=p3 & 1<=p5] | 1<=p10]]]]] & ~ [E [~ [EX [[[1<=p3 & 1<=p5] | 1<=p10]]] U [[~ [EG [~ [1<=p10]]] & ~ [E [~ [1<=p10] U [~ [1<=p7] & ~ [1<=p10]]]]] & ~ [EX [[[1<=p3 & 1<=p5] | 1<=p10]]]]]]] U [1<=p7 & p8<=0]] U [[~ [EG [E [true U ~ [[[1<=p1 & 1<=p5] | [1<=p7 & 1<=p11]]]]]] | 1<=p8] & ~ [E [[[[1<=p7 | 1<=p8] & ~ [[1<=p1 & 1<=p5]]] | [1<=p3 & 1<=p5]] U ~ [EG [~ [1<=p8]]]]]]]
abstracting: (1<=p8)
states: 20
.
EG iterations: 1
abstracting: (1<=p5)
states: 101
abstracting: (1<=p3)
states: 29
abstracting: (1<=p5)
states: 101
abstracting: (1<=p1)
states: 20
abstracting: (1<=p8)
states: 20
abstracting: (1<=p7)
states: 20
abstracting: (1<=p8)
states: 20
abstracting: (1<=p11)
states: 80
abstracting: (1<=p7)
states: 20
abstracting: (1<=p5)
states: 101
abstracting: (1<=p1)
states: 20
EG iterations: 0
abstracting: (p8<=0)
states: 90
abstracting: (1<=p7)
states: 20
abstracting: (1<=p10)
states: 20
abstracting: (1<=p5)
states: 101
abstracting: (1<=p3)
states: 29
.abstracting: (1<=p10)
states: 20
abstracting: (1<=p7)
states: 20
abstracting: (1<=p10)
states: 20
abstracting: (1<=p10)
states: 20
.........
EG iterations: 9
abstracting: (1<=p10)
states: 20
abstracting: (1<=p5)
states: 101
abstracting: (1<=p3)
states: 29
.abstracting: (1<=p10)
states: 20
abstracting: (1<=p5)
states: 101
abstracting: (1<=p3)
states: 29
........
EG iterations: 7
-> the formula is FALSE
FORMULA RobotManipulation-PT-00001-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: [AX [[[AF [EX [p10<=0]] & [[~ [A [[1<=p0 & 1<=p4] U 1<=p10]] | [[1<=p1 & 1<=p5] & [1<=p7 & [[[1<=p13 & 1<=p14] | [1<=p7 & 1<=p11]] & E [1<=p10 U [1<=p13 & 1<=p14]]]]]] & EX [[1<=p3 & 1<=p5]]]] & [[1<=p8 | [1<=p3 & [1<=p5 & 1<=p12]]] & [1<=p0 & 1<=p4]]]] & [AF [[1<=p2 & 1<=p9]] | E [[[~ [[1<=p7 & 1<=p11]] | EX [EX [1<=p12]]] & A [[1<=p7 & ~ [[1<=p1 & 1<=p5]]] U ~ [[1<=p0 & 1<=p4]]]] U [~ [E [[1<=p3 & 1<=p5] U [1<=p8 & 1<=p10]]] | 1<=p8]]]]
normalized: [~ [EX [~ [[[[[~ [[~ [EG [~ [1<=p10]]] & ~ [E [~ [1<=p10] U [~ [[1<=p0 & 1<=p4]] & ~ [1<=p10]]]]]] | [[[E [1<=p10 U [1<=p13 & 1<=p14]] & [[1<=p7 & 1<=p11] | [1<=p13 & 1<=p14]]] & 1<=p7] & [1<=p1 & 1<=p5]]] & EX [[1<=p3 & 1<=p5]]] & ~ [EG [~ [EX [p10<=0]]]]] & [[1<=p0 & 1<=p4] & [[[1<=p5 & 1<=p12] & 1<=p3] | 1<=p8]]]]]] & [E [[[~ [EG [[1<=p0 & 1<=p4]]] & ~ [E [[1<=p0 & 1<=p4] U [~ [[~ [[1<=p1 & 1<=p5]] & 1<=p7]] & [1<=p0 & 1<=p4]]]]] & [EX [EX [1<=p12]] | ~ [[1<=p7 & 1<=p11]]]] U [~ [E [[1<=p3 & 1<=p5] U [1<=p8 & 1<=p10]]] | 1<=p8]] | ~ [EG [~ [[1<=p2 & 1<=p9]]]]]]
abstracting: (1<=p9)
states: 54
abstracting: (1<=p2)
states: 20
.......
EG iterations: 7
abstracting: (1<=p8)
states: 20
abstracting: (1<=p10)
states: 20
abstracting: (1<=p8)
states: 20
abstracting: (1<=p5)
states: 101
abstracting: (1<=p3)
states: 29
abstracting: (1<=p11)
states: 80
abstracting: (1<=p7)
states: 20
abstracting: (1<=p12)
states: 65
..abstracting: (1<=p4)
states: 29
abstracting: (1<=p0)
states: 65
abstracting: (1<=p7)
states: 20
abstracting: (1<=p5)
states: 101
abstracting: (1<=p1)
states: 20
abstracting: (1<=p4)
states: 29
abstracting: (1<=p0)
states: 65
abstracting: (1<=p4)
states: 29
abstracting: (1<=p0)
states: 65
.
EG iterations: 1
abstracting: (1<=p8)
states: 20
abstracting: (1<=p3)
states: 29
abstracting: (1<=p12)
states: 65
abstracting: (1<=p5)
states: 101
abstracting: (1<=p4)
states: 29
abstracting: (1<=p0)
states: 65
abstracting: (p10<=0)
states: 90
....
EG iterations: 3
abstracting: (1<=p5)
states: 101
abstracting: (1<=p3)
states: 29
.abstracting: (1<=p5)
states: 101
abstracting: (1<=p1)
states: 20
abstracting: (1<=p7)
states: 20
abstracting: (1<=p14)
states: 74
abstracting: (1<=p13)
states: 20
abstracting: (1<=p11)
states: 80
abstracting: (1<=p7)
states: 20
abstracting: (1<=p14)
states: 74
abstracting: (1<=p13)
states: 20
abstracting: (1<=p10)
states: 20
abstracting: (1<=p10)
states: 20
abstracting: (1<=p4)
states: 29
abstracting: (1<=p0)
states: 65
abstracting: (1<=p10)
states: 20
abstracting: (1<=p10)
states: 20
.........
EG iterations: 9
.-> the formula is FALSE
FORMULA RobotManipulation-PT-00001-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
totally nodes used: 5242 (5.2e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 9814 18856 28670
used/not used/entry size/cache size: 23292 67085572 16 1024MB
basic ops cache: hits/miss/sum: 3066 6553 9619
used/not used/entry size/cache size: 12451 16764765 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: 496 672 1168
used/not used/entry size/cache size: 672 8387936 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 67104068
1 4624
2 92
3 33
4 19
5 5
6 7
7 2
8 2
9 3
>= 10 9
Total processing time: 0m 5.874sec
BK_STOP 1678977931027
--------------------
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:97 (8), effective:21 (1)
initing FirstDep: 0m 0.000sec
iterations count:11 (1), effective:0 (0)
iterations count:61 (5), effective:10 (0)
iterations count:15 (1), effective:1 (0)
iterations count:12 (1), effective:1 (0)
iterations count:17 (1), effective:4 (0)
iterations count:53 (4), effective:9 (0)
iterations count:15 (1), effective:2 (0)
iterations count:64 (5), effective:11 (1)
iterations count:45 (4), effective:10 (0)
iterations count:49 (4), effective:8 (0)
iterations count:19 (1), effective:2 (0)
iterations count:13 (1), effective:2 (0)
iterations count:19 (1), effective:2 (0)
iterations count:19 (1), effective:2 (0)
iterations count:18 (1), effective:3 (0)
iterations count:53 (4), effective:6 (0)
iterations count:19 (1), effective:2 (0)
iterations count:62 (5), effective:10 (0)
iterations count:44 (4), effective:9 (0)
iterations count:44 (4), effective:9 (0)
iterations count:21 (1), effective:4 (0)
iterations count:19 (1), effective:2 (0)
iterations count:61 (5), effective:10 (0)
iterations count:11 (1), effective:0 (0)
iterations count:15 (1), effective:1 (0)
iterations count:11 (1), effective:0 (0)
iterations count:51 (4), effective:9 (0)
iterations count:19 (1), effective:2 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RobotManipulation-PT-00001"
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-00001, 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-167891812000002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-00001.tgz
mv RobotManipulation-PT-00001 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 ;