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

About the Execution of Smart+red for ShieldPPPt-PT-020A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3304.615 42179.00 64686.00 38.00 TFTFTTTFTFTTF?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.r395-oct2-167903719000631.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 smartxred
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 r395-oct2-167903719000631
=====================================================================

--------------------
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 1679574948372

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020A
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 12:35:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 12:35:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 12:35:50] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2023-03-23 12:35:50] [INFO ] Transformed 503 places.
[2023-03-23 12:35:50] [INFO ] Transformed 363 transitions.
[2023-03-23 12:35:50] [INFO ] Found NUPN structural information;
[2023-03-23 12:35:50] [INFO ] Parsed PT model containing 503 places and 363 transitions and 1446 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 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 429 ms. (steps per millisecond=23 ) properties (out of 15) seen :10
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-10 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 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 362 rows 503 cols
[2023-03-23 12:35:51] [INFO ] Computed 221 place invariants in 9 ms
[2023-03-23 12:35:52] [INFO ] [Real]Absence check using 221 positive place invariants in 71 ms returned sat
[2023-03-23 12:35:52] [INFO ] After 415ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 12:35:52] [INFO ] [Nat]Absence check using 221 positive place invariants in 32 ms returned sat
[2023-03-23 12:35:52] [INFO ] After 675ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 12:35:53] [INFO ] After 1441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 672 ms.
[2023-03-23 12:35:54] [INFO ] After 2338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
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 193 ms.
Support contains 97 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 2 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 54 times.
Drop transitions removed 54 transitions
Iterating global reduction 0 with 54 rules applied. Total rules applied 58 place count 501 transition count 360
Applied a total of 58 rules in 131 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 132 ms. Remains : 501/503 places, 360/362 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 395924 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 395924 steps, saw 371902 distinct states, run finished after 3002 ms. (steps per millisecond=131 ) properties seen :2
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-020A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 360 rows 501 cols
[2023-03-23 12:35:58] [INFO ] Computed 221 place invariants in 8 ms
[2023-03-23 12:35:58] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 12:35:58] [INFO ] [Nat]Absence check using 221 positive place invariants in 140 ms returned sat
[2023-03-23 12:35:58] [INFO ] After 305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 12:35:58] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-23 12:35:58] [INFO ] After 63ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 12:35:58] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-23 12:35:59] [INFO ] After 831ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 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 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 17 place count 501 transition count 360
Applied a total of 17 rules in 51 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 51 ms. Remains : 501/501 places, 360/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 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 440741 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :{}
Probabilistic random walk after 440741 steps, saw 418300 distinct states, run finished after 3002 ms. (steps per millisecond=146 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 360 rows 501 cols
[2023-03-23 12:36:02] [INFO ] Computed 221 place invariants in 8 ms
[2023-03-23 12:36:02] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 12:36:02] [INFO ] [Nat]Absence check using 221 positive place invariants in 93 ms returned sat
[2023-03-23 12:36:02] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 12:36:02] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-23 12:36:03] [INFO ] After 90ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 12:36:03] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-23 12:36:03] [INFO ] After 808ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 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 19 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 19 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 17 ms. Remains 501 /501 variables (removed 0) and now considering 360/360 (removed 0) transitions.
[2023-03-23 12:36:03] [INFO ] Invariant cache hit.
[2023-03-23 12:36:03] [INFO ] Implicit Places using invariants in 551 ms returned [494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 559 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 35 ms. Remains 499 /500 variables (removed 1) and now considering 359/360 (removed 1) transitions.
// Phase 1: matrix 359 rows 499 cols
[2023-03-23 12:36:03] [INFO ] Computed 220 place invariants in 3 ms
[2023-03-23 12:36:04] [INFO ] Implicit Places using invariants in 361 ms returned [486]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 362 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 28 ms. Remains 497 /498 variables (removed 1) and now considering 358/359 (removed 1) transitions.
// Phase 1: matrix 358 rows 497 cols
[2023-03-23 12:36:04] [INFO ] Computed 219 place invariants in 2 ms
[2023-03-23 12:36:04] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-23 12:36:04] [INFO ] Invariant cache hit.
[2023-03-23 12:36:04] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-23 12:36:05] [INFO ] Implicit Places using invariants and state equation in 1266 ms returned []
Implicit Place search using SMT with State Equation took 1497 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 2498 ms. Remains : 497/501 places, 358/360 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) 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 498167 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :{}
Probabilistic random walk after 498167 steps, saw 471782 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 12:36:08] [INFO ] Invariant cache hit.
[2023-03-23 12:36:08] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 12:36:09] [INFO ] [Nat]Absence check using 219 positive place invariants in 75 ms returned sat
[2023-03-23 12:36:09] [INFO ] After 482ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 12:36:09] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-23 12:36:09] [INFO ] After 82ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 12:36:09] [INFO ] After 155ms 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-23 12:36:09] [INFO ] After 981ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 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 35 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 35 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 18 ms. Remains 497 /497 variables (removed 0) and now considering 358/358 (removed 0) transitions.
[2023-03-23 12:36:09] [INFO ] Invariant cache hit.
[2023-03-23 12:36:10] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-23 12:36:10] [INFO ] Invariant cache hit.
[2023-03-23 12:36:10] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-23 12:36:11] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
[2023-03-23 12:36:11] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-23 12:36:11] [INFO ] Invariant cache hit.
[2023-03-23 12:36:11] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1455 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 65 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-23 12:36:11] [INFO ] Computed 219 place invariants in 2 ms
[2023-03-23 12:36:11] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 12:36:11] [INFO ] [Nat]Absence check using 219 positive place invariants in 37 ms returned sat
[2023-03-23 12:36:11] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 12:36:11] [INFO ] After 314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-23 12:36:12] [INFO ] After 473ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-23 12:36:12] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 17 ms.
[2023-03-23 12:36:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 497 places, 358 transitions and 1623 arcs took 6 ms.
[2023-03-23 12:36:12] [INFO ] Flatten gal took : 79 ms
Total runtime 21927 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldPPPt (PT), instance 020A
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 497 places, 358 transitions, 1623 arcs.
Final Score: 22548.557
Took : 17 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679574990551

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
ERROR in file model.sm near line 2485:
syntax error

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="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is 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 r395-oct2-167903719000631"
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 ;