About the Execution of Marcie+red for ResAllocation-PT-R003C010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5449.823 | 8690.00 | 11852.00 | 378.60 | FTFFFFFFFTTTFTTT | 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.r330-tall-167889203600694.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 ResAllocation-PT-R003C010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203600694
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.8K Feb 25 15:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 15:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 15:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 15:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 15:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 15:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Feb 25 15:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 71K 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 ResAllocation-PT-R003C010-ReachabilityCardinality-00
FORMULA_NAME ResAllocation-PT-R003C010-ReachabilityCardinality-01
FORMULA_NAME ResAllocation-PT-R003C010-ReachabilityCardinality-02
FORMULA_NAME ResAllocation-PT-R003C010-ReachabilityCardinality-03
FORMULA_NAME ResAllocation-PT-R003C010-ReachabilityCardinality-04
FORMULA_NAME ResAllocation-PT-R003C010-ReachabilityCardinality-05
FORMULA_NAME ResAllocation-PT-R003C010-ReachabilityCardinality-06
FORMULA_NAME ResAllocation-PT-R003C010-ReachabilityCardinality-07
FORMULA_NAME ResAllocation-PT-R003C010-ReachabilityCardinality-08
FORMULA_NAME ResAllocation-PT-R003C010-ReachabilityCardinality-09
FORMULA_NAME ResAllocation-PT-R003C010-ReachabilityCardinality-10
FORMULA_NAME ResAllocation-PT-R003C010-ReachabilityCardinality-11
FORMULA_NAME ResAllocation-PT-R003C010-ReachabilityCardinality-12
FORMULA_NAME ResAllocation-PT-R003C010-ReachabilityCardinality-13
FORMULA_NAME ResAllocation-PT-R003C010-ReachabilityCardinality-14
FORMULA_NAME ResAllocation-PT-R003C010-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679180827995
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=ResAllocation-PT-R003C010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 23:07:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 23:07:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:07:09] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2023-03-18 23:07:09] [INFO ] Transformed 60 places.
[2023-03-18 23:07:09] [INFO ] Transformed 40 transitions.
[2023-03-18 23:07:09] [INFO ] Parsed PT model containing 60 places and 40 transitions and 174 arcs in 99 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 426 resets, run finished after 521 ms. (steps per millisecond=19 ) properties (out of 13) seen :6
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 57 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 40 rows 60 cols
[2023-03-18 23:07:10] [INFO ] Computed 30 place invariants in 9 ms
[2023-03-18 23:07:10] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2023-03-18 23:07:10] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-18 23:07:10] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2023-03-18 23:07:10] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :1
[2023-03-18 23:07:10] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-18 23:07:10] [INFO ] After 145ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :1
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 1 different solutions.
Finished Parikh walk after 48 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=48 )
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 2 ms.
All properties solved without resorting to model-checking.
Total runtime 1540 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: ResAllocation_PT_R003C010
(NrP: 60 NrTr: 40 NrArc: 174)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.708sec
RS generation: 0m 0.002sec
-> reachability set: #nodes 376 (3.8e+02) #states 823,552 (5)
starting MCC model checker
--------------------------
checking: EF [~ [r_8_0<=1]]
normalized: E [true U ~ [r_8_0<=1]]
abstracting: (r_8_0<=1)
states: 823,552 (5)
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [p_7_0<=1]]
normalized: E [true U ~ [p_7_0<=1]]
abstracting: (p_7_0<=1)
states: 823,552 (5)
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [1<=r_9_1]
normalized: ~ [E [true U ~ [1<=r_9_1]]]
abstracting: (1<=r_9_1)
states: 499,712 (5)
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [p_1_2<=p_1_2]
normalized: ~ [E [true U ~ [p_1_2<=p_1_2]]]
abstracting: (p_1_2<=p_1_2)
states: 823,552 (5)
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [r_8_1<=r_5_0]
normalized: E [true U r_8_1<=r_5_0]
abstracting: (r_8_1<=r_5_0)
states: 644,544 (5)
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [[[r_9_2<=1 | 1<=p_1_0] | p_0_2<=1]]
normalized: ~ [E [true U ~ [[[r_9_2<=1 | 1<=p_1_0] | p_0_2<=1]]]]
abstracting: (p_0_2<=1)
states: 823,552 (5)
abstracting: (1<=p_1_0)
states: 65,024 (4)
abstracting: (r_9_2<=1)
states: 823,552 (5)
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[[p_3_0<=r_6_1 | r_5_2<=r_8_1] & r_6_1<=1]]
normalized: ~ [E [true U ~ [[[p_3_0<=r_6_1 | r_5_2<=r_8_1] & r_6_1<=1]]]]
abstracting: (r_6_1<=1)
states: 823,552 (5)
abstracting: (r_5_2<=r_8_1)
states: 595,200 (5)
abstracting: (p_3_0<=r_6_1)
states: 775,552 (5)
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
checking: EF [~ [[[1<=r_1_1 & [1<=r_1_1 & [~ [[[1<=r_8_0 | [r_1_0<=p_6_1 & p_4_0<=1]] | [r_6_2<=p_4_2 & ~ [1<=r_5_0]]]] | 1<=p_2_1]]] | 1<=r_9_0]]]
normalized: E [true U ~ [[1<=r_9_0 | [1<=r_1_1 & [1<=r_1_1 & [1<=p_2_1 | ~ [[[~ [1<=r_5_0] & r_6_2<=p_4_2] | [1<=r_8_0 | [r_1_0<=p_6_1 & p_4_0<=1]]]]]]]]]]
abstracting: (p_4_0<=1)
states: 823,552 (5)
abstracting: (r_1_0<=p_6_1)
states: 502,144 (5)
abstracting: (1<=r_8_0)
states: 326,784 (5)
abstracting: (r_6_2<=p_4_2)
states: 481,024 (5)
abstracting: (1<=r_5_0)
states: 405,248 (5)
abstracting: (1<=p_2_1)
states: 246,272 (5)
abstracting: (1<=r_1_1)
states: 433,920 (5)
abstracting: (1<=r_1_1)
states: 433,920 (5)
abstracting: (1<=r_9_0)
states: 584,704 (5)
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: AG [~ [[[1<=p_0_0 & [[p_6_0<=0 | [p_6_1<=0 | p_6_0<=1]] | ~ [[p_3_1<=r_3_1 | p_8_2<=p_0_2]]]] & [[[~ [p_6_1<=r_5_0] & ~ [1<=r_1_1]] & ~ [[1<=r_0_0 & 1<=p_6_1]]] & [~ [p_1_2<=r_3_2] & ~ [r_7_1<=1]]]]]]
normalized: ~ [E [true U [[[~ [r_7_1<=1] & ~ [p_1_2<=r_3_2]] & [~ [[1<=r_0_0 & 1<=p_6_1]] & [~ [1<=r_1_1] & ~ [p_6_1<=r_5_0]]]] & [[~ [[p_3_1<=r_3_1 | p_8_2<=p_0_2]] | [[p_6_1<=0 | p_6_0<=1] | p_6_0<=0]] & 1<=p_0_0]]]]
abstracting: (1<=p_0_0)
states: 379,264 (5)
abstracting: (p_6_0<=0)
states: 517,120 (5)
abstracting: (p_6_0<=1)
states: 823,552 (5)
abstracting: (p_6_1<=0)
states: 629,248 (5)
abstracting: (p_8_2<=p_0_2)
states: 777,728 (5)
abstracting: (p_3_1<=r_3_1)
states: 629,248 (5)
abstracting: (p_6_1<=r_5_0)
states: 726,400 (5)
abstracting: (1<=r_1_1)
states: 433,920 (5)
abstracting: (1<=p_6_1)
states: 194,304 (5)
abstracting: (1<=r_0_0)
states: 379,264 (5)
abstracting: (p_1_2<=r_3_2)
states: 681,216 (5)
abstracting: (r_7_1<=1)
states: 823,552 (5)
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [[[[[~ [[1<=r_5_1 & [~ [[p_8_1<=1 & p_2_2<=0]] & ~ [[p_4_1<=1 & 1<=r_7_1]]]]] | ~ [r_3_2<=1]] | ~ [[~ [[~ [p_0_0<=0] | p_6_2<=r_9_2]] | r_5_1<=p_6_0]]] & p_7_0<=p_6_1] & ~ [[~ [[[1<=p_8_2 | p_2_1<=r_5_1] & [r_5_1<=p_9_1 & r_9_1<=p_8_2]]] | r_8_1<=1]]]]
normalized: E [true U [~ [[~ [[[r_5_1<=p_9_1 & r_9_1<=p_8_2] & [1<=p_8_2 | p_2_1<=r_5_1]]] | r_8_1<=1]] & [p_7_0<=p_6_1 & [~ [[~ [[~ [p_0_0<=0] | p_6_2<=r_9_2]] | r_5_1<=p_6_0]] | [~ [r_3_2<=1] | ~ [[[~ [[p_4_1<=1 & 1<=r_7_1]] & ~ [[p_8_1<=1 & p_2_2<=0]]] & 1<=r_5_1]]]]]]]
abstracting: (1<=r_5_1)
states: 412,800 (5)
abstracting: (p_2_2<=0)
states: 685,824 (5)
abstracting: (p_8_1<=1)
states: 823,552 (5)
abstracting: (1<=r_7_1)
states: 433,920 (5)
abstracting: (p_4_1<=1)
states: 823,552 (5)
abstracting: (r_3_2<=1)
states: 823,552 (5)
abstracting: (r_5_1<=p_6_0)
states: 556,672 (5)
abstracting: (p_6_2<=r_9_2)
states: 785,152 (5)
abstracting: (p_0_0<=0)
states: 444,288 (5)
abstracting: (p_7_0<=p_6_1)
states: 685,824 (5)
abstracting: (r_8_1<=1)
states: 823,552 (5)
abstracting: (p_2_1<=r_5_1)
states: 707,840 (5)
abstracting: (1<=p_8_2)
states: 65,024 (4)
abstracting: (r_9_1<=p_8_2)
states: 388,864 (5)
abstracting: (r_5_1<=p_9_1)
states: 579,520 (5)
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [~ [[[~ [[[r_2_1<=r_8_1 | ~ [[[r_4_1<=p_5_1 | r_9_0<=r_7_2] | p_7_0<=1]]] | [p_3_2<=0 & r_9_1<=r_7_1]]] & ~ [1<=r_2_2]] | [~ [[[[[[1<=p_3_2 | r_3_2<=r_2_2] & 1<=p_6_2] | [~ [r_2_2<=0] | [p_8_0<=r_2_1 & 1<=p_3_0]]] | 1<=r_0_0] & r_7_2<=1]] | r_3_2<=1]]]]
normalized: E [true U ~ [[[~ [[[[[[p_8_0<=r_2_1 & 1<=p_3_0] | ~ [r_2_2<=0]] | [[1<=p_3_2 | r_3_2<=r_2_2] & 1<=p_6_2]] | 1<=r_0_0] & r_7_2<=1]] | r_3_2<=1] | [~ [1<=r_2_2] & ~ [[[p_3_2<=0 & r_9_1<=r_7_1] | [~ [[[r_4_1<=p_5_1 | r_9_0<=r_7_2] | p_7_0<=1]] | r_2_1<=r_8_1]]]]]]]
abstracting: (r_2_1<=r_8_1)
states: 605,888 (5)
abstracting: (p_7_0<=1)
states: 823,552 (5)
abstracting: (r_9_0<=r_7_2)
states: 527,488 (5)
abstracting: (r_4_1<=p_5_1)
states: 432,896 (5)
abstracting: (r_9_1<=r_7_1)
states: 557,056 (5)
abstracting: (p_3_2<=0)
states: 517,120 (5)
abstracting: (1<=r_2_2)
states: 379,392 (5)
abstracting: (r_3_2<=1)
states: 823,552 (5)
abstracting: (r_7_2<=1)
states: 823,552 (5)
abstracting: (1<=r_0_0)
states: 379,264 (5)
abstracting: (1<=p_6_2)
states: 96,000 (4)
abstracting: (r_3_2<=r_2_2)
states: 724,736 (5)
abstracting: (1<=p_3_2)
states: 306,432 (5)
abstracting: (r_2_2<=0)
states: 444,160 (5)
abstracting: (1<=p_3_0)
states: 96,000 (4)
abstracting: (p_8_0<=r_2_1)
states: 686,528 (5)
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EF [[p_2_1<=0 & [[[[p_4_0<=p_5_2 | [r_1_1<=1 | ~ [[[p_8_2<=1 | 1<=r_6_1] | 1<=p_2_1]]]] | [p_8_2<=1 | [~ [r_9_0<=0] & ~ [[p_3_0<=1 | [1<=p_6_0 | p_6_1<=0]]]]]] & [[[[p_7_2<=0 & [[p_6_1<=0 & p_5_1<=p_7_2] | [1<=r_5_2 | r_9_2<=1]]] & [r_5_2<=1 & ~ [[1<=r_2_1 | 1<=r_1_1]]]] & 1<=p_9_2] | p_3_2<=1]] | p_7_0<=0]]]
normalized: E [true U [p_2_1<=0 & [p_7_0<=0 | [[p_3_2<=1 | [1<=p_9_2 & [[r_5_2<=1 & ~ [[1<=r_2_1 | 1<=r_1_1]]] & [p_7_2<=0 & [[1<=r_5_2 | r_9_2<=1] | [p_6_1<=0 & p_5_1<=p_7_2]]]]]] & [[p_8_2<=1 | [~ [[p_3_0<=1 | [1<=p_6_0 | p_6_1<=0]]] & ~ [r_9_0<=0]]] | [p_4_0<=p_5_2 | [r_1_1<=1 | ~ [[1<=p_2_1 | [p_8_2<=1 | 1<=r_6_1]]]]]]]]]]
abstracting: (1<=r_6_1)
states: 382,976 (5)
abstracting: (p_8_2<=1)
states: 823,552 (5)
abstracting: (1<=p_2_1)
states: 246,272 (5)
abstracting: (r_1_1<=1)
states: 823,552 (5)
abstracting: (p_4_0<=p_5_2)
states: 619,264 (5)
abstracting: (r_9_0<=0)
states: 238,848 (5)
abstracting: (p_6_1<=0)
states: 629,248 (5)
abstracting: (1<=p_6_0)
states: 306,432 (5)
abstracting: (p_3_0<=1)
states: 823,552 (5)
abstracting: (p_8_2<=1)
states: 823,552 (5)
abstracting: (p_5_1<=p_7_2)
states: 709,888 (5)
abstracting: (p_6_1<=0)
states: 629,248 (5)
abstracting: (r_9_2<=1)
states: 823,552 (5)
abstracting: (1<=r_5_2)
states: 404,992 (5)
abstracting: (p_7_2<=0)
states: 482,688 (5)
abstracting: (1<=r_1_1)
states: 433,920 (5)
abstracting: (1<=r_2_1)
states: 382,976 (5)
abstracting: (r_5_2<=1)
states: 823,552 (5)
abstracting: (1<=p_9_2)
states: 379,264 (5)
abstracting: (p_3_2<=1)
states: 823,552 (5)
abstracting: (p_7_0<=0)
states: 685,824 (5)
abstracting: (p_2_1<=0)
states: 577,280 (5)
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: AG [[~ [[[~ [r_9_2<=r_4_0] & p_0_1<=p_2_0] & [[~ [r_5_0<=1] & 1<=r_4_2] | ~ [[[[p_4_0<=1 | p_4_1<=p_4_2] & p_2_2<=p_2_1] | 1<=r_2_2]]]]] | ~ [[[[[~ [r_0_1<=r_5_2] & r_1_0<=r_9_1] & [p_8_1<=1 & p_5_1<=r_8_1]] | [p_7_0<=p_8_1 | [[p_6_1<=0 | ~ [1<=p_8_0]] | [~ [1<=p_0_2] & [~ [1<=r_7_2] & [r_8_2<=0 & p_8_0<=p_1_2]]]]]] & 1<=p_9_0]]]]
normalized: ~ [E [true U ~ [[~ [[1<=p_9_0 & [[p_7_0<=p_8_1 | [[[[r_8_2<=0 & p_8_0<=p_1_2] & ~ [1<=r_7_2]] & ~ [1<=p_0_2]] | [p_6_1<=0 | ~ [1<=p_8_0]]]] | [[p_8_1<=1 & p_5_1<=r_8_1] & [r_1_0<=r_9_1 & ~ [r_0_1<=r_5_2]]]]]] | ~ [[[~ [[1<=r_2_2 | [p_2_2<=p_2_1 & [p_4_0<=1 | p_4_1<=p_4_2]]]] | [1<=r_4_2 & ~ [r_5_0<=1]]] & [p_0_1<=p_2_0 & ~ [r_9_2<=r_4_0]]]]]]]]
abstracting: (r_9_2<=r_4_0)
states: 590,144 (5)
abstracting: (p_0_1<=p_2_0)
states: 647,232 (5)
abstracting: (r_5_0<=1)
states: 823,552 (5)
abstracting: (1<=r_4_2)
states: 389,120 (5)
abstracting: (p_4_1<=p_4_2)
states: 663,040 (5)
abstracting: (p_4_0<=1)
states: 823,552 (5)
abstracting: (p_2_2<=p_2_1)
states: 754,688 (5)
abstracting: (1<=r_2_2)
states: 379,392 (5)
abstracting: (r_0_1<=r_5_2)
states: 643,072 (5)
abstracting: (r_1_0<=r_9_1)
states: 658,944 (5)
abstracting: (p_5_1<=r_8_1)
states: 704,448 (5)
abstracting: (p_8_1<=1)
states: 823,552 (5)
abstracting: (1<=p_8_0)
states: 257,920 (5)
abstracting: (p_6_1<=0)
states: 629,248 (5)
abstracting: (1<=p_0_2)
states: 238,848 (5)
abstracting: (1<=r_7_2)
states: 417,664 (5)
abstracting: (p_8_0<=p_1_2)
states: 645,888 (5)
abstracting: (r_8_2<=0)
states: 444,288 (5)
abstracting: (p_7_0<=p_8_1)
states: 685,824 (5)
abstracting: (1<=p_9_0)
states: 238,848 (5)
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.014sec
checking: EF [[~ [p_9_2<=r_6_0] | [1<=p_1_0 & [[[[1<=p_0_1 | r_8_2<=1] | [~ [[[p_4_2<=r_3_0 | 1<=r_7_2] | [p_2_2<=0 & 1<=r_0_0]]] & [1<=r_2_0 | [[1<=r_3_0 | r_3_2<=0] | ~ [p_7_2<=r_7_0]]]]] & r_5_2<=0] | [[[p_4_2<=p_6_0 | [p_6_0<=r_8_1 & [~ [1<=r_1_0] | ~ [r_3_2<=p_2_1]]]] | 1<=r_9_0] & [~ [[[~ [1<=p_3_1] | [1<=p_4_1 & 1<=r_3_1]] & [[p_9_1<=r_1_1 & r_7_0<=0] & p_1_2<=0]]] | [r_8_0<=0 & [[[p_6_2<=0 & 1<=p_1_2] | [r_8_1<=r_0_2 & r_2_0<=r_6_1]] | [[1<=p_5_1 & r_4_0<=p_7_2] & [1<=p_3_1 | 1<=r_6_2]]]]]]]]]]
normalized: E [true U [[1<=p_1_0 & [[[[r_8_0<=0 & [[[1<=p_3_1 | 1<=r_6_2] & [1<=p_5_1 & r_4_0<=p_7_2]] | [[r_8_1<=r_0_2 & r_2_0<=r_6_1] | [p_6_2<=0 & 1<=p_1_2]]]] | ~ [[[p_1_2<=0 & [p_9_1<=r_1_1 & r_7_0<=0]] & [[1<=p_4_1 & 1<=r_3_1] | ~ [1<=p_3_1]]]]] & [1<=r_9_0 | [p_4_2<=p_6_0 | [p_6_0<=r_8_1 & [~ [r_3_2<=p_2_1] | ~ [1<=r_1_0]]]]]] | [r_5_2<=0 & [[[1<=r_2_0 | [~ [p_7_2<=r_7_0] | [1<=r_3_0 | r_3_2<=0]]] & ~ [[[p_2_2<=0 & 1<=r_0_0] | [p_4_2<=r_3_0 | 1<=r_7_2]]]] | [1<=p_0_1 | r_8_2<=1]]]]] | ~ [p_9_2<=r_6_0]]]
abstracting: (p_9_2<=r_6_0)
states: 616,512 (5)
abstracting: (r_8_2<=1)
states: 823,552 (5)
abstracting: (1<=p_0_1)
states: 323,840 (5)
abstracting: (1<=r_7_2)
states: 417,664 (5)
abstracting: (p_4_2<=r_3_0)
states: 767,616 (5)
abstracting: (1<=r_0_0)
states: 379,264 (5)
abstracting: (p_2_2<=0)
states: 685,824 (5)
abstracting: (r_3_2<=0)
states: 418,304 (5)
abstracting: (1<=r_3_0)
states: 404,992 (5)
abstracting: (p_7_2<=r_7_0)
states: 656,384 (5)
abstracting: (1<=r_2_0)
states: 386,688 (5)
abstracting: (r_5_2<=0)
states: 418,560 (5)
abstracting: (1<=r_1_0)
states: 417,664 (5)
abstracting: (r_3_2<=p_2_1)
states: 541,824 (5)
abstracting: (p_6_0<=r_8_1)
states: 645,056 (5)
abstracting: (p_4_2<=p_6_0)
states: 761,728 (5)
abstracting: (1<=r_9_0)
states: 584,704 (5)
abstracting: (1<=p_3_1)
states: 194,304 (5)
abstracting: (1<=r_3_1)
states: 412,800 (5)
abstracting: (1<=p_4_1)
states: 216,448 (5)
abstracting: (r_7_0<=0)
states: 395,648 (5)
abstracting: (p_9_1<=r_1_1)
states: 670,976 (5)
abstracting: (p_1_2<=0)
states: 565,632 (5)
abstracting: (1<=p_1_2)
states: 257,920 (5)
abstracting: (p_6_2<=0)
states: 727,552 (5)
abstracting: (r_2_0<=r_6_1)
states: 615,040 (5)
abstracting: (r_8_1<=r_0_2)
states: 608,576 (5)
abstracting: (r_4_0<=p_7_2)
states: 592,192 (5)
abstracting: (1<=p_5_1)
states: 216,448 (5)
abstracting: (1<=r_6_2)
states: 386,688 (5)
abstracting: (1<=p_3_1)
states: 194,304 (5)
abstracting: (r_8_0<=0)
states: 496,768 (5)
abstracting: (1<=p_1_0)
states: 65,024 (4)
-> the formula is TRUE
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.022sec
checking: AG [~ [[[~ [1<=p_9_1] & [[[r_5_2<=1 | r_9_0<=p_5_1] & [[[[r_6_2<=1 | r_6_0<=r_7_2] & [p_9_1<=r_6_0 & r_2_1<=0]] & 1<=r_4_0] & [[~ [p_2_2<=0] | [1<=r_7_0 & p_0_2<=1]] & 1<=r_3_2]]] & [[[[~ [1<=r_0_1] & [1<=p_7_1 & r_9_1<=p_8_0]] | ~ [p_5_0<=r_7_0]] | r_3_0<=1] | ~ [r_4_1<=r_2_2]]]] & [[[~ [[[~ [r_7_1<=0] | ~ [r_1_2<=r_8_0]] | ~ [[1<=p_6_2 & 1<=r_1_2]]]] & r_6_2<=p_2_0] & [[~ [[~ [r_0_0<=0] & [r_4_0<=p_9_2 | r_2_0<=0]]] & ~ [1<=r_4_1]] & [p_3_1<=p_1_2 | 1<=r_3_1]]] & [~ [[~ [1<=r_6_2] | [[r_2_1<=0 & 1<=r_9_1] & 1<=p_4_0]]] | 1<=p_0_1]]]]]
normalized: ~ [E [true U [[[1<=p_0_1 | ~ [[[1<=p_4_0 & [r_2_1<=0 & 1<=r_9_1]] | ~ [1<=r_6_2]]]] & [[[p_3_1<=p_1_2 | 1<=r_3_1] & [~ [1<=r_4_1] & ~ [[[r_4_0<=p_9_2 | r_2_0<=0] & ~ [r_0_0<=0]]]]] & [r_6_2<=p_2_0 & ~ [[~ [[1<=p_6_2 & 1<=r_1_2]] | [~ [r_1_2<=r_8_0] | ~ [r_7_1<=0]]]]]]] & [[[~ [r_4_1<=r_2_2] | [r_3_0<=1 | [~ [p_5_0<=r_7_0] | [[1<=p_7_1 & r_9_1<=p_8_0] & ~ [1<=r_0_1]]]]] & [[[1<=r_3_2 & [[1<=r_7_0 & p_0_2<=1] | ~ [p_2_2<=0]]] & [1<=r_4_0 & [[p_9_1<=r_6_0 & r_2_1<=0] & [r_6_2<=1 | r_6_0<=r_7_2]]]] & [r_5_2<=1 | r_9_0<=p_5_1]]] & ~ [1<=p_9_1]]]]]
abstracting: (1<=p_9_1)
states: 323,840 (5)
abstracting: (r_9_0<=p_5_1)
states: 385,152 (5)
abstracting: (r_5_2<=1)
states: 823,552 (5)
abstracting: (r_6_0<=r_7_2)
states: 635,584 (5)
abstracting: (r_6_2<=1)
states: 823,552 (5)
abstracting: (r_2_1<=0)
states: 440,576 (5)
abstracting: (p_9_1<=r_6_0)
states: 641,792 (5)
abstracting: (1<=r_4_0)
states: 389,120 (5)
abstracting: (p_2_2<=0)
states: 685,824 (5)
abstracting: (p_0_2<=1)
states: 823,552 (5)
abstracting: (1<=r_7_0)
states: 427,904 (5)
abstracting: (1<=r_3_2)
states: 405,248 (5)
abstracting: (1<=r_0_1)
states: 356,352 (5)
abstracting: (r_9_1<=p_8_0)
states: 496,768 (5)
abstracting: (1<=p_7_1)
states: 246,272 (5)
abstracting: (p_5_0<=r_7_0)
states: 757,888 (5)
abstracting: (r_3_0<=1)
states: 823,552 (5)
abstracting: (r_4_1<=r_2_2)
states: 616,896 (5)
abstracting: (r_7_1<=0)
states: 389,632 (5)
abstracting: (r_1_2<=r_8_0)
states: 565,504 (5)
abstracting: (1<=r_1_2)
states: 427,904 (5)
abstracting: (1<=p_6_2)
states: 96,000 (4)
abstracting: (r_6_2<=p_2_0)
states: 595,712 (5)
abstracting: (r_0_0<=0)
states: 444,288 (5)
abstracting: (r_2_0<=0)
states: 436,864 (5)
abstracting: (r_4_0<=p_9_2)
states: 612,672 (5)
abstracting: (1<=r_4_1)
states: 390,656 (5)
abstracting: (1<=r_3_1)
states: 412,800 (5)
abstracting: (p_3_1<=p_1_2)
states: 705,344 (5)
abstracting: (1<=r_6_2)
states: 386,688 (5)
abstracting: (1<=r_9_1)
states: 499,712 (5)
abstracting: (r_2_1<=0)
states: 440,576 (5)
abstracting: (1<=p_4_0)
states: 322,560 (5)
abstracting: (1<=p_0_1)
states: 323,840 (5)
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.013sec
checking: AG [[[[[[1<=r_2_0 | [1<=r_5_2 & [~ [[r_0_2<=r_5_0 & r_9_0<=p_1_1]] & [~ [1<=r_3_0] & [p_3_2<=1 & 1<=r_8_0]]]]] | [~ [[p_4_1<=1 | r_9_1<=r_5_0]] | [[1<=r_7_1 & r_4_2<=r_7_2] | [~ [1<=r_8_1] | [[r_7_1<=r_5_2 & r_9_0<=1] | [p_4_0<=p_3_1 | r_5_0<=1]]]]]] & ~ [r_1_0<=0]] | ~ [[1<=p_4_2 & [[[r_8_2<=r_7_2 & p_5_0<=r_7_2] | [p_5_2<=0 & r_0_0<=0]] & [[r_0_2<=0 | 1<=p_0_1] | ~ [1<=p_5_0]]]]]] | ~ [[[[p_7_2<=0 & [[~ [p_1_2<=p_8_1] | ~ [[p_2_2<=p_6_2 | 1<=p_3_2]]] & p_0_1<=p_9_1]] & [[~ [[p_9_0<=r_3_0 & r_2_2<=p_6_0]] & [r_3_0<=1 & p_2_0<=1]] | ~ [[[r_6_0<=0 | ~ [1<=p_1_0]] | ~ [r_1_0<=1]]]]] & ~ [[[[~ [[1<=p_1_0 | p_2_0<=p_3_2]] | [[p_8_0<=p_9_2 & p_0_2<=p_2_2] & r_2_0<=0]] | 1<=p_0_0] & ~ [[[[p_1_0<=1 | 1<=p_5_1] & [r_6_2<=0 & p_7_2<=0]] | [[p_7_2<=p_5_1 | r_6_2<=1] & ~ [1<=r_0_0]]]]]]]]]]
normalized: ~ [E [true U ~ [[~ [[~ [[~ [[[~ [1<=r_0_0] & [p_7_2<=p_5_1 | r_6_2<=1]] | [[r_6_2<=0 & p_7_2<=0] & [p_1_0<=1 | 1<=p_5_1]]]] & [1<=p_0_0 | [[r_2_0<=0 & [p_8_0<=p_9_2 & p_0_2<=p_2_2]] | ~ [[1<=p_1_0 | p_2_0<=p_3_2]]]]]] & [[~ [[~ [r_1_0<=1] | [r_6_0<=0 | ~ [1<=p_1_0]]]] | [[r_3_0<=1 & p_2_0<=1] & ~ [[p_9_0<=r_3_0 & r_2_2<=p_6_0]]]] & [p_7_2<=0 & [p_0_1<=p_9_1 & [~ [[p_2_2<=p_6_2 | 1<=p_3_2]] | ~ [p_1_2<=p_8_1]]]]]]] | [~ [[1<=p_4_2 & [[~ [1<=p_5_0] | [r_0_2<=0 | 1<=p_0_1]] & [[p_5_2<=0 & r_0_0<=0] | [r_8_2<=r_7_2 & p_5_0<=r_7_2]]]]] | [~ [r_1_0<=0] & [[[[[[p_4_0<=p_3_1 | r_5_0<=1] | [r_7_1<=r_5_2 & r_9_0<=1]] | ~ [1<=r_8_1]] | [1<=r_7_1 & r_4_2<=r_7_2]] | ~ [[p_4_1<=1 | r_9_1<=r_5_0]]] | [1<=r_2_0 | [1<=r_5_2 & [[[p_3_2<=1 & 1<=r_8_0] & ~ [1<=r_3_0]] & ~ [[r_0_2<=r_5_0 & r_9_0<=p_1_1]]]]]]]]]]]]
abstracting: (r_9_0<=p_1_1)
states: 340,096 (5)
abstracting: (r_0_2<=r_5_0)
states: 657,664 (5)
abstracting: (1<=r_3_0)
states: 404,992 (5)
abstracting: (1<=r_8_0)
states: 326,784 (5)
abstracting: (p_3_2<=1)
states: 823,552 (5)
abstracting: (1<=r_5_2)
states: 404,992 (5)
abstracting: (1<=r_2_0)
states: 386,688 (5)
abstracting: (r_9_1<=r_5_0)
states: 566,784 (5)
abstracting: (p_4_1<=1)
states: 823,552 (5)
abstracting: (r_4_2<=r_7_2)
states: 638,976 (5)
abstracting: (1<=r_7_1)
states: 433,920 (5)
abstracting: (1<=r_8_1)
states: 356,352 (5)
abstracting: (r_9_0<=1)
states: 823,552 (5)
abstracting: (r_7_1<=r_5_2)
states: 595,072 (5)
abstracting: (r_5_0<=1)
states: 823,552 (5)
abstracting: (p_4_0<=p_3_1)
states: 560,896 (5)
abstracting: (r_1_0<=0)
states: 405,888 (5)
abstracting: (p_5_0<=r_7_2)
states: 765,184 (5)
abstracting: (r_8_2<=r_7_2)
states: 653,120 (5)
abstracting: (r_0_0<=0)
states: 444,288 (5)
abstracting: (p_5_2<=0)
states: 500,992 (5)
abstracting: (1<=p_0_1)
states: 323,840 (5)
abstracting: (r_0_2<=0)
states: 496,768 (5)
abstracting: (1<=p_5_0)
states: 111,872 (5)
abstracting: (1<=p_4_2)
states: 111,872 (5)
abstracting: (p_1_2<=p_8_1)
states: 609,920 (5)
abstracting: (1<=p_3_2)
states: 306,432 (5)
abstracting: (p_2_2<=p_6_2)
states: 706,304 (5)
abstracting: (p_0_1<=p_9_1)
states: 626,752 (5)
abstracting: (p_7_2<=0)
states: 482,688 (5)
abstracting: (r_2_2<=p_6_0)
states: 586,304 (5)
abstracting: (p_9_0<=r_3_0)
states: 703,744 (5)
abstracting: (p_2_0<=1)
states: 823,552 (5)
abstracting: (r_3_0<=1)
states: 823,552 (5)
abstracting: (1<=p_1_0)
states: 65,024 (4)
abstracting: (r_6_0<=0)
states: 444,160 (5)
abstracting: (r_1_0<=1)
states: 823,552 (5)
abstracting: (p_2_0<=p_3_2)
states: 601,664 (5)
abstracting: (1<=p_1_0)
states: 65,024 (4)
abstracting: (p_0_2<=p_2_2)
states: 653,568 (5)
abstracting: (p_8_0<=p_9_2)
states: 678,336 (5)
abstracting: (r_2_0<=0)
states: 436,864 (5)
abstracting: (1<=p_0_0)
states: 379,264 (5)
abstracting: (1<=p_5_1)
states: 216,448 (5)
abstracting: (p_1_0<=1)
states: 823,552 (5)
abstracting: (p_7_2<=0)
states: 482,688 (5)
abstracting: (r_6_2<=0)
states: 436,864 (5)
abstracting: (r_6_2<=1)
states: 823,552 (5)
abstracting: (p_7_2<=p_5_1)
states: 585,472 (5)
abstracting: (1<=r_0_0)
states: 379,264 (5)
-> the formula is FALSE
FORMULA ResAllocation-PT-R003C010-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.033sec
totally nodes used: 114997 (1.1e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 34374 204608 238982
used/not used/entry size/cache size: 265895 66842969 16 1024MB
basic ops cache: hits/miss/sum: 27716 151494 179210
used/not used/entry size/cache size: 305172 16472044 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: 3916 18728 22644
used/not used/entry size/cache size: 18728 8369880 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 66997534
1 107843
2 3313
3 168
4 6
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 4.429sec
BK_STOP 1679180836685
--------------------
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:306 (7), effective:60 (1)
initing FirstDep: 0m 0.000sec
iterations count:75 (1), effective:5 (0)
iterations count:92 (2), effective:9 (0)
iterations count:310 (7), effective:40 (1)
iterations count:122 (3), effective:16 (0)
iterations count:59 (1), effective:2 (0)
iterations count:259 (6), effective:36 (0)
iterations count:146 (3), effective:20 (0)
iterations count:311 (7), effective:46 (1)
iterations count:305 (7), effective:51 (1)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ResAllocation-PT-R003C010"
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 ResAllocation-PT-R003C010, 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 r330-tall-167889203600694"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C010.tgz
mv ResAllocation-PT-R003C010 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 ;