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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 24K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 163K Apr 11 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 251K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K Apr 11 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 295K Apr 11 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 807K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717269617372

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:20:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 19:20:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:20:19] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2024-06-01 19:20:19] [INFO ] Transformed 690 places.
[2024-06-01 19:20:19] [INFO ] Transformed 1434 transitions.
[2024-06-01 19:20:19] [INFO ] Parsed PT model containing 690 places and 1434 transitions and 6564 arcs in 261 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 690/690 places, 1434/1434 transitions.
Ensure Unique test removed 2 places
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 202 rules applied. Total rules applied 202 place count 688 transition count 1234
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 274 place count 616 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 274 place count 616 transition count 1154
Deduced a syphon composed of 80 places in 6 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 434 place count 536 transition count 1154
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 6 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 562 place count 472 transition count 1090
Applied a total of 562 rules in 138 ms. Remains 472 /690 variables (removed 218) and now considering 1090/1434 (removed 344) transitions.
Running 1088 sub problems to find dead transitions.
[2024-06-01 19:20:19] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
// Phase 1: matrix 1074 rows 472 cols
[2024-06-01 19:20:19] [INFO ] Computed 52 invariants in 45 ms
[2024-06-01 19:20:19] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2024-06-01 19:20:29] [INFO ] Deduced a trap composed of 46 places in 122 ms of which 18 ms to minimize.
[2024-06-01 19:20:29] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:20:29] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:20:29] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:20:29] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:20:29] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 0 ms to minimize.
[2024-06-01 19:20:30] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:20:30] [INFO ] Deduced a trap composed of 47 places in 281 ms of which 3 ms to minimize.
[2024-06-01 19:20:31] [INFO ] Deduced a trap composed of 178 places in 355 ms of which 11 ms to minimize.
[2024-06-01 19:20:31] [INFO ] Deduced a trap composed of 170 places in 275 ms of which 3 ms to minimize.
[2024-06-01 19:20:31] [INFO ] Deduced a trap composed of 57 places in 148 ms of which 2 ms to minimize.
[2024-06-01 19:20:31] [INFO ] Deduced a trap composed of 75 places in 167 ms of which 2 ms to minimize.
[2024-06-01 19:20:32] [INFO ] Deduced a trap composed of 55 places in 225 ms of which 4 ms to minimize.
[2024-06-01 19:20:33] [INFO ] Deduced a trap composed of 79 places in 272 ms of which 4 ms to minimize.
[2024-06-01 19:20:34] [INFO ] Deduced a trap composed of 172 places in 263 ms of which 4 ms to minimize.
[2024-06-01 19:20:36] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:20:38] [INFO ] Deduced a trap composed of 158 places in 182 ms of which 2 ms to minimize.
[2024-06-01 19:20:40] [INFO ] Deduced a trap composed of 191 places in 247 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/1546 variables, and 68 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 20070 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 36/38 constraints, State Equation: 0/472 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1088/1088 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1088 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2024-06-01 19:20:55] [INFO ] Deduced a trap composed of 298 places in 228 ms of which 3 ms to minimize.
[2024-06-01 19:21:00] [INFO ] Deduced a trap composed of 156 places in 250 ms of which 4 ms to minimize.
[2024-06-01 19:21:01] [INFO ] Deduced a trap composed of 174 places in 208 ms of which 2 ms to minimize.
[2024-06-01 19:21:01] [INFO ] Deduced a trap composed of 206 places in 210 ms of which 3 ms to minimize.
SMT process timed out in 42072ms, After SMT, problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 42114ms
[2024-06-01 19:21:01] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2024-06-01 19:21:01] [INFO ] Invariant cache hit.
[2024-06-01 19:21:01] [INFO ] Implicit Places using invariants in 527 ms returned [44, 120, 201, 239, 320, 336, 393, 399]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 539 ms to find 8 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 464/690 places, 1090/1434 transitions.
Applied a total of 0 rules in 27 ms. Remains 464 /464 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 42874 ms. Remains : 464/690 places, 1090/1434 transitions.
Initial state reduction rules removed 2 formulas.
RANDOM walk for 40000 steps (18 resets) in 3774 ms. (10 steps per ms) remains 129/1088 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 129/129 properties
BEST_FIRST walk for 401 steps (8 resets) in 12 ms. (30 steps per ms) remains 129/129 properties
BEST_FIRST walk for 402 steps (8 resets) in 18 ms. (21 steps per ms) remains 129/129 properties
BEST_FIRST walk for 403 steps (8 resets) in 43 ms. (9 steps per ms) remains 129/129 properties
BEST_FIRST walk for 402 steps (8 resets) in 18 ms. (21 steps per ms) remains 129/129 properties
BEST_FIRST walk for 401 steps (8 resets) in 19 ms. (20 steps per ms) remains 129/129 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 129/129 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 129/129 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 129/129 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 129/129 properties
BEST_FIRST walk for 401 steps (8 resets) in 9 ms. (40 steps per ms) remains 129/129 properties
BEST_FIRST walk for 401 steps (8 resets) in 17 ms. (22 steps per ms) remains 129/129 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 129/129 properties
BEST_FIRST walk for 401 steps (8 resets) in 9 ms. (40 steps per ms) remains 129/129 properties
BEST_FIRST walk for 400 steps (8 resets) in 11 ms. (33 steps per ms) remains 129/129 properties
BEST_FIRST walk for 401 steps (8 resets) in 10 ms. (36 steps per ms) remains 129/129 properties
BEST_FIRST walk for 401 steps (8 resets) in 6 ms. (57 steps per ms) remains 129/129 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 129/129 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 129/129 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 129/129 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 129/129 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 129/129 properties
BEST_FIRST walk for 401 steps (8 resets) in 6 ms. (57 steps per ms) remains 129/129 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 129/129 properties
BEST_FIRST walk for 401 steps (8 resets) in 6 ms. (57 steps per ms) remains 129/129 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 129/129 properties
BEST_FIRST walk for 401 steps (8 resets) in 10 ms. (36 steps per ms) remains 129/129 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 129/129 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 129/129 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 129/129 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 129/129 properties
BEST_FIRST walk for 401 steps (8 resets) in 18 ms. (21 steps per ms) remains 129/129 properties
BEST_FIRST walk for 401 steps (8 resets) in 12 ms. (30 steps per ms) remains 129/129 properties
BEST_FIRST walk for 401 steps (8 resets) in 7 ms. (50 steps per ms) remains 129/129 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 129/129 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 129/129 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 129/129 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 129/129 properties
BEST_FIRST walk for 401 steps (8 resets) in 6 ms. (57 steps per ms) remains 129/129 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 129/129 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 129/129 properties
BEST_FIRST walk for 401 steps (8 resets) in 9 ms. (40 steps per ms) remains 129/129 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 129/129 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 129/129 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 129/129 properties
BEST_FIRST walk for 401 steps (8 resets) in 6 ms. (57 steps per ms) remains 129/129 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 129/129 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 129/129 properties
BEST_FIRST walk for 401 steps (8 resets) in 6 ms. (57 steps per ms) remains 129/129 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 129/129 properties
[2024-06-01 19:21:03] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
// Phase 1: matrix 1074 rows 464 cols
[2024-06-01 19:21:03] [INFO ] Computed 44 invariants in 28 ms
[2024-06-01 19:21:03] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 318/373 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 19:21:04] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 2 ms to minimize.
[2024-06-01 19:21:04] [INFO ] Deduced a trap composed of 75 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:21:04] [INFO ] Deduced a trap composed of 169 places in 154 ms of which 3 ms to minimize.
[2024-06-01 19:21:06] [INFO ] Deduced a trap composed of 73 places in 207 ms of which 5 ms to minimize.
[2024-06-01 19:21:06] [INFO ] Deduced a trap composed of 168 places in 250 ms of which 2 ms to minimize.
[2024-06-01 19:21:06] [INFO ] Deduced a trap composed of 168 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:21:06] [INFO ] Deduced a trap composed of 175 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:21:06] [INFO ] Deduced a trap composed of 75 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:21:07] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 19:21:08] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 4 ms to minimize.
[2024-06-01 19:21:08] [INFO ] Deduced a trap composed of 168 places in 174 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 373/1538 variables, and 17 constraints, problems are : Problem set: 0 solved, 129 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/17 constraints, Generalized P Invariants (flows): 2/27 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 318/373 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/1538 variables, and 17 constraints, problems are : Problem set: 0 solved, 129 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/17 constraints, Generalized P Invariants (flows): 2/27 constraints, State Equation: 0/464 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/129 constraints, Known Traps: 11/11 constraints]
After SMT, in 10366ms problems are : Problem set: 0 solved, 129 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 55 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1090/1090 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 460 transition count 1086
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 460 transition count 1086
Applied a total of 8 rules in 142 ms. Remains 460 /464 variables (removed 4) and now considering 1086/1090 (removed 4) transitions.
Running 1084 sub problems to find dead transitions.
[2024-06-01 19:21:13] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
// Phase 1: matrix 1070 rows 460 cols
[2024-06-01 19:21:13] [INFO ] Computed 44 invariants in 31 ms
[2024-06-01 19:21:13] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2024-06-01 19:21:22] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:21:23] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 4 ms to minimize.
[2024-06-01 19:21:23] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:21:23] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:21:23] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:21:23] [INFO ] Deduced a trap composed of 47 places in 224 ms of which 3 ms to minimize.
[2024-06-01 19:21:23] [INFO ] Deduced a trap composed of 160 places in 257 ms of which 4 ms to minimize.
[2024-06-01 19:21:24] [INFO ] Deduced a trap composed of 159 places in 205 ms of which 2 ms to minimize.
[2024-06-01 19:21:24] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:21:24] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 0 ms to minimize.
[2024-06-01 19:21:24] [INFO ] Deduced a trap composed of 274 places in 219 ms of which 3 ms to minimize.
[2024-06-01 19:21:24] [INFO ] Deduced a trap composed of 175 places in 185 ms of which 3 ms to minimize.
[2024-06-01 19:21:25] [INFO ] Deduced a trap composed of 168 places in 205 ms of which 3 ms to minimize.
[2024-06-01 19:21:26] [INFO ] Deduced a trap composed of 47 places in 279 ms of which 4 ms to minimize.
[2024-06-01 19:21:27] [INFO ] Deduced a trap composed of 76 places in 197 ms of which 2 ms to minimize.
[2024-06-01 19:21:27] [INFO ] Deduced a trap composed of 63 places in 155 ms of which 3 ms to minimize.
[2024-06-01 19:21:30] [INFO ] Deduced a trap composed of 61 places in 193 ms of which 3 ms to minimize.
[2024-06-01 19:21:31] [INFO ] Deduced a trap composed of 280 places in 289 ms of which 4 ms to minimize.
[2024-06-01 19:21:32] [INFO ] Deduced a trap composed of 284 places in 260 ms of which 3 ms to minimize.
[2024-06-01 19:21:33] [INFO ] Deduced a trap composed of 184 places in 205 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 (/ 1.0 3.0))
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 10.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/1530 variables, and 62 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1084/1084 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1084 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
[2024-06-01 19:21:41] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:21:46] [INFO ] Deduced a trap composed of 284 places in 268 ms of which 3 ms to minimize.
[2024-06-01 19:21:53] [INFO ] Deduced a trap composed of 178 places in 207 ms of which 3 ms to minimize.
[2024-06-01 19:21:53] [INFO ] Deduced a trap composed of 177 places in 192 ms of which 8 ms to minimize.
[2024-06-01 19:21:53] [INFO ] Deduced a trap composed of 224 places in 200 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/1530 variables, and 67 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/460 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1084 constraints, Known Traps: 25/25 constraints]
After SMT, in 41857ms problems are : Problem set: 0 solved, 1084 unsolved
Search for dead transitions found 0 dead transitions in 41868ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42016 ms. Remains : 460/464 places, 1086/1090 transitions.
RANDOM walk for 4000000 steps (1676 resets) in 84618 ms. (47 steps per ms) remains 128/129 properties
BEST_FIRST walk for 40000 steps (11 resets) in 410 ms. (97 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (9 resets) in 474 ms. (84 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (9 resets) in 503 ms. (79 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (12 resets) in 494 ms. (80 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40001 steps (12 resets) in 653 ms. (61 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40001 steps (9 resets) in 354 ms. (112 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (9 resets) in 395 ms. (101 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (11 resets) in 585 ms. (68 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (10 resets) in 362 ms. (110 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (14 resets) in 491 ms. (81 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40004 steps (11 resets) in 409 ms. (97 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (12 resets) in 395 ms. (101 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40001 steps (9 resets) in 387 ms. (103 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40004 steps (12 resets) in 391 ms. (102 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40004 steps (10 resets) in 368 ms. (108 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (12 resets) in 380 ms. (104 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (11 resets) in 404 ms. (98 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40004 steps (14 resets) in 391 ms. (102 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (9 resets) in 427 ms. (93 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (11 resets) in 386 ms. (103 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (9 resets) in 381 ms. (104 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40004 steps (11 resets) in 359 ms. (111 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40004 steps (11 resets) in 401 ms. (99 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40004 steps (13 resets) in 268 ms. (148 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (11 resets) in 364 ms. (109 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (10 resets) in 382 ms. (104 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (10 resets) in 380 ms. (104 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (11 resets) in 387 ms. (103 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (14 resets) in 329 ms. (121 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40001 steps (9 resets) in 286 ms. (139 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (11 resets) in 283 ms. (140 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (11 resets) in 378 ms. (105 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40000 steps (9 resets) in 412 ms. (96 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (11 resets) in 389 ms. (102 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (9 resets) in 385 ms. (103 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (10 resets) in 376 ms. (106 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (11 resets) in 414 ms. (96 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40000 steps (15 resets) in 395 ms. (101 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (9 resets) in 392 ms. (101 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (11 resets) in 391 ms. (102 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (12 resets) in 409 ms. (97 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40004 steps (10 resets) in 389 ms. (102 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40000 steps (11 resets) in 356 ms. (112 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40004 steps (9 resets) in 330 ms. (120 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40004 steps (13 resets) in 395 ms. (101 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (11 resets) in 436 ms. (91 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (11 resets) in 423 ms. (94 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (10 resets) in 405 ms. (98 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (11 resets) in 403 ms. (99 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (11 resets) in 430 ms. (92 steps per ms) remains 128/128 properties
Interrupted probabilistic random walk after 2658560 steps, run timeout after 102001 ms. (steps per millisecond=26 ) properties seen :0 out of 128
Probabilistic random walk after 2658560 steps, saw 1394540 distinct states, run finished after 102029 ms. (steps per millisecond=26 ) properties seen :0
[2024-06-01 19:24:12] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2024-06-01 19:24:12] [INFO ] Invariant cache hit.
[2024-06-01 19:24:12] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 143/196 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-01 19:24:13] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 102/298 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 6/304 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Problem qltransition_1 is UNSAT
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
SMT process timed out in 3786ms, After SMT, problems are : Problem set: 0 solved, 128 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1086/1086 transitions.
Applied a total of 0 rules in 35 ms. Remains 460 /460 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 460/460 places, 1086/1086 transitions.
Total runtime 237659 ms.
ITS solved all properties within timeout

BK_STOP 1717269856958

--------------------
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 QuasiLiveness -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-PT-S02J06T08"
export BK_EXAMINATION="QuasiLiveness"
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-PT-S02J06T08, examination is QuasiLiveness"
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-171654455700157"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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