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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 25K Apr 11 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 46K Apr 11 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 243K Apr 11 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.5K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 58K Apr 11 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 293K Apr 11 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 93K Apr 11 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 478K Apr 11 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K 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 906K 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 1717269555299

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-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:19:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 19:19:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:19:16] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2024-06-01 19:19:16] [INFO ] Transformed 752 places.
[2024-06-01 19:19:16] [INFO ] Transformed 1572 transitions.
[2024-06-01 19:19:16] [INFO ] Parsed PT model containing 752 places and 1572 transitions and 7262 arcs in 270 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 752/752 places, 1572/1572 transitions.
Ensure Unique test removed 2 places
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 750 transition count 1322
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 342 place count 660 transition count 1322
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 342 place count 660 transition count 1242
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 502 place count 580 transition count 1242
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 4 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 662 place count 500 transition count 1162
Applied a total of 662 rules in 132 ms. Remains 500 /752 variables (removed 252) and now considering 1162/1572 (removed 410) transitions.
Running 1160 sub problems to find dead transitions.
[2024-06-01 19:19:17] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
// Phase 1: matrix 1142 rows 500 cols
[2024-06-01 19:19:17] [INFO ] Computed 52 invariants in 61 ms
[2024-06-01 19:19:17] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-06-01 19:19:27] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 13 ms to minimize.
[2024-06-01 19:19:28] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:19:28] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:19:28] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:19:28] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:19:28] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:19:28] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:19:28] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:19:28] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:19:28] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
[2024-06-01 19:19:28] [INFO ] Deduced a trap composed of 54 places in 251 ms of which 4 ms to minimize.
[2024-06-01 19:19:29] [INFO ] Deduced a trap composed of 224 places in 222 ms of which 3 ms to minimize.
[2024-06-01 19:19:29] [INFO ] Deduced a trap composed of 91 places in 243 ms of which 3 ms to minimize.
[2024-06-01 19:19:29] [INFO ] Deduced a trap composed of 204 places in 235 ms of which 3 ms to minimize.
[2024-06-01 19:19:30] [INFO ] Deduced a trap composed of 185 places in 244 ms of which 3 ms to minimize.
[2024-06-01 19:19:30] [INFO ] Deduced a trap composed of 192 places in 304 ms of which 4 ms to minimize.
[2024-06-01 19:19:30] [INFO ] Deduced a trap composed of 183 places in 244 ms of which 3 ms to minimize.
[2024-06-01 19:19:31] [INFO ] Deduced a trap composed of 37 places in 263 ms of which 2 ms to minimize.
[2024-06-01 19:19:32] [INFO ] Deduced a trap composed of 306 places in 297 ms of which 6 ms to minimize.
[2024-06-01 19:19:35] [INFO ] Deduced a trap composed of 79 places in 230 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-06-01 19:19:37] [INFO ] Deduced a trap composed of 198 places in 272 ms of which 4 ms to minimize.
[2024-06-01 19:19:37] [INFO ] Deduced a trap composed of 182 places in 291 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 498/1642 variables, and 72 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 20091 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1160/1160 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/498 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/498 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/498 variables, 22/72 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-06-01 19:19:48] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 2 ms to minimize.
[2024-06-01 19:19:49] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:19:51] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 2 ms to minimize.
[2024-06-01 19:19:52] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 3 ms to minimize.
[2024-06-01 19:19:55] [INFO ] Deduced a trap composed of 232 places in 303 ms of which 4 ms to minimize.
[2024-06-01 19:19:55] [INFO ] Deduced a trap composed of 242 places in 280 ms of which 3 ms to minimize.
[2024-06-01 19:19:55] [INFO ] Deduced a trap composed of 192 places in 256 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 498/1642 variables, and 79 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1160 constraints, Known Traps: 29/29 constraints]
After SMT, in 42208ms problems are : Problem set: 0 solved, 1160 unsolved
Search for dead transitions found 0 dead transitions in 42255ms
[2024-06-01 19:19:59] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
[2024-06-01 19:19:59] [INFO ] Invariant cache hit.
[2024-06-01 19:19:59] [INFO ] Implicit Places using invariants in 637 ms returned [3, 59, 123, 176, 257, 286, 346, 380, 388, 448]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 646 ms to find 10 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 490/752 places, 1162/1572 transitions.
Applied a total of 0 rules in 17 ms. Remains 490 /490 variables (removed 0) and now considering 1162/1162 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 43108 ms. Remains : 490/752 places, 1162/1572 transitions.
Initial state reduction rules removed 2 formulas.
RANDOM walk for 40000 steps (14 resets) in 3155 ms. (12 steps per ms) remains 164/1160 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 164/164 properties
BEST_FIRST walk for 400 steps (8 resets) in 10 ms. (36 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 164/164 properties
BEST_FIRST walk for 401 steps (8 resets) in 33 ms. (11 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 32 ms. (12 steps per ms) remains 164/164 properties
BEST_FIRST walk for 401 steps (8 resets) in 19 ms. (20 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 164/164 properties
BEST_FIRST walk for 401 steps (8 resets) in 15 ms. (25 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 22 ms. (17 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 20 ms. (19 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 15 ms. (25 steps per ms) remains 164/164 properties
BEST_FIRST walk for 400 steps (8 resets) in 33 ms. (11 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 30 ms. (12 steps per ms) remains 164/164 properties
BEST_FIRST walk for 401 steps (8 resets) in 23 ms. (16 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 20 ms. (19 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 22 ms. (17 steps per ms) remains 164/164 properties
BEST_FIRST walk for 401 steps (8 resets) in 16 ms. (23 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 34 ms. (11 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 36 ms. (10 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 25 ms. (15 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 20 ms. (19 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 17 ms. (22 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 20 ms. (19 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 16 ms. (23 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 20 ms. (19 steps per ms) remains 164/164 properties
BEST_FIRST walk for 401 steps (8 resets) in 15 ms. (25 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 164/164 properties
BEST_FIRST walk for 401 steps (8 resets) in 10 ms. (36 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 164/164 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 164/164 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 164/164 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 164/164 properties
BEST_FIRST walk for 401 steps (8 resets) in 7 ms. (50 steps per ms) remains 164/164 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 164/164 properties
BEST_FIRST walk for 401 steps (8 resets) in 7 ms. (50 steps per ms) remains 164/164 properties
BEST_FIRST walk for 401 steps (8 resets) in 7 ms. (50 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 164/164 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 164/164 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 164/164 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 164/164 properties
[2024-06-01 19:20:01] [INFO ] Flow matrix only has 1142 transitions (discarded 20 similar events)
// Phase 1: matrix 1142 rows 490 cols
[2024-06-01 19:20:01] [INFO ] Computed 42 invariants in 19 ms
[2024-06-01 19:20:01] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 2/72 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Problem qltransition_1 is UNSAT
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
SMT process timed out in 1648ms, After SMT, problems are : Problem set: 0 solved, 164 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 70 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 490/490 places, 1162/1162 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 481 transition count 1153
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 481 transition count 1153
Applied a total of 18 rules in 100 ms. Remains 481 /490 variables (removed 9) and now considering 1153/1162 (removed 9) transitions.
Running 1151 sub problems to find dead transitions.
[2024-06-01 19:20:03] [INFO ] Flow matrix only has 1133 transitions (discarded 20 similar events)
// Phase 1: matrix 1133 rows 481 cols
[2024-06-01 19:20:03] [INFO ] Computed 42 invariants in 30 ms
[2024-06-01 19:20:03] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-06-01 19:20:12] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:20:12] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:20:13] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-06-01 19:20:13] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-06-01 19:20:13] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:20:13] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:20:13] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2024-06-01 19:20:13] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:20:13] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:20:13] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-06-01 19:20:13] [INFO ] Deduced a trap composed of 112 places in 300 ms of which 5 ms to minimize.
[2024-06-01 19:20:14] [INFO ] Deduced a trap composed of 197 places in 314 ms of which 4 ms to minimize.
[2024-06-01 19:20:14] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 3 ms to minimize.
[2024-06-01 19:20:15] [INFO ] Deduced a trap composed of 187 places in 351 ms of which 4 ms to minimize.
[2024-06-01 19:20:15] [INFO ] Deduced a trap composed of 176 places in 271 ms of which 4 ms to minimize.
[2024-06-01 19:20:15] [INFO ] Deduced a trap composed of 108 places in 227 ms of which 2 ms to minimize.
[2024-06-01 19:20:16] [INFO ] Deduced a trap composed of 67 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:20:22] [INFO ] Deduced a trap composed of 291 places in 259 ms of which 4 ms to minimize.
[2024-06-01 19:20:22] [INFO ] Deduced a trap composed of 295 places in 296 ms of which 3 ms to minimize.
[2024-06-01 19:20:22] [INFO ] Deduced a trap composed of 309 places in 303 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/1614 variables, and 60 constraints, problems are : Problem set: 0 solved, 1151 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/481 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1151/1151 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/479 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 1151 unsolved
[2024-06-01 19:20:41] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 479/1614 variables, and 61 constraints, problems are : Problem set: 0 solved, 1151 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/481 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1151 constraints, Known Traps: 21/21 constraints]
After SMT, in 42474ms problems are : Problem set: 0 solved, 1151 unsolved
Search for dead transitions found 0 dead transitions in 42489ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42595 ms. Remains : 481/490 places, 1153/1162 transitions.
Total runtime 89129 ms.
ITS solved all properties within timeout

BK_STOP 1717269645860

--------------------
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-S02J04T10"
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-S02J04T10, 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-171654455700147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T10.tgz
mv PolyORBLF-PT-S02J04T10 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 ;