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.r518-tajo-171654455500064.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-S02J06T06, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r518-tajo-171654455500064
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.9K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 11 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.1K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 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

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1717269333278

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-COL-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:15:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-06-01 19:15:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:15:35] [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 19:15:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 19:15:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1006 ms
[2024-06-01 19:15:36] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 536 PT places and 1096.0 transition bindings in 47 ms.
[2024-06-01 19:15:36] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-06-01 19:15:36] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2024-06-01 19:15:36] [INFO ] Unfolded HLPN to a Petri net with 536 places and 1064 transitions 4866 arcs in 106 ms.
[2024-06-01 19:15:36] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2024-06-01 19:15:36] [INFO ] Unfolded HLPN to a Petri net with 536 places and 1064 transitions 4866 arcs in 28 ms.
[2024-06-01 19:15:36] [INFO ] Unfolded 65 HLPN properties in 16 ms.
[2024-06-01 19:15:36] [INFO ] Reduced 6 identical enabling conditions.
[2024-06-01 19:15:36] [INFO ] Reduced 24 identical enabling conditions.
[2024-06-01 19:15:36] [INFO ] Reduced 66 identical enabling conditions.
[2024-06-01 19:15:36] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 2 ms.
[2024-06-01 19:15:36] [INFO ] Skeletonized 65 HLPN properties in 6 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
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
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 19:15:36] [INFO ] Unfolded HLPN to a Petri net with 536 places and 1064 transitions 4866 arcs in 27 ms.
[2024-06-01 19:15:36] [INFO ] Unfolded 65 HLPN properties in 0 ms.
[2024-06-01 19:15:36] [INFO ] Reduced 6 identical enabling conditions.
[2024-06-01 19:15:36] [INFO ] Reduced 24 identical enabling conditions.
[2024-06-01 19:15:36] [INFO ] Reduced 66 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Built sparse matrix representations for Structural reductions in 3 ms.18302KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 536/536 places, 968/968 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 112 ms. Remains 536 /536 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Running 966 sub problems to find dead transitions.
[2024-06-01 19:15:37] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2024-06-01 19:15:37] [INFO ] Computed 50 invariants in 83 ms
[2024-06-01 19:15:37] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-06-01 19:15:48] [INFO ] Deduced a trap composed of 73 places in 189 ms of which 20 ms to minimize.
[2024-06-01 19:15:48] [INFO ] Deduced a trap composed of 73 places in 153 ms of which 3 ms to minimize.
[2024-06-01 19:15:48] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 13 ms to minimize.
[2024-06-01 19:15:48] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:15:48] [INFO ] Deduced a trap composed of 73 places in 132 ms of which 1 ms to minimize.
[2024-06-01 19:15:49] [INFO ] Deduced a trap composed of 280 places in 438 ms of which 12 ms to minimize.
[2024-06-01 19:15:50] [INFO ] Deduced a trap composed of 280 places in 331 ms of which 7 ms to minimize.
[2024-06-01 19:15:51] [INFO ] Deduced a trap composed of 146 places in 1544 ms of which 4 ms to minimize.
[2024-06-01 19:15:54] [INFO ] Deduced a trap composed of 292 places in 2261 ms of which 4 ms to minimize.
[2024-06-01 19:15:54] [INFO ] Deduced a trap composed of 298 places in 305 ms of which 4 ms to minimize.
[2024-06-01 19:15:55] [INFO ] Deduced a trap composed of 268 places in 331 ms of which 4 ms to minimize.
[2024-06-01 19:15:55] [INFO ] Deduced a trap composed of 261 places in 280 ms of which 3 ms to minimize.
[2024-06-01 19:15:56] [INFO ] Deduced a trap composed of 74 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1492 variables, and 59 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20122 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-06-01 19:16:01] [INFO ] Deduced a trap composed of 277 places in 205 ms of which 3 ms to minimize.
[2024-06-01 19:16:01] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 2 ms to minimize.
[2024-06-01 19:16:06] [INFO ] Deduced a trap composed of 37 places in 266 ms of which 3 ms to minimize.
[2024-06-01 19:16:06] [INFO ] Deduced a trap composed of 371 places in 311 ms of which 4 ms to minimize.
[2024-06-01 19:16:06] [INFO ] Deduced a trap composed of 361 places in 282 ms of which 3 ms to minimize.
[2024-06-01 19:16:06] [INFO ] Deduced a trap composed of 369 places in 255 ms of which 3 ms to minimize.
[2024-06-01 19:16:07] [INFO ] Deduced a trap composed of 362 places in 219 ms of which 4 ms to minimize.
[2024-06-01 19:16:07] [INFO ] Deduced a trap composed of 353 places in 262 ms of which 3 ms to minimize.
[2024-06-01 19:16:11] [INFO ] Deduced a trap composed of 260 places in 243 ms of which 4 ms to minimize.
[2024-06-01 19:16:11] [INFO ] Deduced a trap composed of 282 places in 300 ms of which 4 ms to minimize.
[2024-06-01 19:16:12] [INFO ] Deduced a trap composed of 263 places in 291 ms of which 3 ms to minimize.
[2024-06-01 19:16:12] [INFO ] Deduced a trap composed of 250 places in 277 ms of which 4 ms to minimize.
[2024-06-01 19:16:12] [INFO ] Deduced a trap composed of 289 places in 236 ms of which 3 ms to minimize.
[2024-06-01 19:16:13] [INFO ] Deduced a trap composed of 293 places in 272 ms of which 3 ms to minimize.
[2024-06-01 19:16:13] [INFO ] Deduced a trap composed of 264 places in 266 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 15/74 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1492 variables, and 74 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 28/28 constraints]
After SMT, in 42014ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 42109ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 42320 ms. Remains : 536/536 places, 968/968 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 536/536 places, 968/968 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 41 ms. Remains 536 /536 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2024-06-01 19:16:19] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-06-01 19:16:19] [INFO ] Invariant cache hit.
[2024-06-01 19:16:19] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-01 19:16:19] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-06-01 19:16:19] [INFO ] Invariant cache hit.
[2024-06-01 19:16:19] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 19:16:19] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
[2024-06-01 19:16:19] [INFO ] Redundant transitions in 78 ms returned []
Running 966 sub problems to find dead transitions.
[2024-06-01 19:16:19] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-06-01 19:16:19] [INFO ] Invariant cache hit.
[2024-06-01 19:16:19] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-06-01 19:16:29] [INFO ] Deduced a trap composed of 73 places in 170 ms of which 2 ms to minimize.
[2024-06-01 19:16:30] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:16:30] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 1 ms to minimize.
[2024-06-01 19:16:30] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:16:30] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:16:30] [INFO ] Deduced a trap composed of 294 places in 290 ms of which 17 ms to minimize.
[2024-06-01 19:16:31] [INFO ] Deduced a trap composed of 294 places in 295 ms of which 7 ms to minimize.
[2024-06-01 19:16:31] [INFO ] Deduced a trap composed of 146 places in 236 ms of which 4 ms to minimize.
[2024-06-01 19:16:31] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:16:32] [INFO ] Deduced a trap composed of 286 places in 466 ms of which 4 ms to minimize.
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 269 places in 363 ms of which 4 ms to minimize.
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 286 places in 282 ms of which 5 ms to minimize.
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 317 places in 324 ms of which 4 ms to minimize.
[2024-06-01 19:16:34] [INFO ] Deduced a trap composed of 368 places in 339 ms of which 3 ms to minimize.
[2024-06-01 19:16:34] [INFO ] Deduced a trap composed of 339 places in 294 ms of which 4 ms to minimize.
[2024-06-01 19:16:34] [INFO ] Deduced a trap composed of 297 places in 310 ms of which 4 ms to minimize.
[2024-06-01 19:16:35] [INFO ] Deduced a trap composed of 292 places in 294 ms of which 3 ms to minimize.
[2024-06-01 19:16:35] [INFO ] Deduced a trap composed of 260 places in 292 ms of which 4 ms to minimize.
[2024-06-01 19:16:45] [INFO ] Deduced a trap composed of 275 places in 353 ms of which 6 ms to minimize.
[2024-06-01 19:16:45] [INFO ] Deduced a trap composed of 269 places in 314 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1492 variables, and 66 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 966 unsolved
[2024-06-01 19:17:06] [INFO ] Deduced a trap composed of 15 places in 4049 ms of which 28 ms to minimize.
[2024-06-01 19:17:07] [INFO ] Deduced a trap composed of 269 places in 348 ms of which 4 ms to minimize.
[2024-06-01 19:17:07] [INFO ] Deduced a trap composed of 290 places in 270 ms of which 17 ms to minimize.
[2024-06-01 19:17:07] [INFO ] Deduced a trap composed of 363 places in 272 ms of which 3 ms to minimize.
[2024-06-01 19:17:08] [INFO ] Deduced a trap composed of 361 places in 344 ms of which 4 ms to minimize.
[2024-06-01 19:17:08] [INFO ] Deduced a trap composed of 350 places in 280 ms of which 4 ms to minimize.
[2024-06-01 19:17:09] [INFO ] Deduced a trap composed of 358 places in 299 ms of which 3 ms to minimize.
[2024-06-01 19:17:09] [INFO ] Deduced a trap composed of 353 places in 350 ms of which 31 ms to minimize.
[2024-06-01 19:17:09] [INFO ] Deduced a trap composed of 353 places in 267 ms of which 14 ms to minimize.
[2024-06-01 19:17:11] [INFO ] Deduced a trap composed of 362 places in 284 ms of which 3 ms to minimize.
[2024-06-01 19:17:17] [INFO ] Deduced a trap composed of 265 places in 367 ms of which 19 ms to minimize.
[2024-06-01 19:17:17] [INFO ] Deduced a trap composed of 247 places in 398 ms of which 7 ms to minimize.
[2024-06-01 19:17:18] [INFO ] Deduced a trap composed of 282 places in 282 ms of which 5 ms to minimize.
[2024-06-01 19:17:18] [INFO ] Deduced a trap composed of 280 places in 272 ms of which 4 ms to minimize.
[2024-06-01 19:17:19] [INFO ] Deduced a trap composed of 270 places in 254 ms of which 3 ms to minimize.
[2024-06-01 19:17:19] [INFO ] Deduced a trap composed of 259 places in 255 ms of which 4 ms to minimize.
(s230 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 4)
(s1 6)
(s2 1)
(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 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 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 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 10)
(s147 1)
(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 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 1)
(s181 0)
(s182 0)
(s183 1)
(s184 0)
(s185 1)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(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 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 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/1492 variables, and 82 constraints, problems are : Problem set: 0 solved, 966 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 36/36 constraints]
After SMT, in 61385ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 61402ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 62101 ms. Remains : 536/536 places, 968/968 transitions.
Finished random walk after 2129 steps, including 0 resets, run found a deadlock after 17 ms. (steps per millisecond=125 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 106088 ms.
ITS solved all properties within timeout

BK_STOP 1717269441370

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 Liveness -timeout 180 -rebuildPNML

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-S02J06T06"
export BK_EXAMINATION="Liveness"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-S02J06T06, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r518-tajo-171654455500064"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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