fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r394-oct2-167903717700295
Last Updated
May 14, 2023

About the Execution of Marcie+red for ShieldIIPt-PT-030A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10150.260 3600000.00 3663046.00 117.10 FTFTTTFF?TTTTTTF 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-167903717700295.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-030A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717700295
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.5K Feb 25 17:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 17:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 17:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 17:13 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.5K 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 7.7K Feb 25 18:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 18:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 17:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 17:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 159K 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-030A-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-030A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679501868290

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-030A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 16:17:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 16:17:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 16:17:51] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2023-03-22 16:17:51] [INFO ] Transformed 573 places.
[2023-03-22 16:17:51] [INFO ] Transformed 423 transitions.
[2023-03-22 16:17:51] [INFO ] Found NUPN structural information;
[2023-03-22 16:17:51] [INFO ] Parsed PT model containing 573 places and 423 transitions and 1806 arcs in 253 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 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 517 ms. (steps per millisecond=19 ) properties (out of 16) seen :4
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :1
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 422 rows 573 cols
[2023-03-22 16:17:52] [INFO ] Computed 271 place invariants in 10 ms
[2023-03-22 16:17:52] [INFO ] After 405ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 16:17:53] [INFO ] [Nat]Absence check using 271 positive place invariants in 74 ms returned sat
[2023-03-22 16:17:54] [INFO ] After 1071ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-22 16:17:55] [INFO ] After 2306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 660 ms.
[2023-03-22 16:17:56] [INFO ] After 3553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 795 ms.
Support contains 63 out of 573 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 422/422 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 573 transition count 421
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 572 transition count 421
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 571 transition count 420
Partial Free-agglomeration rule applied 45 times.
Drop transitions removed 45 transitions
Iterating global reduction 0 with 45 rules applied. Total rules applied 49 place count 571 transition count 420
Applied a total of 49 rules in 104 ms. Remains 571 /573 variables (removed 2) and now considering 420/422 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 571/573 places, 420/422 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 346669 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{0=1, 1=1, 2=1, 3=1, 5=1}
Probabilistic random walk after 346669 steps, saw 333469 distinct states, run finished after 3003 ms. (steps per millisecond=115 ) properties seen :5
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-030A-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 420 rows 571 cols
[2023-03-22 16:18:00] [INFO ] Computed 271 place invariants in 9 ms
[2023-03-22 16:18:01] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 16:18:01] [INFO ] [Nat]Absence check using 271 positive place invariants in 45 ms returned sat
[2023-03-22 16:18:01] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 16:18:01] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-22 16:18:01] [INFO ] After 156ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 16:18:01] [INFO ] After 272ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-22 16:18:01] [INFO ] After 826ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 23 ms.
Support contains 29 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 420/420 transitions.
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 571 transition count 420
Applied a total of 6 rules in 40 ms. Remains 571 /571 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 571/571 places, 420/420 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 411343 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :{}
Probabilistic random walk after 411343 steps, saw 393903 distinct states, run finished after 3004 ms. (steps per millisecond=136 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 420 rows 571 cols
[2023-03-22 16:18:05] [INFO ] Computed 271 place invariants in 7 ms
[2023-03-22 16:18:05] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 16:18:05] [INFO ] [Nat]Absence check using 271 positive place invariants in 35 ms returned sat
[2023-03-22 16:18:05] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 16:18:05] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-22 16:18:05] [INFO ] After 113ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 16:18:05] [INFO ] After 220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-22 16:18:06] [INFO ] After 717ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 29 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 420/420 transitions.
Applied a total of 0 rules in 21 ms. Remains 571 /571 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 571/571 places, 420/420 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 420/420 transitions.
Applied a total of 0 rules in 18 ms. Remains 571 /571 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2023-03-22 16:18:06] [INFO ] Invariant cache hit.
[2023-03-22 16:18:06] [INFO ] Implicit Places using invariants in 434 ms returned [563, 564]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 440 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 569/571 places, 420/420 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 569 transition count 419
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 568 transition count 419
Applied a total of 2 rules in 28 ms. Remains 568 /569 variables (removed 1) and now considering 419/420 (removed 1) transitions.
// Phase 1: matrix 419 rows 568 cols
[2023-03-22 16:18:06] [INFO ] Computed 269 place invariants in 4 ms
[2023-03-22 16:18:06] [INFO ] Implicit Places using invariants in 352 ms returned [557]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 354 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 567/571 places, 419/420 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 566 transition count 418
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 566 transition count 418
Applied a total of 2 rules in 46 ms. Remains 566 /567 variables (removed 1) and now considering 418/419 (removed 1) transitions.
// Phase 1: matrix 418 rows 566 cols
[2023-03-22 16:18:07] [INFO ] Computed 268 place invariants in 3 ms
[2023-03-22 16:18:07] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-22 16:18:07] [INFO ] Invariant cache hit.
[2023-03-22 16:18:07] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-22 16:18:08] [INFO ] Implicit Places using invariants and state equation in 830 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 566/571 places, 418/420 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2062 ms. Remains : 566/571 places, 418/420 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 456234 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 456234 steps, saw 435950 distinct states, run finished after 3002 ms. (steps per millisecond=151 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 16:18:11] [INFO ] Invariant cache hit.
[2023-03-22 16:18:11] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 16:18:11] [INFO ] [Nat]Absence check using 268 positive place invariants in 41 ms returned sat
[2023-03-22 16:18:11] [INFO ] After 350ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 16:18:11] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-22 16:18:12] [INFO ] After 125ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 16:18:12] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-22 16:18:12] [INFO ] After 782ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 63 ms.
Support contains 29 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 418/418 transitions.
Applied a total of 0 rules in 17 ms. Remains 566 /566 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 566/566 places, 418/418 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 418/418 transitions.
Applied a total of 0 rules in 16 ms. Remains 566 /566 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2023-03-22 16:18:12] [INFO ] Invariant cache hit.
[2023-03-22 16:18:12] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-22 16:18:12] [INFO ] Invariant cache hit.
[2023-03-22 16:18:12] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-22 16:18:13] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
[2023-03-22 16:18:13] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-22 16:18:13] [INFO ] Invariant cache hit.
[2023-03-22 16:18:13] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1425 ms. Remains : 566/566 places, 418/418 transitions.
Partial Free-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 566 transition count 418
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 566 transition count 392
Applied a total of 52 rules in 43 ms. Remains 566 /566 variables (removed 0) and now considering 392/418 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 392 rows 566 cols
[2023-03-22 16:18:13] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-22 16:18:13] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 16:18:14] [INFO ] [Nat]Absence check using 268 positive place invariants in 33 ms returned sat
[2023-03-22 16:18:14] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 16:18:14] [INFO ] After 351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-22 16:18:14] [INFO ] After 578ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 16:18:14] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 11 ms.
[2023-03-22 16:18:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 566 places, 418 transitions and 1910 arcs took 8 ms.
[2023-03-22 16:18:14] [INFO ] Flatten gal took : 87 ms
Total runtime 24095 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_030A
(NrP: 566 NrTr: 418 NrArc: 1910)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.032sec

net check time: 0m 0.000sec

init dd package: 0m 2.862sec


before gc: list nodes free: 1682433

after gc: idd nodes used:620984, unused:63379016; list nodes free:292798959

before gc: list nodes free: 237260

after gc: idd nodes used:2461200, unused:61538800; list nodes free:288425127

before gc: list nodes free: 1945074

after gc: idd nodes used:2477171, unused:61522829; list nodes free:290446830
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 5996464 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095956 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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.001sec

22189 86335 355699 636330 1271587 2611327 3370916 2452937

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-030A"
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-030A, 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-167903717700295"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-030A.tgz
mv ShieldIIPt-PT-030A 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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;