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.r393-oct2-167903717300631.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 ltsminxred
Input is ShieldPPPt-PT-020A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717300631
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.1K Feb 25 21:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 21:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 21:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 21:10 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.6K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 21:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 21:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 21:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 21:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 134K 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 ShieldPPPt-PT-020A-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-020A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679463713197

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 05:41:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 05:41:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 05:41:56] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2023-03-22 05:41:56] [INFO ] Transformed 503 places.
[2023-03-22 05:41:56] [INFO ] Transformed 363 transitions.
[2023-03-22 05:41:56] [INFO ] Found NUPN structural information;
[2023-03-22 05:41:56] [INFO ] Parsed PT model containing 503 places and 363 transitions and 1446 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 557 ms. (steps per millisecond=17 ) properties (out of 15) seen :8
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 362 rows 503 cols
[2023-03-22 05:41:57] [INFO ] Computed 221 place invariants in 22 ms
[2023-03-22 05:41:58] [INFO ] [Real]Absence check using 221 positive place invariants in 46 ms returned sat
[2023-03-22 05:41:58] [INFO ] After 664ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 05:41:58] [INFO ] [Nat]Absence check using 221 positive place invariants in 48 ms returned sat
[2023-03-22 05:41:59] [INFO ] After 1292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 05:42:00] [INFO ] After 2157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 682 ms.
[2023-03-22 05:42:01] [INFO ] After 3240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 395 ms.
Support contains 119 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 362/362 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 501 transition count 360
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 0 with 50 rules applied. Total rules applied 54 place count 501 transition count 360
Applied a total of 54 rules in 105 ms. Remains 501 /503 variables (removed 2) and now considering 360/362 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 501/503 places, 360/362 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 5) seen :1
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 360 rows 501 cols
[2023-03-22 05:42:02] [INFO ] Computed 221 place invariants in 3 ms
[2023-03-22 05:42:03] [INFO ] [Real]Absence check using 221 positive place invariants in 101 ms returned sat
[2023-03-22 05:42:03] [INFO ] After 399ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 05:42:03] [INFO ] [Nat]Absence check using 221 positive place invariants in 66 ms returned sat
[2023-03-22 05:42:04] [INFO ] After 711ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 05:42:04] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-22 05:42:04] [INFO ] After 446ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 05:42:05] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 1 ms to minimize.
[2023-03-22 05:42:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-03-22 05:42:05] [INFO ] After 1031ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 371 ms.
[2023-03-22 05:42:05] [INFO ] After 2571ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 131 ms.
Support contains 81 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 360/360 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 501 transition count 360
Applied a total of 6 rules in 30 ms. Remains 501 /501 variables (removed 0) and now considering 360/360 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 501/501 places, 360/360 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :1
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 360 rows 501 cols
[2023-03-22 05:42:05] [INFO ] Computed 221 place invariants in 2 ms
[2023-03-22 05:42:06] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:42:06] [INFO ] [Nat]Absence check using 221 positive place invariants in 32 ms returned sat
[2023-03-22 05:42:07] [INFO ] After 792ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 05:42:07] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-22 05:42:07] [INFO ] After 115ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 05:42:07] [INFO ] After 259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-22 05:42:07] [INFO ] After 1435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 17 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 360/360 transitions.
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 501 transition count 360
Applied a total of 15 rules in 80 ms. Remains 501 /501 variables (removed 0) and now considering 360/360 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 501/501 places, 360/360 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 388372 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :{}
Probabilistic random walk after 388372 steps, saw 369673 distinct states, run finished after 3007 ms. (steps per millisecond=129 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 360 rows 501 cols
[2023-03-22 05:42:10] [INFO ] Computed 221 place invariants in 3 ms
[2023-03-22 05:42:10] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:42:11] [INFO ] [Nat]Absence check using 221 positive place invariants in 28 ms returned sat
[2023-03-22 05:42:11] [INFO ] After 387ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 05:42:11] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-22 05:42:11] [INFO ] After 135ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 05:42:11] [INFO ] After 291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-22 05:42:11] [INFO ] After 964ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 17 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 360/360 transitions.
Applied a total of 0 rules in 36 ms. Remains 501 /501 variables (removed 0) and now considering 360/360 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 501/501 places, 360/360 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 360/360 transitions.
Applied a total of 0 rules in 37 ms. Remains 501 /501 variables (removed 0) and now considering 360/360 (removed 0) transitions.
[2023-03-22 05:42:11] [INFO ] Invariant cache hit.
[2023-03-22 05:42:12] [INFO ] Implicit Places using invariants in 605 ms returned [494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 609 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 500/501 places, 360/360 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 500 transition count 359
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 499 transition count 359
Applied a total of 2 rules in 30 ms. Remains 499 /500 variables (removed 1) and now considering 359/360 (removed 1) transitions.
// Phase 1: matrix 359 rows 499 cols
[2023-03-22 05:42:12] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-22 05:42:12] [INFO ] Implicit Places using invariants in 314 ms returned [486]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 316 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 498/501 places, 359/360 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 497 transition count 358
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 497 transition count 358
Applied a total of 2 rules in 40 ms. Remains 497 /498 variables (removed 1) and now considering 358/359 (removed 1) transitions.
// Phase 1: matrix 358 rows 497 cols
[2023-03-22 05:42:12] [INFO ] Computed 219 place invariants in 2 ms
[2023-03-22 05:42:14] [INFO ] Implicit Places using invariants in 1213 ms returned []
[2023-03-22 05:42:14] [INFO ] Invariant cache hit.
[2023-03-22 05:42:14] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-22 05:42:14] [INFO ] Implicit Places using invariants and state equation in 737 ms returned []
Implicit Place search using SMT with State Equation took 1957 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 497/501 places, 358/360 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3001 ms. Remains : 497/501 places, 358/360 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 427823 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 427823 steps, saw 406216 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 05:42:18] [INFO ] Invariant cache hit.
[2023-03-22 05:42:18] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:42:18] [INFO ] [Nat]Absence check using 219 positive place invariants in 24 ms returned sat
[2023-03-22 05:42:18] [INFO ] After 290ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 05:42:18] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-22 05:42:18] [INFO ] After 57ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 05:42:18] [INFO ] After 160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-22 05:42:18] [INFO ] After 639ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 17 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 358/358 transitions.
Applied a total of 0 rules in 23 ms. Remains 497 /497 variables (removed 0) and now considering 358/358 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 497/497 places, 358/358 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 358/358 transitions.
Applied a total of 0 rules in 11 ms. Remains 497 /497 variables (removed 0) and now considering 358/358 (removed 0) transitions.
[2023-03-22 05:42:18] [INFO ] Invariant cache hit.
[2023-03-22 05:42:19] [INFO ] Implicit Places using invariants in 928 ms returned []
[2023-03-22 05:42:19] [INFO ] Invariant cache hit.
[2023-03-22 05:42:20] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-22 05:42:25] [INFO ] Implicit Places using invariants and state equation in 5363 ms returned []
Implicit Place search using SMT with State Equation took 6319 ms to find 0 implicit places.
[2023-03-22 05:42:25] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-22 05:42:25] [INFO ] Invariant cache hit.
[2023-03-22 05:42:25] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7090 ms. Remains : 497/497 places, 358/358 transitions.
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 17 place count 497 transition count 358
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 497 transition count 341
Applied a total of 34 rules in 44 ms. Remains 497 /497 variables (removed 0) and now considering 341/358 (removed 17) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 341 rows 497 cols
[2023-03-22 05:42:25] [INFO ] Computed 219 place invariants in 2 ms
[2023-03-22 05:42:26] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:42:26] [INFO ] [Nat]Absence check using 219 positive place invariants in 29 ms returned sat
[2023-03-22 05:42:26] [INFO ] After 363ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 05:42:26] [INFO ] After 434ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-22 05:42:26] [INFO ] After 625ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 05:42:26] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-22 05:42:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 497 places, 358 transitions and 1623 arcs took 4 ms.
[2023-03-22 05:42:27] [INFO ] Flatten gal took : 181 ms
Total runtime 31350 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/552/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 9985404 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16096704 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
mcc2023

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="ShieldPPPt-PT-020A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldPPPt-PT-020A, 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 r393-oct2-167903717300631"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-020A.tgz
mv ShieldPPPt-PT-020A 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 ;