About the Execution of Marcie+red for ShieldIIPt-PT-100A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
10155.619 | 3600000.00 | 3677694.00 | 126.10 | TF?TTTTTTT?FF?TT | 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.r394-oct2-167903717800343.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldIIPt-PT-100A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717800343
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.8K Feb 25 19:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 19:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 18:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 18:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 21:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 19:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Feb 25 19:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 539K 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 ShieldIIPt-PT-100A-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-100A-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1679506552260
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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-100A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 17:35:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 17:35:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 17:35:54] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2023-03-22 17:35:54] [INFO ] Transformed 1903 places.
[2023-03-22 17:35:54] [INFO ] Transformed 1403 transitions.
[2023-03-22 17:35:54] [INFO ] Found NUPN structural information;
[2023-03-22 17:35:54] [INFO ] Parsed PT model containing 1903 places and 1403 transitions and 6006 arcs in 251 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 570 ms. (steps per millisecond=17 ) properties (out of 16) seen :4
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 1402 rows 1903 cols
[2023-03-22 17:35:57] [INFO ] Computed 901 place invariants in 20 ms
[2023-03-22 17:35:58] [INFO ] After 1137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-22 17:35:59] [INFO ] [Nat]Absence check using 901 positive place invariants in 284 ms returned sat
[2023-03-22 17:36:08] [INFO ] After 7799ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-22 17:36:15] [INFO ] After 14996ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 4914 ms.
[2023-03-22 17:36:20] [INFO ] After 21802ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 4583 ms.
Support contains 440 out of 1903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1903/1903 places, 1402/1402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1903 transition count 1401
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1902 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1901 transition count 1400
Partial Free-agglomeration rule applied 132 times.
Drop transitions removed 132 transitions
Iterating global reduction 0 with 132 rules applied. Total rules applied 136 place count 1901 transition count 1400
Applied a total of 136 rules in 588 ms. Remains 1901 /1903 variables (removed 2) and now considering 1400/1402 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 589 ms. Remains : 1901/1903 places, 1400/1402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 176513 steps, run timeout after 6003 ms. (steps per millisecond=29 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 11=1}
Probabilistic random walk after 176513 steps, saw 174431 distinct states, run finished after 6004 ms. (steps per millisecond=29 ) properties seen :9
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-100A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2023-03-22 17:36:33] [INFO ] Computed 901 place invariants in 17 ms
[2023-03-22 17:36:34] [INFO ] After 540ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 17:36:35] [INFO ] [Nat]Absence check using 901 positive place invariants in 234 ms returned sat
[2023-03-22 17:36:38] [INFO ] After 2764ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 17:36:38] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-22 17:36:40] [INFO ] After 2195ms SMT Verify possible using 62 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 17:36:43] [INFO ] After 4936ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2276 ms.
[2023-03-22 17:36:45] [INFO ] After 10878ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 707 ms.
Support contains 275 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 1901 transition count 1400
Applied a total of 28 rules in 173 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 1901/1901 places, 1400/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 123731 steps, run timeout after 3002 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 123731 steps, saw 121882 distinct states, run finished after 3004 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1400 rows 1901 cols
[2023-03-22 17:36:49] [INFO ] Computed 901 place invariants in 12 ms
[2023-03-22 17:36:50] [INFO ] After 431ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 17:36:51] [INFO ] [Nat]Absence check using 901 positive place invariants in 213 ms returned sat
[2023-03-22 17:36:53] [INFO ] After 2750ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 17:36:53] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-22 17:36:56] [INFO ] After 2367ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 17:37:01] [INFO ] After 7966ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3024 ms.
[2023-03-22 17:37:04] [INFO ] After 14566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 820 ms.
Support contains 275 out of 1901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 62 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 1901/1901 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1901/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 60 ms. Remains 1901 /1901 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2023-03-22 17:37:05] [INFO ] Invariant cache hit.
[2023-03-22 17:37:08] [INFO ] Implicit Places using invariants in 2410 ms returned [1893, 1894]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2429 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1899/1901 places, 1400/1400 transitions.
Applied a total of 0 rules in 48 ms. Remains 1899 /1899 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2539 ms. Remains : 1899/1901 places, 1400/1400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 113128 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113128 steps, saw 111513 distinct states, run finished after 3002 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1400 rows 1899 cols
[2023-03-22 17:37:12] [INFO ] Computed 899 place invariants in 11 ms
[2023-03-22 17:37:12] [INFO ] After 556ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 17:37:13] [INFO ] [Nat]Absence check using 899 positive place invariants in 233 ms returned sat
[2023-03-22 17:37:16] [INFO ] After 3005ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 17:37:16] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-22 17:37:18] [INFO ] After 2477ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 17:37:23] [INFO ] After 6558ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2469 ms.
[2023-03-22 17:37:25] [INFO ] After 12805ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1050 ms.
Support contains 275 out of 1899 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1400/1400 transitions.
Applied a total of 0 rules in 48 ms. Remains 1899 /1899 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 1899/1899 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1899/1899 places, 1400/1400 transitions.
Applied a total of 0 rules in 46 ms. Remains 1899 /1899 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2023-03-22 17:37:26] [INFO ] Invariant cache hit.
[2023-03-22 17:37:28] [INFO ] Implicit Places using invariants in 1715 ms returned []
[2023-03-22 17:37:28] [INFO ] Invariant cache hit.
[2023-03-22 17:37:29] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-22 17:37:33] [INFO ] Implicit Places using invariants and state equation in 5274 ms returned []
Implicit Place search using SMT with State Equation took 7016 ms to find 0 implicit places.
[2023-03-22 17:37:33] [INFO ] Redundant transitions in 117 ms returned []
[2023-03-22 17:37:33] [INFO ] Invariant cache hit.
[2023-03-22 17:37:35] [INFO ] Dead Transitions using invariants and state equation in 1264 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8452 ms. Remains : 1899/1899 places, 1400/1400 transitions.
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 62 place count 1899 transition count 1400
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 1899 transition count 1338
Applied a total of 124 rules in 162 ms. Remains 1899 /1899 variables (removed 0) and now considering 1338/1400 (removed 62) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1338 rows 1899 cols
[2023-03-22 17:37:35] [INFO ] Computed 899 place invariants in 4 ms
[2023-03-22 17:37:35] [INFO ] After 357ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 17:37:36] [INFO ] [Nat]Absence check using 899 positive place invariants in 173 ms returned sat
[2023-03-22 17:37:39] [INFO ] After 2867ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 17:37:41] [INFO ] After 5099ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2219 ms.
[2023-03-22 17:37:43] [INFO ] After 7966ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-22 17:37:43] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-22 17:37:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1899 places, 1400 transitions and 6397 arcs took 11 ms.
[2023-03-22 17:37:44] [INFO ] Flatten gal took : 254 ms
Total runtime 109545 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: ShieldIIPt_PT_100A
(NrP: 1899 NrTr: 1400 NrArc: 6397)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.267sec
net check time: 0m 0.000sec
init dd package: 0m 2.942sec
before gc: list nodes free: 485675
after gc: idd nodes used:67012, unused:63932988; list nodes free:286967193
before gc: list nodes free: 1495900
after gc: idd nodes used:88024, unused:63911976; list nodes free:288961551
before gc: list nodes free: 1253903
after gc: idd nodes used:115752, unused:63884248; list nodes free:288826035
before gc: list nodes free: 1352412
after gc: idd nodes used:119504, unused:63880496; list nodes free:288797729
before gc: list nodes free: 864559
after gc: idd nodes used:158896, unused:63841104; list nodes free:288629809
before gc: list nodes free: 607604
after gc: idd nodes used:157784, unused:63842216; list nodes free:288635189
before gc: list nodes free: 936369
after gc: idd nodes used:158816, unused:63841184; list nodes free:288633385
before gc: list nodes free: 2060370
after gc: idd nodes used:277648, unused:63722352; list nodes free:290130660
before gc: list nodes free: 2161750
after gc: idd nodes used:309200, unused:63690800; list nodes free:289926600
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 5990876 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095728 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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 ReachabilityFireability -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.007sec
241098
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="ShieldIIPt-PT-100A"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldIIPt-PT-100A, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r394-oct2-167903717800343"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-100A.tgz
mv ShieldIIPt-PT-100A execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;