About the Execution of Marcie+red for RobotManipulation-PT-00005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5449.915 | 13516.00 | 20816.00 | 509.70 | TTTTFFTTFFTFTTFT | 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-167891812000017.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-00005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r362-smll-167891812000017
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.5K Feb 26 05:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 05:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 05:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 26 05:36 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.8K Feb 25 16:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 12K Feb 26 05:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 05:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 05:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 05:37 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-00005-CTLCardinality-00
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-01
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-02
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-03
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-04
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-05
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-06
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-07
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-08
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-09
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-10
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-11
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-12
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-13
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-14
FORMULA_NAME RobotManipulation-PT-00005-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678978107210
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-00005
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 14:48:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 14:48:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 14:48:30] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2023-03-16 14:48:30] [INFO ] Transformed 15 places.
[2023-03-16 14:48:30] [INFO ] Transformed 11 transitions.
[2023-03-16 14:48:30] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
Initial state reduction rules removed 1 formulas.
FORMULA RobotManipulation-PT-00005-CTLCardinality-12 TRUE 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 15 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:48:30] [INFO ] Computed 6 place invariants in 8 ms
[2023-03-16 14:48:30] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-03-16 14:48:30] [INFO ] Invariant cache hit.
[2023-03-16 14:48:30] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
[2023-03-16 14:48:30] [INFO ] Invariant cache hit.
[2023-03-16 14:48:30] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 473 ms. Remains : 15/15 places, 11/11 transitions.
Support contains 15 out of 15 places after structural reductions.
[2023-03-16 14:48:31] [INFO ] Flatten gal took : 25 ms
[2023-03-16 14:48:31] [INFO ] Flatten gal took : 7 ms
[2023-03-16 14:48:31] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 73) seen :59
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-16 14:48:33] [INFO ] Invariant cache hit.
[2023-03-16 14:48:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 14:48:33] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 14:48:33] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:8
[2023-03-16 14:48:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 14:48:33] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 14:48:33] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :13 sat :0
Fused 13 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 13 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA RobotManipulation-PT-00005-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00005-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00005-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00005-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 14:48:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-16 14:48:33] [INFO ] Flatten gal took : 13 ms
FORMULA RobotManipulation-PT-00005-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 14:48:33] [INFO ] Flatten gal took : 4 ms
[2023-03-16 14:48:33] [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 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 3 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 3 ms. Remains : 13/15 places, 11/11 transitions.
[2023-03-16 14:48:33] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:33] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:48:33] [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
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.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 12 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 5 place count 12 transition count 8
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 11 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 9 place count 10 transition count 7
Applied a total of 9 rules in 15 ms. Remains 10 /15 variables (removed 5) and now considering 7/11 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 10/15 places, 7/11 transitions.
[2023-03-16 14:48:33] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:33] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:33] [INFO ] Input system was already deterministic with 7 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:48:33] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:33] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:33] [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:48:33] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:33] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:33] [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:48:33] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:48:33] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:33] [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:48:33] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:33] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:48:33] [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:48:33] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:48:33] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:33] [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
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 6 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 6 ms. Remains : 12/15 places, 9/11 transitions.
[2023-03-16 14:48:33] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:48:33] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:33] [INFO ] Input system was already deterministic with 9 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:48:33] [INFO ] Flatten gal took : 1 ms
[2023-03-16 14:48:33] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:33] [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:48:33] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:33] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:33] [INFO ] Input system was already deterministic with 11 transitions.
[2023-03-16 14:48:33] [INFO ] Flatten gal took : 2 ms
[2023-03-16 14:48:33] [INFO ] Flatten gal took : 3 ms
[2023-03-16 14:48:33] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-16 14:48:33] [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 3861 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.368sec
RS generation: 0m 0.015sec
-> reachability set: #nodes 1827 (1.8e+03) #states 184,756 (5)
starting MCC model checker
--------------------------
checking: EX [~ [p4<=2]]
normalized: EX [~ [p4<=2]]
abstracting: (p4<=2)
states: 142,571 (5)
.-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: AF [AG [EF [[4<=p9 & p4<=7]]]]
normalized: ~ [EG [E [true U ~ [E [true U [4<=p9 & p4<=7]]]]]]
abstracting: (p4<=7)
states: 184,286 (5)
abstracting: (4<=p9)
states: 68,354 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.019sec
checking: AG [EX [[A [3<=p0 U p0<=6] | 5<=p14]]]
normalized: ~ [E [true U ~ [EX [[5<=p14 | [~ [EG [~ [p0<=6]]] & ~ [E [~ [p0<=6] U [~ [3<=p0] & ~ [p0<=6]]]]]]]]]]
abstracting: (p0<=6)
states: 180,851 (5)
abstracting: (3<=p0)
states: 61,490 (4)
abstracting: (p0<=6)
states: 180,851 (5)
abstracting: (p0<=6)
states: 180,851 (5)
.
EG iterations: 1
abstracting: (5<=p14)
states: 42,614 (4)
.-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: E [6<=p14 U ~ [EF [AX [[~ [p2<=p3] & ~ [2<=p9]]]]]]
normalized: E [6<=p14 U ~ [E [true U ~ [EX [~ [[~ [2<=p9] & ~ [p2<=p3]]]]]]]]
abstracting: (p2<=p3)
states: 131,350 (5)
abstracting: (2<=p9)
states: 138,710 (5)
.abstracting: (6<=p14)
states: 24,002 (4)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: [EF [AG [EF [6<=p0]]] & EX [[AG [7<=p2] & [AF [AG [p1<=p8]] & AX [~ [10<=p2]]]]]]
normalized: [EX [[[~ [EX [10<=p2]] & ~ [EG [E [true U ~ [p1<=p8]]]]] & ~ [E [true U ~ [7<=p2]]]]] & E [true U ~ [E [true U ~ [E [true U 6<=p0]]]]]]
abstracting: (6<=p0)
states: 9,152 (3)
abstracting: (7<=p2)
states: 440
abstracting: (p1<=p8)
states: 120,344 (5)
EG iterations: 0
abstracting: (10<=p2)
states: 2
..-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.046sec
checking: [E [AF [p13<=9] U ~ [A [~ [EF [10<=p13]] U EX [[5<=p13 & p1<=3]]]]] & [EX [AG [p11<=p7]] | AG [EF [EX [~ [p13<=8]]]]]]
normalized: [[~ [E [true U ~ [E [true U EX [~ [p13<=8]]]]]] | EX [~ [E [true U ~ [p11<=p7]]]]] & E [~ [EG [~ [p13<=9]]] U ~ [[~ [EG [~ [EX [[5<=p13 & p1<=3]]]]] & ~ [E [~ [EX [[5<=p13 & p1<=3]]] U [E [true U 10<=p13] & ~ [EX [[5<=p13 & p1<=3]]]]]]]]]]
abstracting: (p1<=3)
states: 174,746 (5)
abstracting: (5<=p13)
states: 4,004 (3)
.abstracting: (10<=p13)
states: 2
abstracting: (p1<=3)
states: 174,746 (5)
abstracting: (5<=p13)
states: 4,004 (3)
.abstracting: (p1<=3)
states: 174,746 (5)
abstracting: (5<=p13)
states: 4,004 (3)
..
EG iterations: 1
abstracting: (p13<=9)
states: 184,754 (5)
...
EG iterations: 3
abstracting: (p11<=p7)
states: 6,006 (3)
.abstracting: (p13<=8)
states: 184,736 (5)
.-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.024sec
checking: EX [EF [[AX [~ [A [3<=p13 U p9<=3]]] & [[p4<=p1 & ~ [p0<=0]] | [p4<=p8 & [~ [4<=p6] | ~ [p2<=11]]]]]]]
normalized: EX [E [true U [[[p4<=p8 & [~ [p2<=11] | ~ [4<=p6]]] | [p4<=p1 & ~ [p0<=0]]] & ~ [EX [[~ [EG [~ [p9<=3]]] & ~ [E [~ [p9<=3] U [~ [3<=p13] & ~ [p9<=3]]]]]]]]]]
abstracting: (p9<=3)
states: 116,402 (5)
abstracting: (3<=p13)
states: 22,880 (4)
abstracting: (p9<=3)
states: 116,402 (5)
abstracting: (p9<=3)
states: 116,402 (5)
.
EG iterations: 1
.abstracting: (p0<=0)
states: 43,758 (4)
abstracting: (p4<=p1)
states: 99,144 (4)
abstracting: (4<=p6)
states: 10,010 (4)
abstracting: (p2<=11)
states: 184,756 (5)
abstracting: (p4<=p8)
states: 99,144 (4)
.-> the formula is TRUE
FORMULA RobotManipulation-PT-00005-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.037sec
checking: E [~ [AF [p3<=p8]] U [E [~ [[AG [p4<=4] | [[p6<=1 | p1<=6] & ~ [p1<=p4]]]] U ~ [AG [EF [p1<=7]]]] | AF [EG [~ [AF [p14<=9]]]]]]
normalized: E [EG [~ [p3<=p8]] U [~ [EG [~ [EG [EG [~ [p14<=9]]]]]] | E [~ [[[~ [p1<=p4] & [p6<=1 | p1<=6]] | ~ [E [true U ~ [p4<=4]]]]] U E [true U ~ [E [true U p1<=7]]]]]]
abstracting: (p1<=7)
states: 184,646 (5)
abstracting: (p4<=4)
states: 174,317 (5)
abstracting: (p1<=6)
states: 184,316 (5)
abstracting: (p6<=1)
states: 136,136 (5)
abstracting: (p1<=p4)
states: 131,350 (5)
abstracting: (p14<=9)
states: 184,294 (5)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p3<=p8)
states: 99,144 (4)
.
EG iterations: 1
-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.055sec
checking: [AF [[EG [p5<=4] & EX [4<=p3]]] | [AX [1<=0] | [EG [[~ [p10<=8] & EX [p2<=p11]]] & EF [[[~ [p4<=p3] & ~ [p11<=7]] | EF [~ [p14<=p11]]]]]]]
normalized: [[[E [true U [E [true U ~ [p14<=p11]] | [~ [p11<=7] & ~ [p4<=p3]]]] & EG [[EX [p2<=p11] & ~ [p10<=8]]]] | ~ [EX [~ [1<=0]]]] | ~ [EG [~ [[EX [4<=p3] & EG [p5<=4]]]]]]
abstracting: (p5<=4)
states: 14,300 (4)
.
EG iterations: 1
abstracting: (4<=p3)
states: 22,022 (4)
..
EG iterations: 1
abstracting: (1<=0)
states: 0
.abstracting: (p10<=8)
states: 184,736 (5)
abstracting: (p2<=p11)
states: 173,096 (5)
..
EG iterations: 1
abstracting: (p4<=p3)
states: 110,150 (5)
abstracting: (p11<=7)
states: 160,754 (5)
abstracting: (p14<=p11)
states: 165,308 (5)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.077sec
checking: EX [[~ [A [~ [5<=p1] U AF [p4<=p0]]] & [EX [E [3<=p9 U [[p11<=p8 & p5<=p1] | 6<=p8]]] & [EG [AF [~ [7<=p9]]] | [~ [E [p8<=p7 U p12<=p11]] & [~ [p5<=p0] & [5<=p8 | 10<=p5]]]]]]]
normalized: EX [[[[[[[5<=p8 | 10<=p5] & ~ [p5<=p0]] & ~ [E [p8<=p7 U p12<=p11]]] | EG [~ [EG [7<=p9]]]] & EX [E [3<=p9 U [6<=p8 | [p11<=p8 & p5<=p1]]]]] & ~ [[~ [EG [EG [~ [p4<=p0]]]] & ~ [E [EG [~ [p4<=p0]] U [5<=p1 & EG [~ [p4<=p0]]]]]]]]]
abstracting: (p4<=p0)
states: 136,136 (5)
.
EG iterations: 1
abstracting: (5<=p1)
states: 4,004 (3)
abstracting: (p4<=p0)
states: 136,136 (5)
.
EG iterations: 1
abstracting: (p4<=p0)
states: 136,136 (5)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p5<=p1)
states: 352
abstracting: (p11<=p8)
states: 20,504 (4)
abstracting: (6<=p8)
states: 1,430 (3)
abstracting: (3<=p9)
states: 102,674 (5)
.abstracting: (7<=p9)
states: 9,470 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p12<=p11)
states: 176,748 (5)
abstracting: (p8<=p7)
states: 120,344 (5)
abstracting: (p5<=p0)
states: 10,856 (4)
abstracting: (10<=p5)
states: 27,456 (4)
abstracting: (5<=p8)
states: 4,004 (3)
.-> the formula is FALSE
FORMULA RobotManipulation-PT-00005-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.080sec
totally nodes used: 119028 (1.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 382299 342544 724843
used/not used/entry size/cache size: 418093 66690771 16 1024MB
basic ops cache: hits/miss/sum: 183929 188845 372774
used/not used/entry size/cache size: 320055 16457161 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: 37865 28838 66703
used/not used/entry size/cache size: 28824 8359784 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 67001039
1 102308
2 3874
3 852
4 97
5 178
6 191
7 47
8 43
9 43
>= 10 192
Total processing time: 0m 5.279sec
BK_STOP 1678978120726
--------------------
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:433 (39), effective:101 (9)
initing FirstDep: 0m 0.000sec
iterations count:131 (11), effective:28 (2)
iterations count:11 (1), effective:0 (0)
iterations count:198 (18), effective:41 (3)
iterations count:11 (1), effective:0 (0)
iterations count:51 (4), effective:4 (0)
iterations count:103 (9), effective:14 (1)
iterations count:411 (37), effective:90 (8)
iterations count:11 (1), effective:0 (0)
iterations count:35 (3), effective:6 (0)
iterations count:42 (3), effective:6 (0)
iterations count:367 (33), effective:80 (7)
iterations count:27 (2), effective:4 (0)
iterations count:183 (16), effective:48 (4)
iterations count:14 (1), effective:3 (0)
iterations count:201 (18), effective:40 (3)
iterations count:229 (20), effective:53 (4)
iterations count:73 (6), effective:21 (1)
iterations count:11 (1), effective:0 (0)
iterations count:221 (20), effective:45 (4)
iterations count:341 (31), effective:77 (7)
iterations count:13 (1), effective:1 (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-00005"
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-00005, 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-167891812000017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-00005.tgz
mv RobotManipulation-PT-00005 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 '
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 ;