About the Execution of Marcie+red for RobotManipulation-PT-00002
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5450.292 | 13523.00 | 19201.00 | 700.30 | FTFFFTFTFFTFFFFT | 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-167891812000014.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-00002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r362-smll-167891812000014
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 8.0K Feb 26 05:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 05:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 05:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 05:35 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.1K Feb 25 16:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Feb 25 16:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 05:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Feb 26 05:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 05:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 05:36 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.3K 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-00002-ReachabilityCardinality-00
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-01
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-02
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-03
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-04
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-05
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-06
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-07
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-08
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-09
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-10
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-11
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-12
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-13
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-14
FORMULA_NAME RobotManipulation-PT-00002-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678978078950
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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RobotManipulation-PT-00002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 14:48:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 14:48:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 14:48:03] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-03-16 14:48:03] [INFO ] Transformed 15 places.
[2023-03-16 14:48:03] [INFO ] Transformed 11 transitions.
[2023-03-16 14:48:03] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 45 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 540 ms. (steps per millisecond=18 ) properties (out of 12) seen :6
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 11 rows 15 cols
[2023-03-16 14:48:05] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-16 14:48:05] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-16 14:48:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-16 14:48:05] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 14:48:05] [INFO ] After 150ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 2588 ms.
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=ReachabilityCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: RobotManipulation_PT_00002
(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.880sec
RS generation: 0m 0.001sec
-> reachability set: #nodes 301 (3.0e+02) #states 1,430 (3)
starting MCC model checker
--------------------------
checking: EF [2<=p_rel]
normalized: E [true U 2<=p_rel]
abstracting: (2<=p_rel)
states: 110
-> the formula is TRUE
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [~ [r_moving<=r_active]]
normalized: ~ [E [true U r_moving<=r_active]]
abstracting: (r_moving<=r_active)
states: 1,379 (3)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [p_i2<=p_sc]
normalized: ~ [E [true U ~ [p_i2<=p_sc]]]
abstracting: (p_i2<=p_sc)
states: 510
-> the formula is FALSE
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[3<=initialized & 5<=p_m]]
normalized: E [true U [3<=initialized & 5<=p_m]]
abstracting: (5<=p_m)
states: 0
abstracting: (3<=initialized)
states: 20
-> the formula is FALSE
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[r_moving<=moved | r_stopped<=3]]
normalized: ~ [E [true U ~ [[r_moving<=moved | r_stopped<=3]]]]
abstracting: (r_stopped<=3)
states: 1,424 (3)
abstracting: (r_moving<=moved)
states: 1,082 (3)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[[initialized<=p_rdy | [p_rel<=2 | [[off<=0 & [[~ [p_rdy<=4] | p_m<=move] | [[~ [r_active<=2] | initialized<=4] & [~ [move<=p_i2] | [p_rdy<=0 & 1<=r_stopped]]]]] | ~ [initialize<=1]]]] & initialized<=p_rel]]
normalized: E [true U [[[[~ [initialize<=1] | [[[[[p_rdy<=0 & 1<=r_stopped] | ~ [move<=p_i2]] & [~ [r_active<=2] | initialized<=4]] | [~ [p_rdy<=4] | p_m<=move]] & off<=0]] | p_rel<=2] | initialized<=p_rdy] & initialized<=p_rel]]
abstracting: (initialized<=p_rel)
states: 1,082 (3)
abstracting: (initialized<=p_rdy)
states: 1,082 (3)
abstracting: (p_rel<=2)
states: 1,410 (3)
abstracting: (off<=0)
states: 825
abstracting: (p_m<=move)
states: 660
abstracting: (p_rdy<=4)
states: 1,430 (3)
abstracting: (initialized<=4)
states: 1,430 (3)
abstracting: (r_active<=2)
states: 398
abstracting: (move<=p_i2)
states: 1,263 (3)
abstracting: (1<=r_stopped)
states: 605
abstracting: (p_rdy<=0)
states: 990
abstracting: (initialize<=1)
states: 990
-> the formula is TRUE
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: EF [[[~ [4<=r_active] & [[~ [[moved<=p_rdy | ~ [[~ [move<=r_stopped] | [p_m<=3 | r_moving<=5]]]]] | p_i1<=off] | [~ [[~ [p_i1<=0] | [[[access<=4 | 4<=initialize] | ~ [p_rel<=2]] & [p_m<=p_rdy | 5<=p_rel]]]] & [2<=p_sc | 1<=p_i1]]]] | ~ [[p_sc<=2 & p_m<=r_moving]]]]
normalized: E [true U [~ [[p_sc<=2 & p_m<=r_moving]] | [[[[2<=p_sc | 1<=p_i1] & ~ [[[[p_m<=p_rdy | 5<=p_rel] & [~ [p_rel<=2] | [access<=4 | 4<=initialize]]] | ~ [p_i1<=0]]]] | [~ [[moved<=p_rdy | ~ [[[p_m<=3 | r_moving<=5] | ~ [move<=r_stopped]]]]] | p_i1<=off]] & ~ [4<=r_active]]]]
abstracting: (4<=r_active)
states: 540
abstracting: (p_i1<=off)
states: 715
abstracting: (move<=r_stopped)
states: 1,120 (3)
abstracting: (r_moving<=5)
states: 1,430 (3)
abstracting: (p_m<=3)
states: 1,400 (3)
abstracting: (moved<=p_rdy)
states: 1,082 (3)
abstracting: (p_i1<=0)
states: 495
abstracting: (4<=initialize)
states: 38
abstracting: (access<=4)
states: 1,430 (3)
abstracting: (p_rel<=2)
states: 1,410 (3)
abstracting: (5<=p_rel)
states: 0
abstracting: (p_m<=p_rdy)
states: 600
abstracting: (1<=p_i1)
states: 935
abstracting: (2<=p_sc)
states: 110
abstracting: (p_m<=r_moving)
states: 660
abstracting: (p_sc<=2)
states: 1,410 (3)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: EF [[[~ [[[4<=moved & ~ [[access<=1 & 1<=r_active]]] & p_rdy<=p_rdy]] | 4<=initialized] & [[[[~ [[p_sc<=1 | 3<=p_sc]] | [~ [[initialize<=access | [p_rdy<=2 & p_rdy<=1]]] | ~ [initialized<=4]]] | [p_i1<=5 | ~ [[[5<=p_sc | r_active<=0] | [5<=off & r_active<=p_rdy]]]]] & r_stopped<=r_stopped] & 5<=r_active]]]
normalized: E [true U [[[[[~ [[[5<=off & r_active<=p_rdy] | [5<=p_sc | r_active<=0]]] | p_i1<=5] | [[~ [initialized<=4] | ~ [[[p_rdy<=2 & p_rdy<=1] | initialize<=access]]] | ~ [[p_sc<=1 | 3<=p_sc]]]] & r_stopped<=r_stopped] & 5<=r_active] & [~ [[[~ [[access<=1 & 1<=r_active]] & 4<=moved] & p_rdy<=p_rdy]] | 4<=initialized]]]
abstracting: (4<=initialized)
states: 2
abstracting: (p_rdy<=p_rdy)
states: 1,430 (3)
abstracting: (4<=moved)
states: 2
abstracting: (1<=r_active)
states: 1,410 (3)
abstracting: (access<=1)
states: 490
abstracting: (5<=r_active)
states: 0
abstracting: (r_stopped<=r_stopped)
states: 1,430 (3)
abstracting: (3<=p_sc)
states: 20
abstracting: (p_sc<=1)
states: 1,320 (3)
abstracting: (initialize<=access)
states: 1,220 (3)
abstracting: (p_rdy<=1)
states: 1,320 (3)
abstracting: (p_rdy<=2)
states: 1,410 (3)
abstracting: (initialized<=4)
states: 1,430 (3)
abstracting: (p_i1<=5)
states: 1,430 (3)
abstracting: (r_active<=0)
states: 20
abstracting: (5<=p_sc)
states: 0
abstracting: (r_active<=p_rdy)
states: 50
abstracting: (5<=off)
states: 0
-> the formula is FALSE
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [[~ [[[p_i2<=2 & ~ [[~ [[[r_moving<=access & 2<=moved] & ~ [p_i1<=r_active]]] & [~ [p_i2<=4] & 4<=r_stopped]]]] & ~ [[5<=moved & [[[[p_m<=move | 1<=initialized] & [p_rdy<=1 | 5<=off]] | ~ [[r_stopped<=2 | p_i1<=p_rdy]]] & [[[2<=p_i2 | 3<=access] & 4<=r_stopped] | ~ [move<=p_rdy]]]]]]] | [p_rdy<=access & move<=p_rdy]]]
normalized: ~ [E [true U ~ [[[p_rdy<=access & move<=p_rdy] | ~ [[~ [[[[~ [move<=p_rdy] | [[2<=p_i2 | 3<=access] & 4<=r_stopped]] & [~ [[r_stopped<=2 | p_i1<=p_rdy]] | [[p_rdy<=1 | 5<=off] & [p_m<=move | 1<=initialized]]]] & 5<=moved]] & [~ [[[~ [p_i2<=4] & 4<=r_stopped] & ~ [[~ [p_i1<=r_active] & [r_moving<=access & 2<=moved]]]]] & p_i2<=2]]]]]]]
abstracting: (p_i2<=2)
states: 1,140 (3)
abstracting: (2<=moved)
states: 110
abstracting: (r_moving<=access)
states: 1,310 (3)
abstracting: (p_i1<=r_active)
states: 1,314 (3)
abstracting: (4<=r_stopped)
states: 6
abstracting: (p_i2<=4)
states: 1,415 (3)
abstracting: (5<=moved)
states: 0
abstracting: (1<=initialized)
states: 440
abstracting: (p_m<=move)
states: 660
abstracting: (5<=off)
states: 0
abstracting: (p_rdy<=1)
states: 1,320 (3)
abstracting: (p_i1<=p_rdy)
states: 677
abstracting: (r_stopped<=2)
states: 1,383 (3)
abstracting: (4<=r_stopped)
states: 6
abstracting: (3<=access)
states: 490
abstracting: (2<=p_i2)
states: 650
abstracting: (move<=p_rdy)
states: 1,082 (3)
abstracting: (move<=p_rdy)
states: 1,082 (3)
abstracting: (p_rdy<=access)
states: 1,430 (3)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: EF [[[[r_stopped<=3 & [5<=r_stopped | ~ [[[[[p_sc<=p_sc | p_sc<=2] & p_rdy<=2] | move<=5] & ~ [p_rdy<=4]]]]] & ~ [[[[[[p_rdy<=0 & r_stopped<=5] & move<=r_active] | off<=moved] | move<=p_rel] | ~ [initialized<=3]]]] & [5<=off & [[[access<=access & ~ [[~ [p_rel<=3] & ~ [p_i2<=0]]]] & ~ [access<=0]] | ~ [[p_i1<=0 & [~ [1<=r_moving] | [~ [r_stopped<=0] | move<=2]]]]]]]]
normalized: E [true U [[[~ [[[[~ [r_stopped<=0] | move<=2] | ~ [1<=r_moving]] & p_i1<=0]] | [~ [access<=0] & [~ [[~ [p_i2<=0] & ~ [p_rel<=3]]] & access<=access]]] & 5<=off] & [~ [[~ [initialized<=3] | [[[[p_rdy<=0 & r_stopped<=5] & move<=r_active] | off<=moved] | move<=p_rel]]] & [[~ [[~ [p_rdy<=4] & [[[p_sc<=p_sc | p_sc<=2] & p_rdy<=2] | move<=5]]] | 5<=r_stopped] & r_stopped<=3]]]]
abstracting: (r_stopped<=3)
states: 1,424 (3)
abstracting: (5<=r_stopped)
states: 0
abstracting: (move<=5)
states: 1,430 (3)
abstracting: (p_rdy<=2)
states: 1,410 (3)
abstracting: (p_sc<=2)
states: 1,410 (3)
abstracting: (p_sc<=p_sc)
states: 1,430 (3)
abstracting: (p_rdy<=4)
states: 1,430 (3)
abstracting: (move<=p_rel)
states: 1,082 (3)
abstracting: (off<=moved)
states: 946
abstracting: (move<=r_active)
states: 1,430 (3)
abstracting: (r_stopped<=5)
states: 1,430 (3)
abstracting: (p_rdy<=0)
states: 990
abstracting: (initialized<=3)
states: 1,428 (3)
abstracting: (5<=off)
states: 0
abstracting: (access<=access)
states: 1,430 (3)
abstracting: (p_rel<=3)
states: 1,428 (3)
abstracting: (p_i2<=0)
states: 330
abstracting: (access<=0)
states: 140
abstracting: (p_i1<=0)
states: 495
abstracting: (1<=r_moving)
states: 440
abstracting: (move<=2)
states: 1,410 (3)
abstracting: (r_stopped<=0)
states: 825
-> the formula is FALSE
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AG [[[~ [[[~ [move<=r_active] & ~ [3<=off]] | [[[~ [initialize<=4] & r_moving<=0] | ~ [r_stopped<=4]] & 5<=r_stopped]]] & p_i1<=r_active] | ~ [[[p_rdy<=move & ~ [[moved<=5 | p_m<=r_stopped]]] & [[~ [[~ [p_m<=off] & [p_rel<=0 | off<=1]]] & r_moving<=moved] | ~ [[[~ [2<=p_rdy] & [initialized<=p_sc | 1<=r_stopped]] | [~ [r_stopped<=3] | [off<=initialize & r_stopped<=p_rel]]]]]]]]]
normalized: ~ [E [true U ~ [[~ [[[~ [[[[off<=initialize & r_stopped<=p_rel] | ~ [r_stopped<=3]] | [[initialized<=p_sc | 1<=r_stopped] & ~ [2<=p_rdy]]]] | [~ [[[p_rel<=0 | off<=1] & ~ [p_m<=off]]] & r_moving<=moved]] & [~ [[moved<=5 | p_m<=r_stopped]] & p_rdy<=move]]] | [~ [[[[~ [r_stopped<=4] | [~ [initialize<=4] & r_moving<=0]] & 5<=r_stopped] | [~ [3<=off] & ~ [move<=r_active]]]] & p_i1<=r_active]]]]]
abstracting: (p_i1<=r_active)
states: 1,314 (3)
abstracting: (move<=r_active)
states: 1,430 (3)
abstracting: (3<=off)
states: 47
abstracting: (5<=r_stopped)
states: 0
abstracting: (r_moving<=0)
states: 990
abstracting: (initialize<=4)
states: 1,425 (3)
abstracting: (r_stopped<=4)
states: 1,430 (3)
abstracting: (p_rdy<=move)
states: 1,082 (3)
abstracting: (p_m<=r_stopped)
states: 675
abstracting: (moved<=5)
states: 1,430 (3)
abstracting: (r_moving<=moved)
states: 1,082 (3)
abstracting: (p_m<=off)
states: 675
abstracting: (off<=1)
states: 1,230 (3)
abstracting: (p_rel<=0)
states: 990
abstracting: (2<=p_rdy)
states: 110
abstracting: (1<=r_stopped)
states: 605
abstracting: (initialized<=p_sc)
states: 1,082 (3)
abstracting: (r_stopped<=3)
states: 1,424 (3)
abstracting: (r_stopped<=p_rel)
states: 946
abstracting: (off<=initialize)
states: 1,210 (3)
-> the formula is TRUE
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EF [[[~ [r_moving<=5] | [[[[~ [[[p_rdy<=5 | p_i1<=p_i2] | p_sc<=3]] & [[[p_i2<=p_sc | r_moving<=4] | [r_moving<=p_rdy & p_m<=p_i1]] & [5<=p_rel | [5<=p_i1 & 5<=off]]]] | r_stopped<=moved] & [~ [[access<=5 & 3<=initialize]] & ~ [p_rdy<=0]]] | [[p_rdy<=moved | 2<=r_active] & r_active<=p_i2]]] & ~ [[~ [[[r_active<=p_rel | [[[r_active<=5 & r_stopped<=3] | 4<=r_active] | ~ [[initialized<=p_rdy & access<=moved]]]] & 5<=move]] | moved<=move]]]]
normalized: E [true U [~ [[~ [[[[~ [[initialized<=p_rdy & access<=moved]] | [[r_active<=5 & r_stopped<=3] | 4<=r_active]] | r_active<=p_rel] & 5<=move]] | moved<=move]] & [[[[p_rdy<=moved | 2<=r_active] & r_active<=p_i2] | [[~ [p_rdy<=0] & ~ [[access<=5 & 3<=initialize]]] & [[[[[5<=p_i1 & 5<=off] | 5<=p_rel] & [[r_moving<=p_rdy & p_m<=p_i1] | [p_i2<=p_sc | r_moving<=4]]] & ~ [[[p_rdy<=5 | p_i1<=p_i2] | p_sc<=3]]] | r_stopped<=moved]]] | ~ [r_moving<=5]]]]
abstracting: (r_moving<=5)
states: 1,430 (3)
abstracting: (r_stopped<=moved)
states: 946
abstracting: (p_sc<=3)
states: 1,428 (3)
abstracting: (p_i1<=p_i2)
states: 932
abstracting: (p_rdy<=5)
states: 1,430 (3)
abstracting: (r_moving<=4)
states: 1,430 (3)
abstracting: (p_i2<=p_sc)
states: 510
abstracting: (p_m<=p_i1)
states: 840
abstracting: (r_moving<=p_rdy)
states: 1,082 (3)
abstracting: (5<=p_rel)
states: 0
abstracting: (5<=off)
states: 0
abstracting: (5<=p_i1)
states: 5
abstracting: (3<=initialize)
states: 155
abstracting: (access<=5)
states: 1,430 (3)
abstracting: (p_rdy<=0)
states: 990
abstracting: (r_active<=p_i2)
states: 355
abstracting: (2<=r_active)
states: 1,308 (3)
abstracting: (p_rdy<=moved)
states: 1,082 (3)
abstracting: (moved<=move)
states: 1,082 (3)
abstracting: (5<=move)
states: 0
abstracting: (r_active<=p_rel)
states: 50
abstracting: (4<=r_active)
states: 540
abstracting: (r_stopped<=3)
states: 1,424 (3)
abstracting: (r_active<=5)
states: 1,430 (3)
abstracting: (access<=moved)
states: 320
abstracting: (initialized<=p_rdy)
states: 1,082 (3)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: AG [[[initialize<=access & [[[[~ [[[3<=access | r_moving<=p_i2] | [r_moving<=2 & move<=p_rdy]]] | [~ [[4<=p_m & 4<=p_i1]] & p_sc<=p_i1]] & r_moving<=p_sc] | [[~ [[2<=off | p_m<=access]] | [[p_rdy<=off & [p_rel<=1 | off<=r_stopped]] | [[4<=p_sc & 1<=moved] & ~ [3<=moved]]]] | 5<=p_i1]] | [[move<=p_i2 | [3<=move | [[~ [r_active<=0] & ~ [4<=p_i1]] | 2<=p_m]]] & [[initialize<=off & 5<=p_rdy] | [2<=access & ~ [p_i1<=2]]]]]] & [p_rel<=3 | 2<=r_moving]]]
normalized: ~ [E [true U ~ [[[p_rel<=3 | 2<=r_moving] & [[[[[~ [p_i1<=2] & 2<=access] | [initialize<=off & 5<=p_rdy]] & [[[[~ [4<=p_i1] & ~ [r_active<=0]] | 2<=p_m] | 3<=move] | move<=p_i2]] | [[[[[~ [3<=moved] & [4<=p_sc & 1<=moved]] | [[p_rel<=1 | off<=r_stopped] & p_rdy<=off]] | ~ [[2<=off | p_m<=access]]] | 5<=p_i1] | [[[~ [[4<=p_m & 4<=p_i1]] & p_sc<=p_i1] | ~ [[[r_moving<=2 & move<=p_rdy] | [3<=access | r_moving<=p_i2]]]] & r_moving<=p_sc]]] & initialize<=access]]]]]
abstracting: (initialize<=access)
states: 1,220 (3)
abstracting: (r_moving<=p_sc)
states: 1,082 (3)
abstracting: (r_moving<=p_i2)
states: 1,263 (3)
abstracting: (3<=access)
states: 490
abstracting: (move<=p_rdy)
states: 1,082 (3)
abstracting: (r_moving<=2)
states: 1,410 (3)
abstracting: (p_sc<=p_i1)
states: 1,218 (3)
abstracting: (4<=p_i1)
states: 38
abstracting: (4<=p_m)
states: 30
abstracting: (5<=p_i1)
states: 5
abstracting: (p_m<=access)
states: 1,080 (3)
abstracting: (2<=off)
states: 200
abstracting: (p_rdy<=off)
states: 1,120 (3)
abstracting: (off<=r_stopped)
states: 984
abstracting: (p_rel<=1)
states: 1,320 (3)
abstracting: (1<=moved)
states: 440
abstracting: (4<=p_sc)
states: 2
abstracting: (3<=moved)
states: 20
abstracting: (move<=p_i2)
states: 1,263 (3)
abstracting: (3<=move)
states: 20
abstracting: (2<=p_m)
states: 506
abstracting: (r_active<=0)
states: 20
abstracting: (4<=p_i1)
states: 38
abstracting: (5<=p_rdy)
states: 0
abstracting: (initialize<=off)
states: 715
abstracting: (2<=access)
states: 940
abstracting: (p_i1<=2)
states: 1,275 (3)
abstracting: (2<=r_moving)
states: 110
abstracting: (p_rel<=3)
states: 1,428 (3)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: AG [[~ [[[~ [[~ [access<=2] & [r_moving<=5 & 2<=p_sc]]] | [[[moved<=r_moving | ~ [initialized<=1]] | [~ [moved<=5] & [off<=off & p_i1<=0]]] & 5<=access]] & [p_i2<=r_active | 3<=p_rel]]] | ~ [[[p_sc<=off & r_stopped<=4] & [[[[[[2<=p_sc & p_sc<=0] | p_sc<=0] | [~ [move<=0] | ~ [3<=off]]] & p_rel<=1] & [[r_stopped<=2 & [[2<=moved | r_stopped<=p_i1] & ~ [initialized<=2]]] | initialize<=off]] | [[~ [1<=move] & [[[2<=move | r_moving<=p_rel] & [p_rdy<=p_i2 & 3<=access]] | [~ [off<=p_i2] | [p_rdy<=5 | off<=moved]]]] | [5<=p_i1 & [~ [2<=r_stopped] & access<=0]]]]]]]]
normalized: ~ [E [true U ~ [[~ [[[p_i2<=r_active | 3<=p_rel] & [[[[[off<=off & p_i1<=0] & ~ [moved<=5]] | [~ [initialized<=1] | moved<=r_moving]] & 5<=access] | ~ [[[r_moving<=5 & 2<=p_sc] & ~ [access<=2]]]]]] | ~ [[[[[[~ [2<=r_stopped] & access<=0] & 5<=p_i1] | [[[[p_rdy<=5 | off<=moved] | ~ [off<=p_i2]] | [[p_rdy<=p_i2 & 3<=access] & [2<=move | r_moving<=p_rel]]] & ~ [1<=move]]] | [[[[~ [initialized<=2] & [2<=moved | r_stopped<=p_i1]] & r_stopped<=2] | initialize<=off] & [[[~ [3<=off] | ~ [move<=0]] | [[2<=p_sc & p_sc<=0] | p_sc<=0]] & p_rel<=1]]] & [p_sc<=off & r_stopped<=4]]]]]]]
abstracting: (r_stopped<=4)
states: 1,430 (3)
abstracting: (p_sc<=off)
states: 1,120 (3)
abstracting: (p_rel<=1)
states: 1,320 (3)
abstracting: (p_sc<=0)
states: 990
abstracting: (p_sc<=0)
states: 990
abstracting: (2<=p_sc)
states: 110
abstracting: (move<=0)
states: 990
abstracting: (3<=off)
states: 47
abstracting: (initialize<=off)
states: 715
abstracting: (r_stopped<=2)
states: 1,383 (3)
abstracting: (r_stopped<=p_i1)
states: 1,210 (3)
abstracting: (2<=moved)
states: 110
abstracting: (initialized<=2)
states: 1,410 (3)
abstracting: (1<=move)
states: 440
abstracting: (r_moving<=p_rel)
states: 1,082 (3)
abstracting: (2<=move)
states: 110
abstracting: (3<=access)
states: 490
abstracting: (p_rdy<=p_i2)
states: 1,263 (3)
abstracting: (off<=p_i2)
states: 1,256 (3)
abstracting: (off<=moved)
states: 946
abstracting: (p_rdy<=5)
states: 1,430 (3)
abstracting: (5<=p_i1)
states: 5
abstracting: (access<=0)
states: 140
abstracting: (2<=r_stopped)
states: 200
abstracting: (access<=2)
states: 940
abstracting: (2<=p_sc)
states: 110
abstracting: (r_moving<=5)
states: 1,430 (3)
abstracting: (5<=access)
states: 0
abstracting: (moved<=r_moving)
states: 1,082 (3)
abstracting: (initialized<=1)
states: 1,320 (3)
abstracting: (moved<=5)
states: 1,430 (3)
abstracting: (p_i1<=0)
states: 495
abstracting: (off<=off)
states: 1,430 (3)
abstracting: (3<=p_rel)
states: 20
abstracting: (p_i2<=r_active)
states: 1,270 (3)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: AG [[[3<=p_m | ~ [[~ [[[[initialized<=2 | r_active<=r_stopped] | [1<=p_m & 2<=p_rel]] & [access<=r_stopped & r_stopped<=initialize]]] & ~ [[~ [access<=2] & [[[p_rel<=1 & 4<=p_i2] | [p_sc<=r_moving & 4<=p_i1]] & [[initialize<=2 & 2<=p_sc] | [2<=r_stopped | off<=r_active]]]]]]]] & [[[[p_i1<=3 | p_rel<=p_m] & [r_stopped<=p_m | [[[~ [p_i2<=5] | moved<=moved] & [5<=p_sc & [4<=p_rel | 1<=move]]] & 2<=p_rdy]]] & 5<=p_rel] & [[[~ [p_m<=1] & [[[5<=p_i1 & initialized<=p_m] | access<=p_sc] | 3<=p_rdy]] | [~ [[[2<=initialize & 4<=p_sc] & p_i2<=4]] & [p_rel<=move & [[p_sc<=moved & ~ [move<=3]] | [p_sc<=5 & ~ [4<=move]]]]]] | [[[[[p_m<=p_i1 & initialize<=3] & [p_rel<=r_active & access<=p_i2]] & initialized<=0] | ~ [1<=r_moving]] & ~ [[5<=initialized | [p_i1<=1 | [r_stopped<=p_rdy | 5<=p_i1]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[~ [[[[r_stopped<=p_rdy | 5<=p_i1] | p_i1<=1] | 5<=initialized]] & [~ [1<=r_moving] | [[[p_rel<=r_active & access<=p_i2] & [p_m<=p_i1 & initialize<=3]] & initialized<=0]]] | [[[[[~ [4<=move] & p_sc<=5] | [~ [move<=3] & p_sc<=moved]] & p_rel<=move] & ~ [[[2<=initialize & 4<=p_sc] & p_i2<=4]]] | [[[[5<=p_i1 & initialized<=p_m] | access<=p_sc] | 3<=p_rdy] & ~ [p_m<=1]]]] & [[[[[[[4<=p_rel | 1<=move] & 5<=p_sc] & [~ [p_i2<=5] | moved<=moved]] & 2<=p_rdy] | r_stopped<=p_m] & [p_i1<=3 | p_rel<=p_m]] & 5<=p_rel]] & [~ [[~ [[[[[2<=r_stopped | off<=r_active] | [initialize<=2 & 2<=p_sc]] & [[p_sc<=r_moving & 4<=p_i1] | [p_rel<=1 & 4<=p_i2]]] & ~ [access<=2]]] & ~ [[[access<=r_stopped & r_stopped<=initialize] & [[1<=p_m & 2<=p_rel] | [initialized<=2 | r_active<=r_stopped]]]]]] | 3<=p_m]]]]]
abstracting: (3<=p_m)
states: 170
abstracting: (r_active<=r_stopped)
states: 227
abstracting: (initialized<=2)
states: 1,410 (3)
abstracting: (2<=p_rel)
states: 110
abstracting: (1<=p_m)
states: 1,010 (3)
abstracting: (r_stopped<=initialize)
states: 1,210 (3)
abstracting: (access<=r_stopped)
states: 336
abstracting: (access<=2)
states: 940
abstracting: (4<=p_i2)
states: 90
abstracting: (p_rel<=1)
states: 1,320 (3)
abstracting: (4<=p_i1)
states: 38
abstracting: (p_sc<=r_moving)
states: 1,082 (3)
abstracting: (2<=p_sc)
states: 110
abstracting: (initialize<=2)
states: 1,275 (3)
abstracting: (off<=r_active)
states: 1,430 (3)
abstracting: (2<=r_stopped)
states: 200
abstracting: (5<=p_rel)
states: 0
abstracting: (p_rel<=p_m)
states: 1,220 (3)
abstracting: (p_i1<=3)
states: 1,392 (3)
abstracting: (r_stopped<=p_m)
states: 1,128 (3)
abstracting: (2<=p_rdy)
states: 110
abstracting: (moved<=moved)
states: 1,430 (3)
abstracting: (p_i2<=5)
states: 1,430 (3)
abstracting: (5<=p_sc)
states: 0
abstracting: (1<=move)
states: 440
abstracting: (4<=p_rel)
states: 2
abstracting: (p_m<=1)
states: 924
abstracting: (3<=p_rdy)
states: 20
abstracting: (access<=p_sc)
states: 320
abstracting: (initialized<=p_m)
states: 1,220 (3)
abstracting: (5<=p_i1)
states: 5
abstracting: (p_i2<=4)
states: 1,415 (3)
abstracting: (4<=p_sc)
states: 2
abstracting: (2<=initialize)
states: 440
abstracting: (p_rel<=move)
states: 1,082 (3)
abstracting: (p_sc<=moved)
states: 1,082 (3)
abstracting: (move<=3)
states: 1,428 (3)
abstracting: (p_sc<=5)
states: 1,430 (3)
abstracting: (4<=move)
states: 2
abstracting: (initialized<=0)
states: 990
abstracting: (initialize<=3)
states: 1,392 (3)
abstracting: (p_m<=p_i1)
states: 840
abstracting: (access<=p_i2)
states: 780
abstracting: (p_rel<=r_active)
states: 1,430 (3)
abstracting: (1<=r_moving)
states: 440
abstracting: (5<=initialized)
states: 0
abstracting: (p_i1<=1)
states: 990
abstracting: (5<=p_i1)
states: 5
abstracting: (r_stopped<=p_rdy)
states: 946
-> the formula is FALSE
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: AG [~ [[[[~ [[5<=r_stopped & ~ [[access<=p_rdy & move<=moved]]]] & [2<=moved | ~ [[r_stopped<=r_active & r_active<=initialized]]]] & [[~ [[off<=r_active & [[4<=p_rdy | access<=r_moving] & [p_sc<=initialized & access<=r_stopped]]]] | [[[5<=p_i2 | [3<=r_stopped & 1<=r_stopped]] | 4<=p_rel] | [~ [move<=2] | 2<=p_m]]] & ~ [[[2<=p_rdy | ~ [off<=initialize]] | [[~ [2<=r_stopped] | ~ [5<=p_rel]] & [[p_i1<=1 & moved<=off] & [access<=4 & p_m<=r_active]]]]]]] & [~ [[[~ [[[3<=access | 5<=move] | [1<=p_i2 | p_rel<=p_i2]]] | [[[r_moving<=0 | initialize<=4] & 3<=p_m] | ~ [[initialized<=p_rel | initialized<=0]]]] | p_i2<=1]] & [~ [4<=p_m] & [[[[~ [p_i2<=r_moving] | [p_i1<=0 & off<=3]] & ~ [[p_i2<=5 | 1<=move]]] & [[3<=moved & 1<=move] & [~ [p_rel<=r_moving] | [initialized<=3 & p_i2<=off]]]] | [~ [[p_i1<=4 & r_stopped<=2]] | [~ [5<=moved] & ~ [[moved<=1 & moved<=0]]]]]]]]]]
normalized: ~ [E [true U [[[[[[~ [[moved<=1 & moved<=0]] & ~ [5<=moved]] | ~ [[p_i1<=4 & r_stopped<=2]]] | [[[[initialized<=3 & p_i2<=off] | ~ [p_rel<=r_moving]] & [3<=moved & 1<=move]] & [~ [[p_i2<=5 | 1<=move]] & [[p_i1<=0 & off<=3] | ~ [p_i2<=r_moving]]]]] & ~ [4<=p_m]] & ~ [[p_i2<=1 | [[~ [[initialized<=p_rel | initialized<=0]] | [3<=p_m & [r_moving<=0 | initialize<=4]]] | ~ [[[1<=p_i2 | p_rel<=p_i2] | [3<=access | 5<=move]]]]]]] & [[~ [[[[[access<=4 & p_m<=r_active] & [p_i1<=1 & moved<=off]] & [~ [5<=p_rel] | ~ [2<=r_stopped]]] | [2<=p_rdy | ~ [off<=initialize]]]] & [[[2<=p_m | ~ [move<=2]] | [4<=p_rel | [5<=p_i2 | [3<=r_stopped & 1<=r_stopped]]]] | ~ [[off<=r_active & [[p_sc<=initialized & access<=r_stopped] & [4<=p_rdy | access<=r_moving]]]]]] & [[2<=moved | ~ [[r_stopped<=r_active & r_active<=initialized]]] & ~ [[5<=r_stopped & ~ [[access<=p_rdy & move<=moved]]]]]]]]]
abstracting: (move<=moved)
states: 1,082 (3)
abstracting: (access<=p_rdy)
states: 252
abstracting: (5<=r_stopped)
states: 0
abstracting: (r_active<=initialized)
states: 50
abstracting: (r_stopped<=r_active)
states: 1,347 (3)
abstracting: (2<=moved)
states: 110
abstracting: (access<=r_moving)
states: 320
abstracting: (4<=p_rdy)
states: 2
abstracting: (access<=r_stopped)
states: 336
abstracting: (p_sc<=initialized)
states: 1,082 (3)
abstracting: (off<=r_active)
states: 1,430 (3)
abstracting: (1<=r_stopped)
states: 605
abstracting: (3<=r_stopped)
states: 47
abstracting: (5<=p_i2)
states: 15
abstracting: (4<=p_rel)
states: 2
abstracting: (move<=2)
states: 1,410 (3)
abstracting: (2<=p_m)
states: 506
abstracting: (off<=initialize)
states: 1,210 (3)
abstracting: (2<=p_rdy)
states: 110
abstracting: (2<=r_stopped)
states: 200
abstracting: (5<=p_rel)
states: 0
abstracting: (moved<=off)
states: 1,120 (3)
abstracting: (p_i1<=1)
states: 990
abstracting: (p_m<=r_active)
states: 1,326 (3)
abstracting: (access<=4)
states: 1,430 (3)
abstracting: (5<=move)
states: 0
abstracting: (3<=access)
states: 490
abstracting: (p_rel<=p_i2)
states: 1,263 (3)
abstracting: (1<=p_i2)
states: 1,100 (3)
abstracting: (initialize<=4)
states: 1,425 (3)
abstracting: (r_moving<=0)
states: 990
abstracting: (3<=p_m)
states: 170
abstracting: (initialized<=0)
states: 990
abstracting: (initialized<=p_rel)
states: 1,082 (3)
abstracting: (p_i2<=1)
states: 780
abstracting: (4<=p_m)
states: 30
abstracting: (p_i2<=r_moving)
states: 510
abstracting: (off<=3)
states: 1,424 (3)
abstracting: (p_i1<=0)
states: 495
abstracting: (1<=move)
states: 440
abstracting: (p_i2<=5)
states: 1,430 (3)
abstracting: (1<=move)
states: 440
abstracting: (3<=moved)
states: 20
abstracting: (p_rel<=r_moving)
states: 1,082 (3)
abstracting: (p_i2<=off)
states: 541
abstracting: (initialized<=3)
states: 1,428 (3)
abstracting: (r_stopped<=2)
states: 1,383 (3)
abstracting: (p_i1<=4)
states: 1,425 (3)
abstracting: (5<=moved)
states: 0
abstracting: (moved<=0)
states: 990
abstracting: (moved<=1)
states: 1,320 (3)
-> the formula is FALSE
FORMULA RobotManipulation-PT-00002-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
totally nodes used: 15464 (1.5e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 16430 19896 36326
used/not used/entry size/cache size: 23656 67085208 16 1024MB
basic ops cache: hits/miss/sum: 28725 53271 81996
used/not used/entry size/cache size: 84898 16692318 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: 6714 7212 13926
used/not used/entry size/cache size: 7212 8381396 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 67094961
1 13241
2 431
3 103
4 34
5 20
6 25
7 8
8 7
9 5
>= 10 29
Total processing time: 0m 5.703sec
BK_STOP 1678978092473
--------------------
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 ReachabilityCardinality -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:181 (16), effective:41 (3)
initing FirstDep: 0m 0.000sec
iterations count:89 (8), effective:18 (1)
iterations count:15 (1), effective:2 (0)
iterations count:73 (6), effective:11 (1)
iterations count:27 (2), effective:4 (0)
iterations count:38 (3), effective:10 (0)
iterations count:87 (7), effective:18 (1)
iterations count:60 (5), effective:16 (1)
iterations count:115 (10), effective:26 (2)
iterations count:11 (1), effective:0 (0)
iterations count:131 (11), effective:32 (2)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RobotManipulation-PT-00002"
export BK_EXAMINATION="ReachabilityCardinality"
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-00002, examination is ReachabilityCardinality"
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-167891812000014"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-00002.tgz
mv RobotManipulation-PT-00002 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;