Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654447200465.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBNT-PT-S05J60, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447200465
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 27K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 47K Apr 12 09:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 242K Apr 12 09:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106K Apr 12 10:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 436K Apr 12 10:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K 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 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 PolyORBNT-PT-S05J60-CTLCardinality-2024-00
FORMULA_NAME PolyORBNT-PT-S05J60-CTLCardinality-2024-01
FORMULA_NAME PolyORBNT-PT-S05J60-CTLCardinality-2024-02
FORMULA_NAME PolyORBNT-PT-S05J60-CTLCardinality-2024-03
FORMULA_NAME PolyORBNT-PT-S05J60-CTLCardinality-2024-04
FORMULA_NAME PolyORBNT-PT-S05J60-CTLCardinality-2024-05
FORMULA_NAME PolyORBNT-PT-S05J60-CTLCardinality-2024-06
FORMULA_NAME PolyORBNT-PT-S05J60-CTLCardinality-2024-07
FORMULA_NAME PolyORBNT-PT-S05J60-CTLCardinality-2024-08
FORMULA_NAME PolyORBNT-PT-S05J60-CTLCardinality-2024-09
FORMULA_NAME PolyORBNT-PT-S05J60-CTLCardinality-2024-10
FORMULA_NAME PolyORBNT-PT-S05J60-CTLCardinality-2024-11
FORMULA_NAME PolyORBNT-PT-S05J60-CTLCardinality-2024-12
FORMULA_NAME PolyORBNT-PT-S05J60-CTLCardinality-2024-13
FORMULA_NAME PolyORBNT-PT-S05J60-CTLCardinality-2024-14
FORMULA_NAME PolyORBNT-PT-S05J60-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717260402971

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J60
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:46:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:46:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:46:44] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2024-06-01 16:46:44] [INFO ] Transformed 909 places.
[2024-06-01 16:46:44] [INFO ] Transformed 1970 transitions.
[2024-06-01 16:46:44] [INFO ] Parsed PT model containing 909 places and 1970 transitions and 12584 arcs in 302 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 779 out of 909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Applied a total of 0 rules in 30 ms. Remains 909 /909 variables (removed 0) and now considering 1315/1315 (removed 0) transitions.
Running 1309 sub problems to find dead transitions.
[2024-06-01 16:46:44] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2024-06-01 16:46:44] [INFO ] Computed 142 invariants in 91 ms
[2024-06-01 16:46:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.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 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.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 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 1.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)
(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 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.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 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 (/ 1.0 3.0))
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.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 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 1.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 1.0)
(s183 0.0)
(s184 1.0)
(s185 1.0)
(s186 1.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 1.0)
(s201 0.0)
(s202 1.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 1.0)
(s212 4.0)
(s213 0.0)
(s214 0.0)
(s215 4.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 1.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 1.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 7.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s275 0.0)
(s276 0.0)
(s278 (/ 2.0 3.0))
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.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 1.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.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 1.0)
(s331 1.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 3.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)timeout

