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

About the Execution of Smart+red for SieveSingleMsgMbox-PT-d1m36

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
540.451 31804.00 52822.00 93.00 ??TFTTFTF?FFTF?F normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r427-tajo-167905979700431.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is SieveSingleMsgMbox-PT-d1m36, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r427-tajo-167905979700431
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 7.5K Feb 26 10:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 10:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 10:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 10:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 26 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 10:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 10:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 450K 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 SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679387659130

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=SieveSingleMsgMbox-PT-d1m36
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 08:34:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 08:34:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 08:34:21] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2023-03-21 08:34:21] [INFO ] Transformed 1295 places.
[2023-03-21 08:34:21] [INFO ] Transformed 749 transitions.
[2023-03-21 08:34:21] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1036 places in 8 ms
Reduce places removed 1036 places and 0 transitions.
Incomplete random walk after 10000 steps, including 2237 resets, run finished after 670 ms. (steps per millisecond=14 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 125 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 225954 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{3=1, 4=1, 6=1, 7=1, 10=1, 12=1, 13=1}
Probabilistic random walk after 225954 steps, saw 103684 distinct states, run finished after 3003 ms. (steps per millisecond=75 ) properties seen :7
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 9 properties.
// Phase 1: matrix 749 rows 259 cols
[2023-03-21 08:34:25] [INFO ] Computed 6 place invariants in 35 ms
[2023-03-21 08:34:25] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-21 08:34:25] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-21 08:34:25] [INFO ] After 299ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:7
[2023-03-21 08:34:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-21 08:34:25] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-21 08:34:26] [INFO ] After 550ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :4
[2023-03-21 08:34:26] [INFO ] State equation strengthened by 587 read => feed constraints.
[2023-03-21 08:34:27] [INFO ] After 583ms SMT Verify possible using 587 Read/Feed constraints in natural domain returned unsat :5 sat :4
[2023-03-21 08:34:27] [INFO ] Deduced a trap composed of 137 places in 174 ms of which 4 ms to minimize.
[2023-03-21 08:34:27] [INFO ] Deduced a trap composed of 138 places in 122 ms of which 1 ms to minimize.
[2023-03-21 08:34:27] [INFO ] Deduced a trap composed of 156 places in 152 ms of which 1 ms to minimize.
[2023-03-21 08:34:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 630 ms
[2023-03-21 08:34:28] [INFO ] After 2044ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :4
Attempting to minimize the solution found.
Minimization took 1064 ms.
[2023-03-21 08:34:29] [INFO ] After 3824ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :4
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SieveSingleMsgMbox-PT-d1m36-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 92 ms.
Support contains 14 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 241 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 241 transition count 507
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 294 place count 190 transition count 328
Iterating global reduction 1 with 51 rules applied. Total rules applied 345 place count 190 transition count 328
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 352 place count 190 transition count 321
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 387 place count 155 transition count 286
Iterating global reduction 2 with 35 rules applied. Total rules applied 422 place count 155 transition count 286
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 433 place count 155 transition count 275
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 448 place count 140 transition count 259
Iterating global reduction 3 with 15 rules applied. Total rules applied 463 place count 140 transition count 259
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 500 place count 140 transition count 222
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 504 place count 136 transition count 216
Iterating global reduction 4 with 4 rules applied. Total rules applied 508 place count 136 transition count 216
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 512 place count 132 transition count 212
Iterating global reduction 4 with 4 rules applied. Total rules applied 516 place count 132 transition count 212
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 518 place count 130 transition count 209
Iterating global reduction 4 with 2 rules applied. Total rules applied 520 place count 130 transition count 209
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 521 place count 129 transition count 208
Iterating global reduction 4 with 1 rules applied. Total rules applied 522 place count 129 transition count 208
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 523 place count 128 transition count 207
Iterating global reduction 4 with 1 rules applied. Total rules applied 524 place count 128 transition count 207
Applied a total of 524 rules in 90 ms. Remains 128 /259 variables (removed 131) and now considering 207/749 (removed 542) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 128/259 places, 207/749 transitions.
Incomplete random walk after 10000 steps, including 2262 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 505 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 458 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 330789 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 330789 steps, saw 144961 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 207 rows 128 cols
[2023-03-21 08:34:33] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-21 08:34:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-21 08:34:33] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-21 08:34:33] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 08:34:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-21 08:34:33] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 08:34:33] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 08:34:33] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-21 08:34:34] [INFO ] After 243ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 08:34:34] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 2 ms to minimize.
[2023-03-21 08:34:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-21 08:34:34] [INFO ] After 791ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 189 ms.
[2023-03-21 08:34:34] [INFO ] After 1212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 216 ms.
Support contains 14 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 207/207 transitions.
Applied a total of 0 rules in 30 ms. Remains 128 /128 variables (removed 0) and now considering 207/207 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 128/128 places, 207/207 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 207/207 transitions.
Applied a total of 0 rules in 18 ms. Remains 128 /128 variables (removed 0) and now considering 207/207 (removed 0) transitions.
[2023-03-21 08:34:35] [INFO ] Invariant cache hit.
[2023-03-21 08:34:35] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-21 08:34:35] [INFO ] Invariant cache hit.
[2023-03-21 08:34:35] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-21 08:34:35] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
[2023-03-21 08:34:35] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-21 08:34:35] [INFO ] Invariant cache hit.
[2023-03-21 08:34:35] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 641 ms. Remains : 128/128 places, 207/207 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 128 transition count 203
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 125 transition count 203
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 7 place count 125 transition count 190
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 33 place count 112 transition count 190
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 57 place count 100 transition count 178
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 99 transition count 179
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 99 transition count 179
Applied a total of 60 rules in 30 ms. Remains 99 /128 variables (removed 29) and now considering 179/207 (removed 28) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 179 rows 99 cols
[2023-03-21 08:34:35] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-21 08:34:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-21 08:34:35] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 08:34:35] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 08:34:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-21 08:34:35] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 08:34:35] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 08:34:36] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2023-03-21 08:34:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-21 08:34:36] [INFO ] After 386ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-21 08:34:36] [INFO ] After 544ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-21 08:34:36] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-21 08:34:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 128 places, 207 transitions and 819 arcs took 4 ms.
[2023-03-21 08:34:36] [INFO ] Flatten gal took : 55 ms
Total runtime 15665 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running SieveSingleMsgMbox (PT), instance d1m36
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: 128 places, 207 transitions, 819 arcs.
Final Score: 2427.444
Took : 13 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679387690934

--------------------
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
ERROR in file model.sm near line 1162:
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="SieveSingleMsgMbox-PT-d1m36"
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 SieveSingleMsgMbox-PT-d1m36, 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 r427-tajo-167905979700431"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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