About the Execution of Smart+red for ResAllocation-PT-R003C020
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
426.363 | 16649.00 | 24768.00 | 646.10 | TFTFTTFFFFFFTFFT | 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.r331-tall-167889204800710.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 smartxred
Input is ResAllocation-PT-R003C020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r331-tall-167889204800710
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 6.0K Feb 25 15:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 15:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 15:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 15:23 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 3.8K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 15K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 25 15:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 203K Feb 25 15:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 15:25 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 143K 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-R003C020-ReachabilityCardinality-00
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-01
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-02
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-03
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-04
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-05
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-06
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-07
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-08
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-09
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-10
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-11
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-12
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-13
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-14
FORMULA_NAME ResAllocation-PT-R003C020-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679158619073
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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResAllocation-PT-R003C020
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-18 16:57:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 16:57:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 16:57:00] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-18 16:57:00] [INFO ] Transformed 120 places.
[2023-03-18 16:57:00] [INFO ] Transformed 80 transitions.
[2023-03-18 16:57:00] [INFO ] Parsed PT model containing 120 places and 80 transitions and 354 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 225 resets, run finished after 528 ms. (steps per millisecond=18 ) properties (out of 15) seen :5
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 80 rows 120 cols
[2023-03-18 16:57:02] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-18 16:57:02] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-18 16:57:02] [INFO ] [Nat]Absence check using 60 positive place invariants in 10 ms returned sat
[2023-03-18 16:57:02] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :1
[2023-03-18 16:57:02] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 7 ms to minimize.
[2023-03-18 16:57:02] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2023-03-18 16:57:02] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2023-03-18 16:57:02] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
[2023-03-18 16:57:02] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-18 16:57:02] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-18 16:57:02] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2023-03-18 16:57:02] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2023-03-18 16:57:03] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2023-03-18 16:57:03] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2023-03-18 16:57:03] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2023-03-18 16:57:03] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 410 ms
[2023-03-18 16:57:03] [INFO ] After 525ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-18 16:57:03] [INFO ] After 684ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :1
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 62 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 80/80 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 119 transition count 79
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 119 transition count 76
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 9 place count 115 transition count 76
Applied a total of 9 rules in 20 ms. Remains 115 /120 variables (removed 5) and now considering 76/80 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 115/120 places, 76/80 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1824312 steps, run timeout after 3001 ms. (steps per millisecond=607 ) properties seen :{}
Probabilistic random walk after 1824312 steps, saw 239975 distinct states, run finished after 3002 ms. (steps per millisecond=607 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 76 rows 115 cols
[2023-03-18 16:57:06] [INFO ] Computed 59 place invariants in 6 ms
[2023-03-18 16:57:06] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 16:57:06] [INFO ] [Nat]Absence check using 59 positive place invariants in 6 ms returned sat
[2023-03-18 16:57:06] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 16:57:06] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-18 16:57:06] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 62 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 76/76 transitions.
Applied a total of 0 rules in 6 ms. Remains 115 /115 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 115/115 places, 76/76 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 76/76 transitions.
Applied a total of 0 rules in 5 ms. Remains 115 /115 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2023-03-18 16:57:06] [INFO ] Invariant cache hit.
[2023-03-18 16:57:06] [INFO ] Implicit Places using invariants in 54 ms returned [114]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 114/115 places, 76/76 transitions.
Applied a total of 0 rules in 5 ms. Remains 114 /114 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 67 ms. Remains : 114/115 places, 76/76 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1982567 steps, run timeout after 3001 ms. (steps per millisecond=660 ) properties seen :{}
Probabilistic random walk after 1982567 steps, saw 263306 distinct states, run finished after 3001 ms. (steps per millisecond=660 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 76 rows 114 cols
[2023-03-18 16:57:09] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-18 16:57:09] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 16:57:09] [INFO ] [Nat]Absence check using 58 positive place invariants in 6 ms returned sat
[2023-03-18 16:57:09] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 16:57:09] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-18 16:57:09] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 62 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 76/76 transitions.
Applied a total of 0 rules in 10 ms. Remains 114 /114 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 114/114 places, 76/76 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 76/76 transitions.
Applied a total of 0 rules in 5 ms. Remains 114 /114 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2023-03-18 16:57:09] [INFO ] Invariant cache hit.
[2023-03-18 16:57:09] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-18 16:57:09] [INFO ] Invariant cache hit.
[2023-03-18 16:57:10] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2023-03-18 16:57:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 16:57:10] [INFO ] Invariant cache hit.
[2023-03-18 16:57:10] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 267 ms. Remains : 114/114 places, 76/76 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 76
Applied a total of 1 rules in 4 ms. Remains 113 /114 variables (removed 1) and now considering 76/76 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 76 rows 113 cols
[2023-03-18 16:57:10] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-18 16:57:10] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 16:57:10] [INFO ] [Nat]Absence check using 57 positive place invariants in 6 ms returned sat
[2023-03-18 16:57:10] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 16:57:10] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2023-03-18 16:57:10] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2023-03-18 16:57:10] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2023-03-18 16:57:10] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2023-03-18 16:57:10] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2023-03-18 16:57:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 159 ms
[2023-03-18 16:57:10] [INFO ] After 290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-18 16:57:10] [INFO ] After 377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-18 16:57:10] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-18 16:57:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 114 places, 76 transitions and 340 arcs took 1 ms.
[2023-03-18 16:57:10] [INFO ] Flatten gal took : 49 ms
Total runtime 10061 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ResAllocation (PT), instance R003C020
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart
GOT IT HERE. BS
Petri model created: 114 places, 76 transitions, 340 arcs.
Final Score: 523.532
Took : 2 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ResAllocation-PT-R003C020-ReachabilityCardinality-10 (reachable &!potential( ( ( ( ( (! ( (tk(P9)) <= (tk(P52)) )) | (! ( (tk(P71)) <= (tk(P50)) )) ) | ( ( (tk(P9)) <= ( 0 ) ) | (! ( (tk(P86)) <= ( 1 ) )) ) ) | ( ( ( (tk(P90)) <= (tk(P28)) ) | ( (tk(P52)) <= (tk(P58)) ) ) | ( (! ( (tk(P3)) <= ( 0 ) )) | ( (! ( (tk(P46)) <= ( 1 ) )) | ( ( 1 ) <= (tk(P58)) ) ) ) ) ) | ( ( ( ( (! ( (tk(P83)) <= (tk(P65)) )) & ( (! ( (tk(P96)) <= (tk(P34)) )) & ( ( ( (tk(P43)) <= ( 1 ) ) | ( (tk(P113)) <= (tk(P28)) ) ) | ( ( ( 1 ) <= (tk(P113)) ) | ( ( (tk(P7)) <= ( 1 ) ) | ( (! ( (tk(P89)) <= ( 0 ) )) & ( (! ( (tk(P71)) <= ( 1 ) )) & ( (! ( (tk(P91)) <= (tk(P11)) )) | (! ( (tk(P59)) <= ( 1 ) )) ) ) ) ) ) ) ) ) | ( ( ( ( 1 ) <= (tk(P55)) ) | ( (! ( (tk(P35)) <= ( 1 ) )) & ( ( (! ( (tk(P91)) <= (tk(P64)) )) & ( ( (tk(P14)) <= (tk(P11)) ) | ( ( 1 ) <= (tk(P33)) ) ) ) | ( ( (tk(P60)) <= ( 0 ) ) & ( ( (tk(P67)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P32)) ) ) ) ) ) ) & ( ( (! ( (tk(P56)) <= ( 1 ) )) | (! ( (tk(P94)) <= (tk(P110)) )) ) | ( ( ( ( 1 ) <= (tk(P23)) ) & ( ( (tk(P104)) <= ( 0 ) ) | ( (tk(P31)) <= (tk(P113)) ) ) ) | ( ( ( ( (tk(P6)) <= ( 0 ) ) | ( (tk(P65)) <= ( 1 ) ) ) & ( (! ( ( 1 ) <= (tk(P106)) )) | (! ( (tk(P111)) <= (tk(P92)) )) ) ) | ( ( ( ( 1 ) <= (tk(P1)) ) & ( (! ( (tk(P73)) <= ( 1 ) )) & (! ( (tk(P24)) <= (tk(P7)) )) ) ) & ( ( (! ( (tk(P28)) <= (tk(P40)) )) & ( (tk(P8)) <= (tk(P16)) ) ) & ( ( (tk(P15)) <= ( 0 ) ) & (! ( ( 1 ) <= (tk(P107)) )) ) ) ) ) ) ) ) ) | ( ( (! ( (tk(P74)) <= ( 0 ) )) & ( ( ( 1 ) <= (tk(P11)) ) | ( ( 1 ) <= (tk(P32)) ) ) ) | ( ( (! ( (tk(P81)) <= ( 0 ) )) | (! ( (tk(P24)) <= ( 0 ) )) ) & ( ( (tk(P31)) <= (tk(P18)) ) | ( (tk(P99)) <= ( 1 ) ) ) ) ) ) | ( ( ( (! ( (tk(P76)) <= ( 0 ) )) & ( ( ( 1 ) <= (tk(P87)) ) | ( (tk(P107)) <= (tk(P22)) ) ) ) | ( (! ( ( 1 ) <= (tk(P112)) )) & (! ( (tk(P49)) <= (tk(P7)) )) ) ) | ( ( ( ( 1 ) <= (tk(P46)) ) & (! ( ( 1 ) <= (tk(P74)) )) ) | ( ( (! ( (tk(P114)) <= ( 0 ) )) & ( ( (! ( ( 1 ) <= (tk(P67)) )) | ( (tk(P22)) <= (tk(P75)) ) ) & ( (! ( ( 1 ) <= (tk(P17)) )) | ( (! ( (tk(P48)) <= (tk(P87)) )) & (! ( (tk(P89)) <= ( 1 ) )) ) ) ) ) | ( (! ( ( 1 ) <= (tk(P82)) )) & ( (tk(P59)) <= (tk(P47)) ) ) ) ) ) ) )))
FORMULA ResAllocation-PT-R003C020-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
BK_STOP 1679158635722
--------------------
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
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-R003C020"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is ResAllocation-PT-R003C020, 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 r331-tall-167889204800710"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C020.tgz
mv ResAllocation-PT-R003C020 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 ;