(s356 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2220 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20106 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/31 constraints, State Equation: 0/909 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/2220 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/31 constraints, State Equation: 0/909 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 0/0 constraints]
After SMT, in 43598ms problems are : Problem set: 0 solved, 1309 unsolved
Search for dead transitions found 0 dead transitions in 43635ms
[2024-06-01 16:47:28] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-06-01 16:47:28] [INFO ] Invariant cache hit.
[2024-06-01 16:47:28] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-06-01 16:47:28] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-06-01 16:47:28] [INFO ] Invariant cache hit.
[2024-06-01 16:47:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:47:31] [INFO ] Implicit Places using invariants and state equation in 2336 ms returned []
Implicit Place search using SMT with State Equation took 2749 ms to find 0 implicit places.
Running 1309 sub problems to find dead transitions.
[2024-06-01 16:47:31] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-06-01 16:47:31] [INFO ] Invariant cache hit.
[2024-06-01 16:47:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Problem TDEAD267 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD501 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/909 variables, 11/142 constraints. Problems are: Problem set: 8 solved, 1301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 909/2220 variables, and 142 constraints, problems are : Problem set: 8 solved, 1301 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/909 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 1301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 111/111 constraints. Problems are: Problem set: 8 solved, 1301 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 20/131 constraints. Problems are: Problem set: 8 solved, 1301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 0/131 constraints. Problems are: Problem set: 8 solved, 1301 unsolved
Problem TDEAD611 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1174 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/909 variables, 11/142 constraints. Problems are: Problem set: 68 solved, 1241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 909/2220 variables, and 142 constraints, problems are : Problem set: 68 solved, 1241 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/909 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 0/0 constraints]
After SMT, in 63029ms problems are : Problem set: 68 solved, 1241 unsolved
Search for dead transitions found 68 dead transitions in 63054ms
Found 68 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 68 transitions
Dead transitions reduction (with SMT) removed 68 transitions
Starting structural reductions in LTL mode, iteration 1 : 909/909 places, 1247/1315 transitions.
Applied a total of 0 rules in 10 ms. Remains 909 /909 variables (removed 0) and now considering 1247/1247 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109554 ms. Remains : 909/909 places, 1247/1315 transitions.
Support contains 779 out of 909 places after structural reductions.
[2024-06-01 16:48:34] [INFO ] Flatten gal took : 165 ms
[2024-06-01 16:48:34] [INFO ] Flatten gal took : 115 ms
[2024-06-01 16:48:34] [INFO ] Input system was already deterministic with 1247 transitions.
Support contains 778 out of 909 places (down from 779) after GAL structural reductions.
RANDOM walk for 40000 steps (2771 resets) in 2305 ms. (17 steps per ms) remains 38/54 properties
BEST_FIRST walk for 4003 steps (95 resets) in 31 ms. (125 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (97 resets) in 99 ms. (40 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (69 resets) in 50 ms. (78 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (100 resets) in 43 ms. (91 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (45 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (48 resets) in 28 ms. (138 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (52 resets) in 36 ms. (108 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (14 resets) in 28 ms. (138 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (63 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (60 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (98 resets) in 47 ms. (83 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (76 resets) in 26 ms. (148 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (96 resets) in 42 ms. (93 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (70 resets) in 35 ms. (111 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (44 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (56 resets) in 44 ms. (88 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (49 resets) in 33 ms. (117 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (73 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (74 resets) in 56 ms. (70 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (71 resets) in 28 ms. (138 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (49 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (68 resets) in 37 ms. (105 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (66 resets) in 36 ms. (108 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (46 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (50 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (46 resets) in 37 ms. (105 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (49 resets) in 25 ms. (153 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (67 resets) in 27 ms. (143 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (68 resets) in 21 ms. (182 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (66 resets) in 21 ms. (182 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (45 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (46 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (47 resets) in 27 ms. (142 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (66 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (63 resets) in 32 ms. (121 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (36 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (59 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (38 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
[2024-06-01 16:48:36] [INFO ] Flow matrix only has 1243 transitions (discarded 4 similar events)
// Phase 1: matrix 1243 rows 909 cols
[2024-06-01 16:48:36] [INFO ] Computed 142 invariants in 56 ms
[2024-06-01 16:48:36] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 1 (OVERLAPS) 511/862 variables, 111/111 constraints. Problems are: Problem set: 19 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/862 variables, 1/112 constraints. Problems are: Problem set: 19 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/862 variables, 0/112 constraints. Problems are: Problem set: 19 solved, 19 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp52 is UNSAT
At refinement iteration 4 (OVERLAPS) 46/908 variables, 30/142 constraints. Problems are: Problem set: 37 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/908 variables, 0/142 constraints. Problems are: Problem set: 37 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1243/2151 variables, 908/1050 constraints. Problems are: Problem set: 37 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2151 variables, 1/1051 constraints. Problems are: Problem set: 37 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2151 variables, 0/1051 constraints. Problems are: Problem set: 37 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/2152 variables, 1/1052 constraints. Problems are: Problem set: 37 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2152 variables, 0/1052 constraints. Problems are: Problem set: 37 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2152 variables, 0/1052 constraints. Problems are: Problem set: 37 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2152/2152 variables, and 1052 constraints, problems are : Problem set: 37 solved, 1 unsolved in 1245 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 909/909 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 37 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 37 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 194/196 variables, 3/3 constraints. Problems are: Problem set: 37 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/3 constraints. Problems are: Problem set: 37 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 286/482 variables, 48/51 constraints. Problems are: Problem set: 37 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/51 constraints. Problems are: Problem set: 37 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 230/712 variables, 46/97 constraints. Problems are: Problem set: 37 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/712 variables, 0/97 constraints. Problems are: Problem set: 37 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 182/894 variables, 31/128 constraints. Problems are: Problem set: 37 solved, 1 unsolved
[2024-06-01 16:48:38] [INFO ] Deduced a trap composed of 24 places in 455 ms of which 39 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/894 variables, 1/129 constraints. Problems are: Problem set: 37 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/894 variables, 0/129 constraints. Problems are: Problem set: 37 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/908 variables, 14/143 constraints. Problems are: Problem set: 37 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/908 variables, 0/143 constraints. Problems are: Problem set: 37 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1243/2151 variables, 908/1051 constraints. Problems are: Problem set: 37 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2151 variables, 1/1052 constraints. Problems are: Problem set: 37 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2151/2152 variables, and 1053 constraints, problems are : Problem set: 37 solved, 1 unsolved in 2353 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 908/909 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/38 constraints, Known Traps: 1/1 constraints]
After SMT, in 3835ms problems are : Problem set: 37 solved, 1 unsolved
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 6 ms.
Successfully simplified 37 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBNT-PT-S05J60-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:48:40] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 16:48:40] [INFO ] Flatten gal took : 59 ms
FORMULA PolyORBNT-PT-S05J60-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 16:48:40] [INFO ] Flatten gal took : 58 ms
[2024-06-01 16:48:40] [INFO ] Input system was already deterministic with 1247 transitions.
Support contains 378 out of 909 places (down from 515) after GAL structural reductions.
FORMULA PolyORBNT-PT-S05J60-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1247/1247 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1247
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1246
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1246
Applied a total of 7 rules in 103 ms. Remains 903 /909 variables (removed 6) and now considering 1246/1247 (removed 1) transitions.
Running 1240 sub problems to find dead transitions.
[2024-06-01 16:48:40] [INFO ] Flow matrix only has 1242 transitions (discarded 4 similar events)
// Phase 1: matrix 1242 rows 903 cols
[2024-06-01 16:48:40] [INFO ] Computed 137 invariants in 36 ms
[2024-06-01 16:48:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2145 variables, and 131 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1240/1240 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 19/131 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 16:49:15] [INFO ] Deduced a trap composed of 137 places in 194 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2145 variables, and 132 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 19/25 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1240 constraints, Known Traps: 1/1 constraints]
After SMT, in 42263ms problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 42277ms
Finished structural reductions in LTL mode , in 1 iterations and 42384 ms. Remains : 903/909 places, 1246/1247 transitions.
[2024-06-01 16:49:22] [INFO ] Flatten gal took : 52 ms
[2024-06-01 16:49:22] [INFO ] Flatten gal took : 50 ms
[2024-06-01 16:49:22] [INFO ] Input system was already deterministic with 1246 transitions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1247/1247 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1247
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1246
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1246
Applied a total of 7 rules in 61 ms. Remains 903 /909 variables (removed 6) and now considering 1246/1247 (removed 1) transitions.
Running 1240 sub problems to find dead transitions.
[2024-06-01 16:49:22] [INFO ] Flow matrix only has 1242 transitions (discarded 4 similar events)
// Phase 1: matrix 1242 rows 903 cols
[2024-06-01 16:49:22] [INFO ] Computed 137 invariants in 18 ms
[2024-06-01 16:49:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2145 variables, and 131 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1240/1240 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2145 variables, and 131 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1240 constraints, Known Traps: 0/0 constraints]
After SMT, in 42477ms problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 42488ms
Finished structural reductions in LTL mode , in 1 iterations and 42551 ms. Remains : 903/909 places, 1246/1247 transitions.
[2024-06-01 16:50:05] [INFO ] Flatten gal took : 86 ms
[2024-06-01 16:50:05] [INFO ] Flatten gal took : 67 ms
[2024-06-01 16:50:05] [INFO ] Input system was already deterministic with 1246 transitions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1247/1247 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1247
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1246
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1246
Applied a total of 7 rules in 34 ms. Remains 903 /909 variables (removed 6) and now considering 1246/1247 (removed 1) transitions.
Running 1240 sub problems to find dead transitions.
[2024-06-01 16:50:05] [INFO ] Flow matrix only has 1242 transitions (discarded 4 similar events)
[2024-06-01 16:50:05] [INFO ] Invariant cache hit.
[2024-06-01 16:50:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2145 variables, and 131 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1240/1240 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
[2024-06-01 16:50:47] [INFO ] Deduced a trap composed of 137 places in 173 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2145 variables, and 132 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1240 constraints, Known Traps: 1/1 constraints]
After SMT, in 42245ms problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 42257ms
Finished structural reductions in LTL mode , in 1 iterations and 42294 ms. Remains : 903/909 places, 1246/1247 transitions.
[2024-06-01 16:50:48] [INFO ] Flatten gal took : 46 ms
[2024-06-01 16:50:48] [INFO ] Flatten gal took : 43 ms
[2024-06-01 16:50:48] [INFO ] Input system was already deterministic with 1246 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 909/909 places, 1247/1247 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 904 transition count 1182
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 839 transition count 1182
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 130 place count 839 transition count 1117
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 260 place count 774 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 261 place count 773 transition count 1116
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 773 transition count 1116
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 266 place count 771 transition count 1114
Applied a total of 266 rules in 175 ms. Remains 771 /909 variables (removed 138) and now considering 1114/1247 (removed 133) transitions.
Running 1108 sub problems to find dead transitions.
[2024-06-01 16:50:48] [INFO ] Flow matrix only has 1110 transitions (discarded 4 similar events)
// Phase 1: matrix 1110 rows 771 cols
[2024-06-01 16:50:48] [INFO ] Computed 137 invariants in 16 ms
[2024-06-01 16:50:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1881 variables, and 132 constraints, problems are : Problem set: 0 solved, 1108 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1108/1108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
[2024-06-01 16:51:12] [INFO ] Deduced a trap composed of 350 places in 279 ms of which 5 ms to minimize.
[2024-06-01 16:51:14] [INFO ] Deduced a trap composed of 321 places in 326 ms of which 5 ms to minimize.
[2024-06-01 16:51:16] [INFO ] Deduced a trap composed of 312 places in 321 ms of which 5 ms to minimize.
[2024-06-01 16:51:16] [INFO ] Deduced a trap composed of 357 places in 253 ms of which 3 ms to minimize.
[2024-06-01 16:51:17] [INFO ] Deduced a trap composed of 241 places in 361 ms of which 4 ms to minimize.
[2024-06-01 16:51:17] [INFO ] Deduced a trap composed of 237 places in 283 ms of which 4 ms to minimize.
[2024-06-01 16:51:19] [INFO ] Deduced a trap composed of 237 places in 313 ms of which 4 ms to minimize.
[2024-06-01 16:51:19] [INFO ] Deduced a trap composed of 231 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:51:19] [INFO ] Deduced a trap composed of 241 places in 265 ms of which 3 ms to minimize.
[2024-06-01 16:51:20] [INFO ] Deduced a trap composed of 229 places in 260 ms of which 4 ms to minimize.
[2024-06-01 16:51:20] [INFO ] Deduced a trap composed of 237 places in 306 ms of which 5 ms to minimize.
[2024-06-01 16:51:20] [INFO ] Deduced a trap composed of 238 places in 268 ms of which 4 ms to minimize.
[2024-06-01 16:51:21] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 2 ms to minimize.
[2024-06-01 16:51:22] [INFO ] Deduced a trap composed of 246 places in 318 ms of which 5 ms to minimize.
[2024-06-01 16:51:23] [INFO ] Deduced a trap composed of 347 places in 264 ms of which 4 ms to minimize.
[2024-06-01 16:51:26] [INFO ] Deduced a trap composed of 244 places in 311 ms of which 4 ms to minimize.
[2024-06-01 16:51:27] [INFO ] Deduced a trap composed of 194 places in 343 ms of which 5 ms to minimize.
[2024-06-01 16:51:27] [INFO ] Deduced a trap composed of 184 places in 236 ms of which 5 ms to minimize.
[2024-06-01 16:51:28] [INFO ] Deduced a trap composed of 170 places in 262 ms of which 3 ms to minimize.
[2024-06-01 16:51:28] [INFO ] Deduced a trap composed of 192 places in 277 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1108 unsolved
[2024-06-01 16:51:30] [INFO ] Deduced a trap composed of 237 places in 352 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 1)
(s110 1)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 1)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 1)
(s191 0)
(s192 1)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 1)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 1)
(s216 0)
(s217 1)
(s218 0)
(s219 0)
(s220 1)
(s221 10)
(s222 0)
(s223 0)
(s224 0)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 1)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 1)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 766/1881 variables, and 153 constraints, problems are : Problem set: 0 solved, 1108 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 112/112 constraints, Generalized P Invariants (flows): 20/25 constraints, State Equation: 0/771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1108 constraints, Known Traps: 21/21 constraints]
After SMT, in 42198ms problems are : Problem set: 0 solved, 1108 unsolved
Search for dead transitions found 0 dead transitions in 42208ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 42386 ms. Remains : 771/909 places, 1114/1247 transitions.
[2024-06-01 16:51:30] [INFO ] Flatten gal took : 62 ms
[2024-06-01 16:51:30] [INFO ] Flatten gal took : 52 ms
[2024-06-01 16:51:30] [INFO ] Input system was already deterministic with 1114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1247/1247 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1247
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1246
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1246
Applied a total of 7 rules in 46 ms. Remains 903 /909 variables (removed 6) and now considering 1246/1247 (removed 1) transitions.
Running 1240 sub problems to find dead transitions.
[2024-06-01 16:51:30] [INFO ] Flow matrix only has 1242 transitions (discarded 4 similar events)
// Phase 1: matrix 1242 rows 903 cols
[2024-06-01 16:51:30] [INFO ] Computed 137 invariants in 22 ms
[2024-06-01 16:51:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2145 variables, and 131 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1240/1240 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 3 (OVERLAPS) 6/903 variables, 6/137 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 903/2145 variables, and 137 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1240 constraints, Known Traps: 0/0 constraints]
After SMT, in 42559ms problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 42579ms
Finished structural reductions in LTL mode , in 1 iterations and 42628 ms. Remains : 903/909 places, 1246/1247 transitions.
[2024-06-01 16:52:13] [INFO ] Flatten gal took : 39 ms
[2024-06-01 16:52:13] [INFO ] Flatten gal took : 40 ms
[2024-06-01 16:52:13] [INFO ] Input system was already deterministic with 1246 transitions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1247/1247 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1247
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 903 transition count 1246
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 903 transition count 1246
Applied a total of 7 rules in 56 ms. Remains 903 /909 variables (removed 6) and now considering 1246/1247 (removed 1) transitions.
Running 1240 sub problems to find dead transitions.
[2024-06-01 16:52:13] [INFO ] Flow matrix only has 1242 transitions (discarded 4 similar events)
[2024-06-01 16:52:13] [INFO ] Invariant cache hit.
[2024-06-01 16:52:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2145 variables, and 131 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1240/1240 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1240 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/2145 variables, and 131 constraints, problems are : Problem set: 0 solved, 1240 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1240 constraints, Known Traps: 0/0 constraints]
After SMT, in 42450ms problems are : Problem set: 0 solved, 1240 unsolved
Search for dead transitions found 0 dead transitions in 42465ms
Finished structural reductions in LTL mode , in 1 iterations and 42526 ms. Remains : 903/909 places, 1246/1247 transitions.
[2024-06-01 16:52:56] [INFO ] Flatten gal took : 65 ms
[2024-06-01 16:52:56] [INFO ] Flatten gal took : 55 ms
[2024-06-01 16:52:56] [INFO ] Input system was already deterministic with 1246 transitions.
[2024-06-01 16:52:56] [INFO ] Flatten gal took : 63 ms
[2024-06-01 16:52:56] [INFO ] Flatten gal took : 54 ms
[2024-06-01 16:52:56] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 16:52:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 909 places, 1247 transitions and 6305 arcs took 12 ms.
Total runtime 372319 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBNT-PT-S05J60-CTLCardinality-2024-00
Could not compute solution for formula : PolyORBNT-PT-S05J60-CTLCardinality-2024-03
Could not compute solution for formula : PolyORBNT-PT-S05J60-CTLCardinality-2024-05
Could not compute solution for formula : PolyORBNT-PT-S05J60-CTLCardinality-2024-10
Could not compute solution for formula : PolyORBNT-PT-S05J60-CTLCardinality-2024-13
Could not compute solution for formula : PolyORBNT-PT-S05J60-CTLCardinality-2024-15

BK_STOP 1717260776810

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBNT-PT-S05J60-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/681/ctl_0_
ctl formula name PolyORBNT-PT-S05J60-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/681/ctl_1_
ctl formula name PolyORBNT-PT-S05J60-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/681/ctl_2_
ctl formula name PolyORBNT-PT-S05J60-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/681/ctl_3_
ctl formula name PolyORBNT-PT-S05J60-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/681/ctl_4_
ctl formula name PolyORBNT-PT-S05J60-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/681/ctl_5_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="PolyORBNT-PT-S05J60"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBNT-PT-S05J60, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654447200465"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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