About the Execution of Marcie+red for ShieldIIPt-PT-100B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
9828.920 | 3600000.00 | 3664714.00 | 104.90 | ?TTF?F?T??????FT | 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-167903717800350.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-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717800350
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.5K Feb 25 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 17: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.9K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 8.7K Feb 25 17:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 17:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 25 17:13 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 1.7M 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-100B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679507617150
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=ShieldIIPt-PT-100B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 17:53:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 17:53:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 17:53:39] [INFO ] Load time of PNML (sax parser for PT used): 248 ms
[2023-03-22 17:53:40] [INFO ] Transformed 7003 places.
[2023-03-22 17:53:40] [INFO ] Transformed 6503 transitions.
[2023-03-22 17:53:40] [INFO ] Found NUPN structural information;
[2023-03-22 17:53:40] [INFO ] Parsed PT model containing 7003 places and 6503 transitions and 16206 arcs in 600 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 626 ms. (steps per millisecond=15 ) properties (out of 13) seen :3
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 6503 rows 7003 cols
[2023-03-22 17:53:41] [INFO ] Computed 901 place invariants in 110 ms
[2023-03-22 17:53:44] [INFO ] After 2842ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-22 17:53:47] [INFO ] [Nat]Absence check using 901 positive place invariants in 757 ms returned sat
[2023-03-22 17:54:09] [INFO ] After 20464ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-22 17:54:09] [INFO ] After 20482ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-22 17:54:09] [INFO ] After 25074ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
FORMULA ShieldIIPt-PT-100B-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 74 out of 7003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Drop transitions removed 1650 transitions
Trivial Post-agglo rules discarded 1650 transitions
Performed 1650 trivial Post agglomeration. Transition count delta: 1650
Iterating post reduction 0 with 1650 rules applied. Total rules applied 1650 place count 7003 transition count 4853
Reduce places removed 1650 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1652 rules applied. Total rules applied 3302 place count 5353 transition count 4851
Reduce places removed 1 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 2 with 22 rules applied. Total rules applied 3324 place count 5352 transition count 4830
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 3345 place count 5331 transition count 4830
Performed 398 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 398 Pre rules applied. Total rules applied 3345 place count 5331 transition count 4432
Deduced a syphon composed of 398 places in 26 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 4 with 796 rules applied. Total rules applied 4141 place count 4933 transition count 4432
Discarding 681 places :
Symmetric choice reduction at 4 with 681 rule applications. Total rules 4822 place count 4252 transition count 3751
Iterating global reduction 4 with 681 rules applied. Total rules applied 5503 place count 4252 transition count 3751
Performed 282 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 282 Pre rules applied. Total rules applied 5503 place count 4252 transition count 3469
Deduced a syphon composed of 282 places in 42 ms
Reduce places removed 282 places and 0 transitions.
Iterating global reduction 4 with 564 rules applied. Total rules applied 6067 place count 3970 transition count 3469
Performed 1674 Post agglomeration using F-continuation condition.Transition count delta: 1674
Deduced a syphon composed of 1674 places in 7 ms
Reduce places removed 1674 places and 0 transitions.
Iterating global reduction 4 with 3348 rules applied. Total rules applied 9415 place count 2296 transition count 1795
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 101 places in 7 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 9617 place count 2195 transition count 1853
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 9819 place count 2094 transition count 1919
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 83 places in 7 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 9985 place count 2011 transition count 1971
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 9986 place count 2011 transition count 1970
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 9990 place count 2011 transition count 1966
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 9994 place count 2007 transition count 1966
Partial Free-agglomeration rule applied 98 times.
Drop transitions removed 98 transitions
Iterating global reduction 6 with 98 rules applied. Total rules applied 10092 place count 2007 transition count 1966
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 10093 place count 2006 transition count 1965
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 10094 place count 2005 transition count 1965
Applied a total of 10094 rules in 2486 ms. Remains 2005 /7003 variables (removed 4998) and now considering 1965/6503 (removed 4538) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2488 ms. Remains : 2005/7003 places, 1965/6503 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 57801 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57801 steps, saw 37950 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1965 rows 2005 cols
[2023-03-22 17:54:16] [INFO ] Computed 900 place invariants in 6 ms
[2023-03-22 17:54:17] [INFO ] After 683ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 17:54:18] [INFO ] [Nat]Absence check using 900 positive place invariants in 254 ms returned sat
[2023-03-22 17:54:20] [INFO ] After 2163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 17:54:20] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-22 17:54:23] [INFO ] After 2633ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-22 17:54:23] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 5 ms to minimize.
[2023-03-22 17:54:24] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 1 ms to minimize.
[2023-03-22 17:54:24] [INFO ] Deduced a trap composed of 5 places in 366 ms of which 1 ms to minimize.
[2023-03-22 17:54:24] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 1 ms to minimize.
[2023-03-22 17:54:25] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 24 ms to minimize.
[2023-03-22 17:54:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1537 ms
[2023-03-22 17:54:26] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 1 ms to minimize.
[2023-03-22 17:54:26] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 1 ms to minimize.
[2023-03-22 17:54:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1252 ms
[2023-03-22 17:54:27] [INFO ] Deduced a trap composed of 5 places in 330 ms of which 1 ms to minimize.
[2023-03-22 17:54:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 497 ms
[2023-03-22 17:54:29] [INFO ] After 8022ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 2888 ms.
[2023-03-22 17:54:31] [INFO ] After 14396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 946 ms.
Support contains 74 out of 2005 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2005/2005 places, 1965/1965 transitions.
Applied a total of 0 rules in 58 ms. Remains 2005 /2005 variables (removed 0) and now considering 1965/1965 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 2005/2005 places, 1965/1965 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2005/2005 places, 1965/1965 transitions.
Applied a total of 0 rules in 55 ms. Remains 2005 /2005 variables (removed 0) and now considering 1965/1965 (removed 0) transitions.
[2023-03-22 17:54:32] [INFO ] Invariant cache hit.
[2023-03-22 17:54:34] [INFO ] Implicit Places using invariants in 1785 ms returned []
[2023-03-22 17:54:34] [INFO ] Invariant cache hit.
[2023-03-22 17:54:35] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-22 17:54:40] [INFO ] Implicit Places using invariants and state equation in 5918 ms returned []
Implicit Place search using SMT with State Equation took 7712 ms to find 0 implicit places.
[2023-03-22 17:54:40] [INFO ] Redundant transitions in 131 ms returned []
[2023-03-22 17:54:40] [INFO ] Invariant cache hit.
[2023-03-22 17:54:42] [INFO ] Dead Transitions using invariants and state equation in 1393 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9302 ms. Remains : 2005/2005 places, 1965/1965 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 2005 transition count 1964
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2004 transition count 1964
Partial Free-agglomeration rule applied 257 times.
Drop transitions removed 257 transitions
Iterating global reduction 0 with 257 rules applied. Total rules applied 259 place count 2004 transition count 1964
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 260 place count 2004 transition count 1963
Applied a total of 260 rules in 212 ms. Remains 2004 /2005 variables (removed 1) and now considering 1963/1965 (removed 2) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 1963 rows 2004 cols
[2023-03-22 17:54:42] [INFO ] Computed 900 place invariants in 4 ms
[2023-03-22 17:54:43] [INFO ] After 743ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 17:54:43] [INFO ] [Nat]Absence check using 900 positive place invariants in 206 ms returned sat
[2023-03-22 17:54:46] [INFO ] After 1918ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 17:54:46] [INFO ] State equation strengthened by 239 read => feed constraints.
[2023-03-22 17:54:47] [INFO ] After 1352ms SMT Verify possible using 239 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-22 17:54:48] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 1 ms to minimize.
[2023-03-22 17:54:48] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 0 ms to minimize.
[2023-03-22 17:54:48] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 1 ms to minimize.
[2023-03-22 17:54:49] [INFO ] Deduced a trap composed of 3 places in 208 ms of which 1 ms to minimize.
[2023-03-22 17:54:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1482 ms
[2023-03-22 17:54:49] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 1 ms to minimize.
[2023-03-22 17:54:50] [INFO ] Deduced a trap composed of 5 places in 256 ms of which 3 ms to minimize.
[2023-03-22 17:54:50] [INFO ] Deduced a trap composed of 3 places in 220 ms of which 1 ms to minimize.
[2023-03-22 17:54:50] [INFO ] Deduced a trap composed of 3 places in 228 ms of which 1 ms to minimize.
[2023-03-22 17:54:51] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 0 ms to minimize.
[2023-03-22 17:54:51] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 0 ms to minimize.
[2023-03-22 17:54:51] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 0 ms to minimize.
[2023-03-22 17:54:52] [INFO ] Deduced a trap composed of 5 places in 293 ms of which 1 ms to minimize.
[2023-03-22 17:54:52] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 1 ms to minimize.
[2023-03-22 17:54:52] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 1 ms to minimize.
[2023-03-22 17:54:53] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 13 ms to minimize.
[2023-03-22 17:54:53] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 0 ms to minimize.
[2023-03-22 17:54:53] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4107 ms
[2023-03-22 17:54:54] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 1 ms to minimize.
[2023-03-22 17:54:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 409 ms
[2023-03-22 17:54:55] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 1 ms to minimize.
[2023-03-22 17:54:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 413 ms
[2023-03-22 17:54:56] [INFO ] After 9730ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1461 ms.
[2023-03-22 17:54:57] [INFO ] After 14269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2023-03-22 17:54:57] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-22 17:54:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2005 places, 1965 transitions and 9592 arcs took 17 ms.
[2023-03-22 17:54:58] [INFO ] Flatten gal took : 207 ms
Total runtime 78381 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=ReachabilityCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: ShieldIIPt_PT_100B
(NrP: 2005 NrTr: 1965 NrArc: 9592)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.417sec
net check time: 0m 0.001sec
init dd package: 0m 2.826sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6317568 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095400 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 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.022sec
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-100B"
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 ShieldIIPt-PT-100B, 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 r394-oct2-167903717800350"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-100B.tgz
mv ShieldIIPt-PT-100B 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 ;