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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2615.147 70190.00 97220.00 40.60 TTF?TTFTFFTTTTTF 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-167903719000663.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-040A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903719000663
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 8.6K Feb 25 21:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 21:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 21:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 21:02 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:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 21:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Feb 25 21:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 21:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 21:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 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 268K 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-040A-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-040A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679577267326

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-040A
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 13:14:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 13:14:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 13:14:30] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2023-03-23 13:14:30] [INFO ] Transformed 1003 places.
[2023-03-23 13:14:30] [INFO ] Transformed 723 transitions.
[2023-03-23 13:14:30] [INFO ] Found NUPN structural information;
[2023-03-23 13:14:30] [INFO ] Parsed PT model containing 1003 places and 723 transitions and 2886 arcs in 222 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 452 ms. (steps per millisecond=22 ) properties (out of 16) seen :7
FORMULA ShieldPPPt-PT-040A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040A-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040A-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 722 rows 1003 cols
[2023-03-23 13:14:31] [INFO ] Computed 441 place invariants in 29 ms
[2023-03-23 13:14:32] [INFO ] [Real]Absence check using 441 positive place invariants in 205 ms returned sat
[2023-03-23 13:14:32] [INFO ] After 871ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 13:14:33] [INFO ] [Nat]Absence check using 441 positive place invariants in 147 ms returned sat
[2023-03-23 13:14:35] [INFO ] After 1980ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 13:14:37] [INFO ] After 3992ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1469 ms.
[2023-03-23 13:14:38] [INFO ] After 6237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
FORMULA ShieldPPPt-PT-040A-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-040A-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-040A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-040A-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-040A-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-040A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-040A-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-040A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 8 properties in 494 ms.
Support contains 50 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 24 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1001 transition count 720
Partial Free-agglomeration rule applied 143 times.
Drop transitions removed 143 transitions
Iterating global reduction 0 with 143 rules applied. Total rules applied 147 place count 1001 transition count 720
Applied a total of 147 rules in 286 ms. Remains 1001 /1003 variables (removed 2) and now considering 720/722 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 1001/1003 places, 720/722 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 239350 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 239350 steps, saw 233085 distinct states, run finished after 3002 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 720 rows 1001 cols
[2023-03-23 13:14:42] [INFO ] Computed 441 place invariants in 7 ms
[2023-03-23 13:14:42] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 13:14:43] [INFO ] [Nat]Absence check using 441 positive place invariants in 111 ms returned sat
[2023-03-23 13:14:43] [INFO ] After 681ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 13:14:43] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-23 13:14:44] [INFO ] After 279ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 13:14:44] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 2 ms to minimize.
[2023-03-23 13:14:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2023-03-23 13:14:44] [INFO ] After 840ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 169 ms.
[2023-03-23 13:14:44] [INFO ] After 2002ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 50 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 720/720 transitions.
Applied a total of 0 rules in 66 ms. Remains 1001 /1001 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1001/1001 places, 720/720 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 720/720 transitions.
Applied a total of 0 rules in 61 ms. Remains 1001 /1001 variables (removed 0) and now considering 720/720 (removed 0) transitions.
[2023-03-23 13:14:45] [INFO ] Invariant cache hit.
[2023-03-23 13:14:45] [INFO ] Implicit Places using invariants in 856 ms returned [994]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 859 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1000/1001 places, 720/720 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1000 transition count 718
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 998 transition count 718
Applied a total of 4 rules in 48 ms. Remains 998 /1000 variables (removed 2) and now considering 718/720 (removed 2) transitions.
// Phase 1: matrix 718 rows 998 cols
[2023-03-23 13:14:46] [INFO ] Computed 440 place invariants in 4 ms
[2023-03-23 13:14:46] [INFO ] Implicit Places using invariants in 678 ms returned [981, 985]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 683 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 996/1001 places, 718/720 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 995 transition count 717
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 995 transition count 717
Applied a total of 2 rules in 101 ms. Remains 995 /996 variables (removed 1) and now considering 717/718 (removed 1) transitions.
// Phase 1: matrix 717 rows 995 cols
[2023-03-23 13:14:46] [INFO ] Computed 438 place invariants in 9 ms
[2023-03-23 13:14:47] [INFO ] Implicit Places using invariants in 680 ms returned []
[2023-03-23 13:14:47] [INFO ] Invariant cache hit.
[2023-03-23 13:14:48] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-23 13:14:49] [INFO ] Implicit Places using invariants and state equation in 1719 ms returned []
Implicit Place search using SMT with State Equation took 2402 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 995/1001 places, 717/720 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4154 ms. Remains : 995/1001 places, 717/720 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 279410 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 279410 steps, saw 272254 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 13:14:52] [INFO ] Invariant cache hit.
[2023-03-23 13:14:52] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 13:14:52] [INFO ] [Nat]Absence check using 438 positive place invariants in 77 ms returned sat
[2023-03-23 13:14:53] [INFO ] After 548ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 13:14:53] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-23 13:14:53] [INFO ] After 221ms SMT Verify possible using 33 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 13:14:53] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2023-03-23 13:14:54] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2023-03-23 13:14:54] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 1 ms to minimize.
[2023-03-23 13:14:54] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 14 ms to minimize.
[2023-03-23 13:14:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 724 ms
[2023-03-23 13:14:54] [INFO ] After 1153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 194 ms.
[2023-03-23 13:14:54] [INFO ] After 2148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 50 out of 995 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 995/995 places, 717/717 transitions.
Applied a total of 0 rules in 28 ms. Remains 995 /995 variables (removed 0) and now considering 717/717 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 995/995 places, 717/717 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 995/995 places, 717/717 transitions.
Applied a total of 0 rules in 27 ms. Remains 995 /995 variables (removed 0) and now considering 717/717 (removed 0) transitions.
[2023-03-23 13:14:54] [INFO ] Invariant cache hit.
[2023-03-23 13:14:55] [INFO ] Implicit Places using invariants in 632 ms returned []
[2023-03-23 13:14:55] [INFO ] Invariant cache hit.
[2023-03-23 13:14:56] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-23 13:14:57] [INFO ] Implicit Places using invariants and state equation in 1681 ms returned []
Implicit Place search using SMT with State Equation took 2332 ms to find 0 implicit places.
[2023-03-23 13:14:57] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-23 13:14:57] [INFO ] Invariant cache hit.
[2023-03-23 13:14:57] [INFO ] Dead Transitions using invariants and state equation in 613 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3024 ms. Remains : 995/995 places, 717/717 transitions.
Partial Free-agglomeration rule applied 32 times.
Drop transitions removed 32 transitions
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 995 transition count 717
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 995 transition count 685
Applied a total of 64 rules in 85 ms. Remains 995 /995 variables (removed 0) and now considering 685/717 (removed 32) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 685 rows 995 cols
[2023-03-23 13:14:57] [INFO ] Computed 438 place invariants in 7 ms
[2023-03-23 13:14:58] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 13:14:58] [INFO ] [Nat]Absence check using 438 positive place invariants in 59 ms returned sat
[2023-03-23 13:14:59] [INFO ] After 908ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 13:14:59] [INFO ] After 1116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 150 ms.
[2023-03-23 13:14:59] [INFO ] After 1471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-23 13:14:59] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-23 13:14:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 995 places, 717 transitions and 3259 arcs took 9 ms.
[2023-03-23 13:15:00] [INFO ] Flatten gal took : 239 ms
Total runtime 30166 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldPPPt (PT), instance 040A
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: 995 places, 717 transitions, 3259 arcs.
Final Score: 112991.508
Took : 36 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679577337516

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.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 4978:
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-040A"
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-040A, 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-167903719000663"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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