About the Execution of LTSMin+red for PolyORBLF-COL-S06J04T04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16065.659 | 417509.00 | 542584.00 | 187.20 | ?T?????????FTT?? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446500172.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 PolyORBLF-COL-S06J04T04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446500172
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.2K Apr 11 17:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 11 17:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 11 17:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 17:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 11 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 11 17:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S06J04T04-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717250903378
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J04T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:08:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:08:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:08:24] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 14:08:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 14:08:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 718 ms
[2024-06-01 14:08:25] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 454 PT places and 7036.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 14:08:25] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-06-01 14:08:25] [INFO ] Skeletonized 15 HLPN properties in 2 ms. Removed 1 properties that had guard overlaps.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBLF-COL-S06J04T04-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40007 steps (3907 resets) in 1217 ms. (32 steps per ms) remains 11/19 properties
BEST_FIRST walk for 40002 steps (112 resets) in 294 ms. (135 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40001 steps (206 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
[2024-06-01 14:08:26] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 14:08:26] [INFO ] Computed 26 invariants in 13 ms
[2024-06-01 14:08:26] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/49 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/50 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp14 is UNSAT
After SMT solving in domain Real declared 73/145 variables, and 21 constraints, problems are : Problem set: 1 solved, 0 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 12/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 202ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBLF-COL-S06J04T04-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:08:26] [INFO ] Flatten gal took : 26 ms
[2024-06-01 14:08:26] [INFO ] Flatten gal took : 11 ms
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
[2024-06-01 14:08:26] [INFO ] Unfolded HLPN to a Petri net with 454 places and 6994 transitions 59152 arcs in 162 ms.
[2024-06-01 14:08:26] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Support contains 241 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 450 transition count 1610
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 450 transition count 1610
Applied a total of 8 rules in 89 ms. Remains 450 /454 variables (removed 4) and now considering 1610/1614 (removed 4) transitions.
Running 1604 sub problems to find dead transitions.
[2024-06-01 14:08:27] [INFO ] Flow matrix only has 1586 transitions (discarded 24 similar events)
// Phase 1: matrix 1586 rows 450 cols
[2024-06-01 14:08:27] [INFO ] Computed 50 invariants in 70 ms
[2024-06-01 14:08:27] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
[2024-06-01 14:08:53] [INFO ] Deduced a trap composed of 85 places in 199 ms of which 16 ms to minimize.
[2024-06-01 14:08:53] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-06-01 14:08:54] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 2 ms to minimize.
[2024-06-01 14:08:54] [INFO ] Deduced a trap composed of 234 places in 400 ms of which 4 ms to minimize.
[2024-06-01 14:08:55] [INFO ] Deduced a trap composed of 115 places in 370 ms of which 3 ms to minimize.
[2024-06-01 14:08:55] [INFO ] Deduced a trap composed of 106 places in 307 ms of which 3 ms to minimize.
[2024-06-01 14:08:56] [INFO ] Deduced a trap composed of 243 places in 267 ms of which 2 ms to minimize.
[2024-06-01 14:08:57] [INFO ] Deduced a trap composed of 290 places in 374 ms of which 3 ms to minimize.
[2024-06-01 14:08:57] [INFO ] Deduced a trap composed of 255 places in 352 ms of which 2 ms to minimize.
[2024-06-01 14:08:58] [INFO ] Deduced a trap composed of 231 places in 317 ms of which 2 ms to minimize.
[2024-06-01 14:08:58] [INFO ] Deduced a trap composed of 60 places in 493 ms of which 3 ms to minimize.
[2024-06-01 14:08:58] [INFO ] Deduced a trap composed of 244 places in 317 ms of which 2 ms to minimize.
[2024-06-01 14:08:59] [INFO ] Deduced a trap composed of 222 places in 396 ms of which 3 ms to minimize.
[2024-06-01 14:08:59] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 2 ms to minimize.
[2024-06-01 14:09:00] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 1 ms to minimize.
[2024-06-01 14:09:01] [INFO ] Deduced a trap composed of 64 places in 280 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/2036 variables, and 54 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 20056 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 25/33 constraints, State Equation: 0/450 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
[2024-06-01 14:09:05] [INFO ] Deduced a trap composed of 221 places in 349 ms of which 3 ms to minimize.
[2024-06-01 14:09:10] [INFO ] Deduced a trap composed of 232 places in 437 ms of which 3 ms to minimize.
[2024-06-01 14:09:11] [INFO ] Deduced a trap composed of 231 places in 397 ms of which 4 ms to minimize.
[2024-06-01 14:09:11] [INFO ] Deduced a trap composed of 220 places in 442 ms of which 5 ms to minimize.
[2024-06-01 14:09:12] [INFO ] Deduced a trap composed of 221 places in 399 ms of which 3 ms to minimize.
[2024-06-01 14:09:12] [INFO ] Deduced a trap composed of 227 places in 428 ms of which 6 ms to minimize.
[2024-06-01 14:09:12] [INFO ] Deduced a trap composed of 222 places in 368 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(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 0)
(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 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(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 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 9)
(s83 1)
(s84 0)
(s85 1)
(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 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s194 1)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 1)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 1)
(s247 1)
(s248 0)
(s249 1)
(s250 1)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(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 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 7)
(s314 0)
(s315 0)
(s316 0)
(s317 1)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 1)
(s355 1)
(s356 0)
(s357 0)
(s358 0)
(s359 1)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 1)
(s375 0)
(s376 0)
(s377 1)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 1)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 4)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 1)
(s402 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/2036 variables, and 61 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/17 constraints, Generalized P Invariants (flows): 25/33 constraints, State Equation: 0/450 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1604 constraints, Known Traps: 23/23 constraints]
After SMT, in 55703ms problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 55738ms
[2024-06-01 14:09:22] [INFO ] Flow matrix only has 1586 transitions (discarded 24 similar events)
[2024-06-01 14:09:22] [INFO ] Invariant cache hit.
[2024-06-01 14:09:23] [INFO ] Implicit Places using invariants in 217 ms returned [360, 361, 362, 363]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 231 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 446/454 places, 1610/1614 transitions.
Applied a total of 0 rules in 22 ms. Remains 446 /446 variables (removed 0) and now considering 1610/1610 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56110 ms. Remains : 446/454 places, 1610/1614 transitions.
Support contains 241 out of 446 places after structural reductions.
[2024-06-01 14:09:23] [INFO ] Flatten gal took : 228 ms
[2024-06-01 14:09:23] [INFO ] Flatten gal took : 175 ms
[2024-06-01 14:09:23] [INFO ] Input system was already deterministic with 1610 transitions.
Support contains 237 out of 446 places (down from 241) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 654 steps (2 resets) in 116 ms. (5 steps per ms) remains 0/19 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U X(!p1))))'
Support contains 30 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 1610/1610 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 440 transition count 1610
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 436 transition count 1606
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 436 transition count 1606
Applied a total of 14 rules in 29 ms. Remains 436 /446 variables (removed 10) and now considering 1606/1610 (removed 4) transitions.
Running 1600 sub problems to find dead transitions.
[2024-06-01 14:09:24] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
// Phase 1: matrix 1582 rows 436 cols
[2024-06-01 14:09:24] [INFO ] Computed 40 invariants in 50 ms
[2024-06-01 14:09:24] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:09:51] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-06-01 14:09:51] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:09:51] [INFO ] Deduced a trap composed of 84 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:09:51] [INFO ] Deduced a trap composed of 233 places in 381 ms of which 3 ms to minimize.
[2024-06-01 14:09:52] [INFO ] Deduced a trap composed of 230 places in 309 ms of which 3 ms to minimize.
[2024-06-01 14:09:52] [INFO ] Deduced a trap composed of 107 places in 269 ms of which 3 ms to minimize.
[2024-06-01 14:09:52] [INFO ] Deduced a trap composed of 127 places in 268 ms of which 3 ms to minimize.
[2024-06-01 14:09:53] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 2 ms to minimize.
[2024-06-01 14:09:53] [INFO ] Deduced a trap composed of 192 places in 261 ms of which 3 ms to minimize.
[2024-06-01 14:09:53] [INFO ] Deduced a trap composed of 235 places in 264 ms of which 3 ms to minimize.
[2024-06-01 14:09:55] [INFO ] Deduced a trap composed of 285 places in 377 ms of which 2 ms to minimize.
[2024-06-01 14:09:55] [INFO ] Deduced a trap composed of 269 places in 410 ms of which 5 ms to minimize.
[2024-06-01 14:09:56] [INFO ] Deduced a trap composed of 271 places in 451 ms of which 3 ms to minimize.
[2024-06-01 14:09:56] [INFO ] Deduced a trap composed of 286 places in 475 ms of which 3 ms to minimize.
[2024-06-01 14:09:57] [INFO ] Deduced a trap composed of 294 places in 382 ms of which 3 ms to minimize.
[2024-06-01 14:09:57] [INFO ] Deduced a trap composed of 248 places in 414 ms of which 2 ms to minimize.
[2024-06-01 14:09:58] [INFO ] Deduced a trap composed of 244 places in 460 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/2018 variables, and 51 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:10:04] [INFO ] Deduced a trap composed of 69 places in 289 ms of which 6 ms to minimize.
[2024-06-01 14:10:06] [INFO ] Deduced a trap composed of 31 places in 335 ms of which 2 ms to minimize.
[2024-06-01 14:10:07] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 2 ms to minimize.
[2024-06-01 14:10:07] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 2 ms to minimize.
[2024-06-01 14:10:08] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 2 ms to minimize.
[2024-06-01 14:10:08] [INFO ] Deduced a trap composed of 219 places in 379 ms of which 3 ms to minimize.
[2024-06-01 14:10:09] [INFO ] Deduced a trap composed of 218 places in 400 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/2018 variables, and 58 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 24/24 constraints]
After SMT, in 56780ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 56798ms
[2024-06-01 14:10:21] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-06-01 14:10:21] [INFO ] Invariant cache hit.
[2024-06-01 14:10:21] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-06-01 14:10:21] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-06-01 14:10:21] [INFO ] Invariant cache hit.
[2024-06-01 14:10:22] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 14:10:26] [INFO ] Implicit Places using invariants and state equation in 5330 ms returned []
Implicit Place search using SMT with State Equation took 5775 ms to find 0 implicit places.
Running 1600 sub problems to find dead transitions.
[2024-06-01 14:10:27] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-06-01 14:10:27] [INFO ] Invariant cache hit.
[2024-06-01 14:10:27] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:10:54] [INFO ] Deduced a trap composed of 84 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:10:55] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 2 ms to minimize.
[2024-06-01 14:10:55] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 1 ms to minimize.
[2024-06-01 14:10:55] [INFO ] Deduced a trap composed of 224 places in 368 ms of which 3 ms to minimize.
[2024-06-01 14:10:56] [INFO ] Deduced a trap composed of 98 places in 316 ms of which 3 ms to minimize.
[2024-06-01 14:10:56] [INFO ] Deduced a trap composed of 122 places in 384 ms of which 3 ms to minimize.
[2024-06-01 14:10:56] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:10:57] [INFO ] Deduced a trap composed of 210 places in 357 ms of which 4 ms to minimize.
[2024-06-01 14:10:57] [INFO ] Deduced a trap composed of 239 places in 340 ms of which 4 ms to minimize.
[2024-06-01 14:10:59] [INFO ] Deduced a trap composed of 268 places in 469 ms of which 3 ms to minimize.
[2024-06-01 14:10:59] [INFO ] Deduced a trap composed of 246 places in 345 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/2018 variables, and 45 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:11:21] [INFO ] Deduced a trap composed of 219 places in 357 ms of which 3 ms to minimize.
[2024-06-01 14:11:22] [INFO ] Deduced a trap composed of 195 places in 387 ms of which 3 ms to minimize.
[2024-06-01 14:11:22] [INFO ] Deduced a trap composed of 49 places in 244 ms of which 2 ms to minimize.
[2024-06-01 14:11:22] [INFO ] Deduced a trap composed of 53 places in 232 ms of which 2 ms to minimize.
[2024-06-01 14:11:24] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-06-01 14:11:38] [INFO ] Deduced a trap composed of 240 places in 347 ms of which 4 ms to minimize.
[2024-06-01 14:11:39] [INFO ] Deduced a trap composed of 199 places in 313 ms of which 2 ms to minimize.
[2024-06-01 14:11:39] [INFO ] Deduced a trap composed of 220 places in 416 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/2018 variables, and 53 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 19/19 constraints]
After SMT, in 78668ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 78699ms
Starting structural reductions in LTL mode, iteration 1 : 436/446 places, 1606/1610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141312 ms. Remains : 436/446 places, 1606/1610 transitions.
Stuttering acceptance computed with spot in 352 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J04T04-LTLFireability-00
Product exploration explored 100000 steps with 39984 reset in 1114 ms.
Product exploration explored 100000 steps with 40063 reset in 789 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 122 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
RANDOM walk for 493 steps (3 resets) in 12 ms. (37 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 177 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 219 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Support contains 30 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 1606/1606 transitions.
Applied a total of 0 rules in 18 ms. Remains 436 /436 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
Running 1600 sub problems to find dead transitions.
[2024-06-01 14:11:48] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-06-01 14:11:48] [INFO ] Invariant cache hit.
[2024-06-01 14:11:48] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:12:17] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 2 ms to minimize.
[2024-06-01 14:12:17] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:12:17] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 1 ms to minimize.
[2024-06-01 14:12:17] [INFO ] Deduced a trap composed of 224 places in 365 ms of which 3 ms to minimize.
[2024-06-01 14:12:18] [INFO ] Deduced a trap composed of 98 places in 366 ms of which 3 ms to minimize.
[2024-06-01 14:12:18] [INFO ] Deduced a trap composed of 122 places in 307 ms of which 3 ms to minimize.
[2024-06-01 14:12:18] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 0 ms to minimize.
[2024-06-01 14:12:19] [INFO ] Deduced a trap composed of 210 places in 363 ms of which 3 ms to minimize.
[2024-06-01 14:12:19] [INFO ] Deduced a trap composed of 239 places in 335 ms of which 3 ms to minimize.
[2024-06-01 14:12:21] [INFO ] Deduced a trap composed of 268 places in 419 ms of which 3 ms to minimize.
[2024-06-01 14:12:21] [INFO ] Deduced a trap composed of 246 places in 452 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/2018 variables, and 45 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:12:33] [INFO ] Deduced a trap composed of 219 places in 465 ms of which 3 ms to minimize.
[2024-06-01 14:12:34] [INFO ] Deduced a trap composed of 195 places in 410 ms of which 3 ms to minimize.
[2024-06-01 14:12:34] [INFO ] Deduced a trap composed of 49 places in 311 ms of which 1 ms to minimize.
[2024-06-01 14:12:34] [INFO ] Deduced a trap composed of 53 places in 309 ms of which 1 ms to minimize.
[2024-06-01 14:12:36] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/2018 variables, and 50 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 16/16 constraints]
After SMT, in 58534ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 58566ms
[2024-06-01 14:12:47] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-06-01 14:12:47] [INFO ] Invariant cache hit.
[2024-06-01 14:12:47] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-06-01 14:12:47] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-06-01 14:12:47] [INFO ] Invariant cache hit.
[2024-06-01 14:12:48] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 14:12:52] [INFO ] Implicit Places using invariants and state equation in 5027 ms returned []
Implicit Place search using SMT with State Equation took 5357 ms to find 0 implicit places.
Running 1600 sub problems to find dead transitions.
[2024-06-01 14:12:52] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-06-01 14:12:52] [INFO ] Invariant cache hit.
[2024-06-01 14:12:52] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:13:22] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-06-01 14:13:22] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 1 ms to minimize.
[2024-06-01 14:13:22] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 1 ms to minimize.
[2024-06-01 14:13:23] [INFO ] Deduced a trap composed of 224 places in 387 ms of which 3 ms to minimize.
[2024-06-01 14:13:23] [INFO ] Deduced a trap composed of 98 places in 341 ms of which 3 ms to minimize.
[2024-06-01 14:13:24] [INFO ] Deduced a trap composed of 122 places in 307 ms of which 3 ms to minimize.
[2024-06-01 14:13:24] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 1 ms to minimize.
[2024-06-01 14:13:25] [INFO ] Deduced a trap composed of 210 places in 349 ms of which 4 ms to minimize.
[2024-06-01 14:13:25] [INFO ] Deduced a trap composed of 239 places in 359 ms of which 2 ms to minimize.
[2024-06-01 14:13:26] [INFO ] Deduced a trap composed of 268 places in 433 ms of which 3 ms to minimize.
[2024-06-01 14:13:27] [INFO ] Deduced a trap composed of 246 places in 425 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/2018 variables, and 45 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 14:13:48] [INFO ] Deduced a trap composed of 219 places in 367 ms of which 3 ms to minimize.
[2024-06-01 14:13:48] [INFO ] Deduced a trap composed of 195 places in 376 ms of which 3 ms to minimize.
[2024-06-01 14:13:48] [INFO ] Deduced a trap composed of 49 places in 303 ms of which 2 ms to minimize.
[2024-06-01 14:13:49] [INFO ] Deduced a trap composed of 53 places in 338 ms of which 2 ms to minimize.
[2024-06-01 14:13:51] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-06-01 14:14:04] [INFO ] Deduced a trap composed of 240 places in 338 ms of which 3 ms to minimize.
[2024-06-01 14:14:05] [INFO ] Deduced a trap composed of 199 places in 359 ms of which 4 ms to minimize.
[2024-06-01 14:14:06] [INFO ] Deduced a trap composed of 220 places in 375 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/2018 variables, and 53 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 19/19 constraints]
After SMT, in 79190ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 79223ms
Finished structural reductions in LTL mode , in 1 iterations and 143178 ms. Remains : 436/436 places, 1606/1606 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 112 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
RANDOM walk for 586 steps (8 resets) in 15 ms. (36 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 151 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 169 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Product exploration explored 100000 steps with 39957 reset in 911 ms.
Product exploration explored 100000 steps with 39920 reset in 733 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 149 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Support contains 30 out of 436 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 436/436 places, 1606/1606 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 436 transition count 1606
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 32 Pre rules applied. Total rules applied 24 place count 436 transition count 1654
Deduced a syphon composed of 56 places in 1 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 56 place count 436 transition count 1654
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 428 transition count 1646
Deduced a syphon composed of 48 places in 2 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 428 transition count 1646
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 2 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 120 place count 428 transition count 1646
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 136 place count 412 transition count 1630
Deduced a syphon composed of 84 places in 3 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 152 place count 412 transition count 1630
Deduced a syphon composed of 84 places in 3 ms
Applied a total of 152 rules in 222 ms. Remains 412 /436 variables (removed 24) and now considering 1630/1606 (removed -24) transitions.
Running 1624 sub problems to find dead transitions.
[2024-06-01 14:14:15] [INFO ] Flow matrix only has 1606 transitions (discarded 24 similar events)
// Phase 1: matrix 1606 rows 412 cols
[2024-06-01 14:14:15] [INFO ] Computed 40 invariants in 47 ms
[2024-06-01 14:14:15] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1624 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1624 unsolved
[2024-06-01 14:14:42] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:14:42] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:14:42] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:14:42] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
[2024-06-01 14:14:43] [INFO ] Deduced a trap composed of 189 places in 295 ms of which 2 ms to minimize.
[2024-06-01 14:14:43] [INFO ] Deduced a trap composed of 172 places in 366 ms of which 3 ms to minimize.
[2024-06-01 14:14:44] [INFO ] Deduced a trap composed of 195 places in 378 ms of which 3 ms to minimize.
[2024-06-01 14:14:44] [INFO ] Deduced a trap composed of 149 places in 346 ms of which 2 ms to minimize.
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 406/2018 variables, and 42 constraints, problems are : Problem set: 48 solved, 1576 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/412 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1624/1624 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 48 solved, 1576 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 11/11 constraints. Problems are: Problem set: 48 solved, 1576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/382 variables, 21/32 constraints. Problems are: Problem set: 48 solved, 1576 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 8/40 constraints. Problems are: Problem set: 48 solved, 1576 unsolved
[2024-06-01 14:15:07] [INFO ] Deduced a trap composed of 55 places in 240 ms of which 2 ms to minimize.
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
[2024-06-01 14:15:07] [INFO ] Deduced a trap composed of 35 places in 270 ms of which 2 ms to minimize.
[2024-06-01 14:15:08] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 1 ms to minimize.
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
[2024-06-01 14:15:10] [INFO ] Deduced a trap composed of 3 places in 289 ms of which 2 ms to minimize.
Problem TDEAD1594 is UNSAT
[2024-06-01 14:15:13] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 1 ms to minimize.
Problem TDEAD1599 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1609 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/2018 variables, and 45 constraints, problems are : Problem set: 60 solved, 1564 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 11/15 constraints, Generalized P Invariants (flows): 21/25 constraints, State Equation: 0/412 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1624 constraints, Known Traps: 13/13 constraints]
After SMT, in 58545ms problems are : Problem set: 60 solved, 1564 unsolved
Search for dead transitions found 60 dead transitions in 58569ms
Found 60 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 60 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 60 transitions.
[2024-06-01 14:15:13] [INFO ] Redundant transitions in 98 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 412/436 places, 1570/1606 transitions.
Graph (complete) has 2404 edges and 412 vertex of which 376 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.5 ms
Discarding 36 places :
Also discarding 0 output transitions
Deduced a syphon composed of 48 places in 3 ms
Applied a total of 1 rules in 54 ms. Remains 376 /412 variables (removed 36) and now considering 1570/1570 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 376/436 places, 1570/1606 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 58962 ms. Remains : 376/436 places, 1570/1606 transitions.
Support contains 30 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 1606/1606 transitions.
Applied a total of 0 rules in 14 ms. Remains 436 /436 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
Running 1600 sub problems to find dead transitions.
[2024-06-01 14:15:13] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
// Phase 1: matrix 1582 rows 436 cols
[2024-06-01 14:15:13] [INFO ] Computed 40 invariants in 71 ms
[2024-06-01 14:15:14] [INFO ] State equation strengthened by 112 read => feed constraints.
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLFireability-00
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLFireability-01
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLFireability-02
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLFireability-03
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLFireability-04
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLFireability-05
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLFireability-06
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLFireability-07
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLFireability-08
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLFireability-09
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLFireability-10
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLFireability-11
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLFireability-12
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLFireability-13
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLFireability-14
Could not compute solution for formula : PolyORBLF-COL-S06J04T04-LTLFireability-15
BK_STOP 1717251320887
--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBLF-COL-S06J04T04-LTLFireability-00
ltl formula formula --ltl=/tmp/1194/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 2/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 3/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLFireability-01
ltl formula formula --ltl=/tmp/1194/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLFireability-02
ltl formula formula --ltl=/tmp/1194/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLFireability-03
ltl formula formula --ltl=/tmp/1194/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLFireability-04
ltl formula formula --ltl=/tmp/1194/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLFireability-05
ltl formula formula --ltl=/tmp/1194/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLFireability-06
ltl formula formula --ltl=/tmp/1194/ltl_6_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLFireability-07
ltl formula formula --ltl=/tmp/1194/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLFireability-08
ltl formula formula --ltl=/tmp/1194/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLFireability-09
ltl formula formula --ltl=/tmp/1194/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLFireability-10
ltl formula formula --ltl=/tmp/1194/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 2/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 3/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLFireability-11
ltl formula formula --ltl=/tmp/1194/ltl_11_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLFireability-12
ltl formula formula --ltl=/tmp/1194/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLFireability-13
ltl formula formula --ltl=/tmp/1194/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
Warning: program compiled against libxml 210 using older 209
ltl formula name PolyORBLF-COL-S06J04T04-LTLFireability-14
ltl formula formula --ltl=/tmp/1194/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 2/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name PolyORBLF-COL-S06J04T04-LTLFireability-15
ltl formula formula --ltl=/tmp/1194/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 2/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
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="PolyORBLF-COL-S06J04T04"
export BK_EXAMINATION="LTLFireability"
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 PolyORBLF-COL-S06J04T04, examination is LTLFireability"
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-171654446500172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J04T04.tgz
mv PolyORBLF-COL-S06J04T04 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;