Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r312-tall-171662337800086.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is QuasiCertifProtocol-PT-18, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662337800086
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 46K Apr 13 04:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 318K Apr 13 04:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 13 04:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 135K Apr 13 04:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 13 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 13 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 04:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Apr 13 04:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.3K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 360K May 18 16:43 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 QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-00
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-01
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-02
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-03
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-04
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-05
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-06
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-07
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-08
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-09
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-10
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-11
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-12
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-13
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-14
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716667128222

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-25 19:58:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 19:58:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 19:58:49] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-05-25 19:58:49] [INFO ] Transformed 1398 places.
[2024-05-25 19:58:49] [INFO ] Transformed 296 transitions.
[2024-05-25 19:58:49] [INFO ] Parsed PT model containing 1398 places and 296 transitions and 3119 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 19:58:50] [INFO ] Flatten gal took : 283 ms
[2024-05-25 19:58:50] [INFO ] Flatten gal took : 114 ms
[2024-05-25 19:58:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10393207094895992106.gal : 43 ms
[2024-05-25 19:58:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13187636476445881299.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10393207094895992106.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13187636476445881299.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (1765 resets) in 2881 ms. (13 steps per ms) remains 16/16 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 4004 steps (12 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (10 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (12 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
Loading property file /tmp/ReachabilityCardinality13187636476445881299.prop.
BEST_FIRST walk for 4004 steps (11 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (12 resets) in 115 ms. (34 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (12 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 319 ms. (12 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :8 after 32
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :32 after 1024
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :709044 after 717054
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :717054 after 770952
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :770952 after 1.05246e+06
Interrupted probabilistic random walk after 492702 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :0 out of 16
Probabilistic random walk after 492702 steps, saw 73298 distinct states, run finished after 3006 ms. (steps per millisecond=163 ) properties seen :0
// Phase 1: matrix 296 rows 1398 cols
[2024-05-25 19:58:54] [INFO ] Computed 1103 invariants in 63 ms
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :1.05246e+06 after 1.24537e+06
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-00 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-01 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-07 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 105/339 variables, 2/5 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 35/40 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/40 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 2/341 variables, 1/41 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 13 unsolved
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :1.24537e+06 after 5.69447e+06
At refinement iteration 7 (OVERLAPS) 538/879 variables, 543/584 constraints. Problems are: Problem set: 3 solved, 13 unsolved
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :5.69447e+06 after 3.31093e+07
At refinement iteration 8 (INCLUDED_ONLY) 0/879 variables, 0/584 constraints. Problems are: Problem set: 3 solved, 13 unsolved
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :3.31093e+07 after 8.71498e+07
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :8.71498e+07 after 1.26788e+09
At refinement iteration 9 (OVERLAPS) 519/1398 variables, 519/1103 constraints. Problems are: Problem set: 3 solved, 13 unsolved
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :1.26788e+09 after 5.15028e+09
At refinement iteration 10 (INCLUDED_ONLY) 0/1398 variables, 0/1103 constraints. Problems are: Problem set: 3 solved, 13 unsolved
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-02 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-03 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-04 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-06 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-08 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-09 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-12 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-15 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 11 (OVERLAPS) 296/1694 variables, 1398/2501 constraints. Problems are: Problem set: 11 solved, 5 unsolved
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :5.15028e+09 after 1.9256e+10
At refinement iteration 12 (INCLUDED_ONLY) 0/1694 variables, 0/2501 constraints. Problems are: Problem set: 11 solved, 5 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 21.0 4.0))
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 (/ 19.0 4.0))
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 (/ 1.0 4.0))
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1694/1694 variables, and 2501 constraints, problems are : Problem set: 11 solved, 5 unsolved in 5041 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1100/1100 constraints, State Equation: 1398/1398 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 132/224 variables, 2/3 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 3/6 constraints. Problems are: Problem set: 11 solved, 5 unsolved
[2024-05-25 19:58:59] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 16 ms to minimize.
[2024-05-25 19:58:59] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 2/8 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/8 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/226 variables, 1/9 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/9 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 465/691 variables, 431/440 constraints. Problems are: Problem set: 11 solved, 5 unsolved
[2024-05-25 19:58:59] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-25 19:58:59] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-25 19:58:59] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-25 19:59:00] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-25 19:59:00] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-25 19:59:00] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-25 19:59:00] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-05-25 19:59:00] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-25 19:59:00] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 2 ms to minimize.
[2024-05-25 19:59:00] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 2 ms to minimize.
[2024-05-25 19:59:00] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-25 19:59:00] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-25 19:59:00] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 11 ms to minimize.
[2024-05-25 19:59:00] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-25 19:59:00] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/691 variables, 15/455 constraints. Problems are: Problem set: 11 solved, 5 unsolved
[2024-05-25 19:59:00] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/691 variables, 1/456 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/691 variables, 0/456 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 707/1398 variables, 665/1121 constraints. Problems are: Problem set: 11 solved, 5 unsolved
[2024-05-25 19:59:01] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 2 ms to minimize.
[2024-05-25 19:59:01] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 2 ms to minimize.
[2024-05-25 19:59:01] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-25 19:59:02] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-25 19:59:02] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2024-05-25 19:59:02] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2024-05-25 19:59:02] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-25 19:59:02] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-25 19:59:02] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
SDD proceeding with computation,16 properties remain. new max is 65536
[2024-05-25 19:59:02] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
SDD size :1.9256e+10 after 7.65545e+10
[2024-05-25 19:59:02] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-25 19:59:02] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-25 19:59:02] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-25 19:59:02] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1398 variables, 14/1135 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1398 variables, 0/1135 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 296/1694 variables, 1398/2533 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1694 variables, 5/2538 constraints. Problems are: Problem set: 11 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 2538 constraints, problems are : Problem set: 11 solved, 5 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1100/1100 constraints, State Equation: 1398/1398 constraints, PredecessorRefiner: 5/16 constraints, Known Traps: 32/32 constraints]
After SMT, in 10241ms problems are : Problem set: 11 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 92 out of 1398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Graph (complete) has 9608 edges and 1398 vertex of which 1262 are kept as prefixes of interest. Removing 136 places using SCC suffix rule.6 ms
Discarding 136 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 129 transitions
Reduce isomorphic transitions removed 129 transitions.
Discarding 34 places :
Implicit places reduction removed 34 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 167 rules applied. Total rules applied 168 place count 1228 transition count 158
Reduce places removed 4 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 9 rules applied. Total rules applied 177 place count 1224 transition count 153
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 182 place count 1219 transition count 153
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 182 place count 1219 transition count 136
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 27 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 61 rules applied. Total rules applied 243 place count 1175 transition count 136
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Ensure Unique test removed 108 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 395 place count 1045 transition count 114
Applied a total of 395 rules in 268 ms. Remains 1045 /1398 variables (removed 353) and now considering 114/296 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 1045/1398 places, 114/296 transitions.
RANDOM walk for 40000 steps (2937 resets) in 816 ms. (48 steps per ms) remains 3/5 properties
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (491 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (451 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (429 resets) in 231 ms. (172 steps per ms) remains 3/3 properties
// Phase 1: matrix 114 rows 1045 cols
[2024-05-25 19:59:04] [INFO ] Computed 931 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 7/80 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 641/721 variables, 617/621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/721 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 323/1044 variables, 310/931 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1044 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 113/1157 variables, 1044/1975 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1157 variables, 0/1975 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/1159 variables, 1/1976 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1159 variables, 0/1976 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1159 variables, 0/1976 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1159/1159 variables, and 1976 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1021 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 928/928 constraints, State Equation: 1045/1045 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 7/80 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 641/721 variables, 617/621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/721 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 323/1044 variables, 310/931 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1044 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 113/1157 variables, 1044/1975 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1157 variables, 2/1977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1157 variables, 0/1977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/1159 variables, 1/1978 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1159 variables, 1/1979 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1159 variables, 0/1979 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1159 variables, 0/1979 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1159/1159 variables, and 1979 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1874 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 928/928 constraints, State Equation: 1045/1045 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2933ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 99 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=33 )
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-10 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 8 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 18622 ms.

BK_STOP 1716667147977

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="QuasiCertifProtocol-PT-18"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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-5568"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-PT-18, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-171662337800086"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-18.tgz
mv QuasiCertifProtocol-PT-18 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;