Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r168-tall-174881266700277.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
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 r168-tall-174881266700277
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 13K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 33K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 180K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 35K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 40K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 209K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 807K May 29 14:32 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 1748899618073

Invoking MCC driver with
BK_TOOL=gold2024
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 greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 21:26:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-02 21:26:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:26:59] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2025-06-02 21:26:59] [INFO ] Transformed 690 places.
[2025-06-02 21:26:59] [INFO ] Transformed 1434 transitions.
[2025-06-02 21:26:59] [INFO ] Parsed PT model containing 690 places and 1434 transitions and 6564 arcs in 362 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 4 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 123 ms. Remains 472 /690 variables (removed 218) and now considering 1090/1434 (removed 344) transitions.
Running 1088 sub problems to find dead transitions.
[2025-06-02 21:26:59] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
// Phase 1: matrix 1074 rows 472 cols
[2025-06-02 21:26:59] [INFO ] Computed 52 invariants in 52 ms
[2025-06-02 21:26:59] [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
[2025-06-02 21:27:10] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 13 ms to minimize.
[2025-06-02 21:27:10] [INFO ] Deduced a trap composed of 46 places in 192 ms of which 1 ms to minimize.
[2025-06-02 21:27:10] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 1 ms to minimize.
[2025-06-02 21:27:10] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 1 ms to minimize.
[2025-06-02 21:27:11] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 1 ms to minimize.
[2025-06-02 21:27:11] [INFO ] Deduced a trap composed of 47 places in 311 ms of which 1 ms to minimize.
[2025-06-02 21:27:12] [INFO ] Deduced a trap composed of 46 places in 166 ms of which 2 ms to minimize.
[2025-06-02 21:27:12] [INFO ] Deduced a trap composed of 47 places in 482 ms of which 1 ms to minimize.
[2025-06-02 21:27:13] [INFO ] Deduced a trap composed of 178 places in 868 ms of which 6 ms to minimize.
[2025-06-02 21:27:14] [INFO ] Deduced a trap composed of 170 places in 473 ms of which 11 ms to minimize.
[2025-06-02 21:27:15] [INFO ] Deduced a trap composed of 57 places in 224 ms of which 2 ms to minimize.
[2025-06-02 21:27:15] [INFO ] Deduced a trap composed of 75 places in 162 ms of which 2 ms to minimize.
[2025-06-02 21:27:15] [INFO ] Deduced a trap composed of 55 places in 180 ms of which 2 ms to minimize.
[2025-06-02 21:27:17] [INFO ] Deduced a trap composed of 79 places in 233 ms of which 4 ms to minimize.
[2025-06-02 21:27:17] [INFO ] Deduced a trap composed of 172 places in 224 ms of which 3 ms to minimize.
[2025-06-02 21:27:20] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/1546 variables, and 66 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 20065 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: 16/16 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, 16/66 constraints. Problems are: Problem set: 0 solved, 1088 unsolved
[2025-06-02 21:27:29] [INFO ] Deduced a trap composed of 158 places in 229 ms of which 3 ms to minimize.
[2025-06-02 21:27:31] [INFO ] Deduced a trap composed of 304 places in 229 ms of which 3 ms to minimize.
[2025-06-02 21:27:31] [INFO ] Deduced a trap composed of 286 places in 221 ms of which 3 ms to minimize.
[2025-06-02 21:27:32] [INFO ] Deduced a trap composed of 284 places in 220 ms of which 3 ms to minimize.
[2025-06-02 21:27:36] [INFO ] Deduced a trap composed of 170 places in 240 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/1546 variables, and 71 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 20025 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: 0/1088 constraints, Known Traps: 21/21 constraints]
After SMT, in 41776ms problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 41814ms
[2025-06-02 21:27:41] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
[2025-06-02 21:27:41] [INFO ] Invariant cache hit.
[2025-06-02 21:27:42] [INFO ] Implicit Places using invariants in 539 ms returned [44, 120, 201, 239, 320, 336, 393, 399]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 546 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 9 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 42542 ms. Remains : 464/690 places, 1090/1434 transitions.
Initial state reduction rules removed 2 formulas.
RANDOM walk for 40000 steps (25 resets) in 3420 ms. (11 steps per ms) remains 129/1088 properties
BEST_FIRST walk for 402 steps (8 resets) in 24 ms. (16 steps per ms) remains 129/129 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 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 16 ms. (23 steps per ms) remains 129/129 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 129/129 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 129/129 properties
BEST_FIRST walk for 400 steps (8 resets) in 19 ms. (20 steps per ms) remains 129/129 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 129/129 properties
BEST_FIRST walk for 402 steps (8 resets) in 17 ms. (22 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 402 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 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 129/129 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 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 402 steps (8 resets) in 12 ms. (30 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 12 ms. (31 steps per ms) remains 129/129 properties
BEST_FIRST walk for 402 steps (8 resets) in 16 ms. (23 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 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 129/129 properties
BEST_FIRST walk for 401 steps (8 resets) in 8 ms. (44 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 11 ms. (33 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 402 steps (8 resets) in 7 ms. (50 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 7 ms. (50 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 401 steps (8 resets) in 6 ms. (57 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 5 ms. (67 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 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 129/129 properties
BEST_FIRST walk for 401 steps (8 resets) in 8 ms. (44 steps per ms) remains 129/129 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 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 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 129/129 properties
BEST_FIRST walk for 401 steps (8 resets) in 8 ms. (44 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 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 129/129 properties
BEST_FIRST walk for 400 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 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 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 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 129/129 properties
[2025-06-02 21:27:43] [INFO ] Flow matrix only has 1074 transitions (discarded 16 similar events)
// Phase 1: matrix 1074 rows 464 cols
[2025-06-02 21:27:43] [INFO ] Computed 44 invariants in 34 ms
[2025-06-02 21:27:43] [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
[2025-06-02 21:27:44] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 3 ms to minimize.
[2025-06-02 21:27:44] [INFO ] Deduced a trap composed of 75 places in 146 ms of which 2 ms to minimize.
[2025-06-02 21:27:44] [INFO ] Deduced a trap composed of 169 places in 172 ms of which 2 ms to minimize.
[2025-06-02 21:27:46] [INFO ] Deduced a trap composed of 73 places in 159 ms of which 2 ms to minimize.
[2025-06-02 21:27:46] [INFO ] Deduced a trap composed of 168 places in 153 ms of which 2 ms to minimize.
[2025-06-02 21:27:46] [INFO ] Deduced a trap composed of 168 places in 150 ms of which 3 ms to minimize.
[2025-06-02 21:27:46] [INFO ] Deduced a trap composed of 175 places in 147 ms of which 3 ms to minimize.
[2025-06-02 21:27:46] [INFO ] Deduced a trap composed of 75 places in 152 ms of which 3 ms to minimize.
[2025-06-02 21:27:46] [INFO ] Deduced a trap composed of 40 places in 171 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
[2025-06-02 21:27:48] [INFO ] Deduced a trap composed of 168 places in 167 ms of which 3 ms to minimize.
[2025-06-02 21:27:48] [INFO ] Deduced a trap composed of 168 places in 149 ms of which 2 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 5016 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
[2025-06-02 21:27:51] [INFO ] Deduced a trap composed of 168 places in 146 ms of which 3 ms to minimize.
[2025-06-02 21:27:52] [INFO ] Deduced a trap composed of 172 places in 153 ms of which 2 ms to minimize.
[2025-06-02 21:27:53] [INFO ] Deduced a trap composed of 172 places in 155 ms of which 5 ms to minimize.
[2025-06-02 21:27:53] [INFO ] Deduced a trap composed of 175 places in 152 ms of which 2 ms to minimize.
[2025-06-02 21:27:53] [INFO ] Deduced a trap composed of 175 places in 152 ms of which 3 ms to minimize.
[2025-06-02 21:27:53] [INFO ] Deduced a trap composed of 175 places in 143 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/1538 variables, and 23 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: 17/17 constraints]
After SMT, in 10286ms 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 111 ms. Remains 460 /464 variables (removed 4) and now considering 1086/1090 (removed 4) transitions.
Running 1084 sub problems to find dead transitions.
[2025-06-02 21:27:53] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
// Phase 1: matrix 1070 rows 460 cols
[2025-06-02 21:27:53] [INFO ] Computed 44 invariants in 25 ms
[2025-06-02 21:27:53] [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
[2025-06-02 21:28:03] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 2 ms to minimize.
[2025-06-02 21:28:03] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 2 ms to minimize.
[2025-06-02 21:28:03] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2025-06-02 21:28:03] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2025-06-02 21:28:03] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2025-06-02 21:28:03] [INFO ] Deduced a trap composed of 47 places in 221 ms of which 3 ms to minimize.
[2025-06-02 21:28:04] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 3 ms to minimize.
[2025-06-02 21:28:04] [INFO ] Deduced a trap composed of 159 places in 203 ms of which 3 ms to minimize.
[2025-06-02 21:28:04] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2025-06-02 21:28:04] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 0 ms to minimize.
[2025-06-02 21:28:04] [INFO ] Deduced a trap composed of 274 places in 230 ms of which 3 ms to minimize.
[2025-06-02 21:28:05] [INFO ] Deduced a trap composed of 175 places in 228 ms of which 3 ms to minimize.
[2025-06-02 21:28:05] [INFO ] Deduced a trap composed of 168 places in 235 ms of which 3 ms to minimize.
[2025-06-02 21:28:07] [INFO ] Deduced a trap composed of 47 places in 227 ms of which 3 ms to minimize.
[2025-06-02 21:28:08] [INFO ] Deduced a trap composed of 76 places in 212 ms of which 3 ms to minimize.
[2025-06-02 21:28:08] [INFO ] Deduced a trap composed of 63 places in 145 ms of which 2 ms to minimize.
[2025-06-02 21:28:12] [INFO ] Deduced a trap composed of 61 places in 141 ms of which 2 ms to minimize.
[2025-06-02 21:28:13] [INFO ] Deduced a trap composed of 280 places in 206 ms of which 2 ms to minimize.
[2025-06-02 21:28:13] [INFO ] Deduced a trap composed of 284 places in 197 ms of which 2 ms to minimize.
[2025-06-02 21:28:15] [INFO ] Deduced a trap composed of 184 places in 204 ms of which 3 ms to minimize.
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 20022 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
[2025-06-02 21:28:22] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2025-06-02 21:28:27] [INFO ] Deduced a trap composed of 284 places in 210 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/1530 variables, and 64 constraints, problems are : Problem set: 0 solved, 1084 unsolved in 20023 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: 22/22 constraints]
After SMT, in 41397ms problems are : Problem set: 0 solved, 1084 unsolved
Search for dead transitions found 0 dead transitions in 41407ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41522 ms. Remains : 460/464 places, 1086/1090 transitions.
RANDOM walk for 4000000 steps (1637 resets) in 54514 ms. (73 steps per ms) remains 128/129 properties
BEST_FIRST walk for 40003 steps (10 resets) in 311 ms. (128 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (9 resets) in 378 ms. (105 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40001 steps (13 resets) in 465 ms. (85 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (10 resets) in 306 ms. (130 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40004 steps (11 resets) in 402 ms. (99 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (12 resets) in 350 ms. (113 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40001 steps (10 resets) in 288 ms. (138 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (9 resets) in 376 ms. (106 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (12 resets) in 477 ms. (83 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (10 resets) in 368 ms. (108 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (13 resets) in 311 ms. (128 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40001 steps (13 resets) in 360 ms. (110 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (12 resets) in 439 ms. (90 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (11 resets) in 384 ms. (103 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (9 resets) in 310 ms. (128 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (12 resets) in 371 ms. (107 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40001 steps (9 resets) in 344 ms. (115 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (12 resets) in 363 ms. (109 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (9 resets) in 346 ms. (115 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (8 resets) in 415 ms. (96 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40000 steps (12 resets) in 312 ms. (127 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (11 resets) in 398 ms. (100 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40001 steps (12 resets) in 430 ms. (92 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (10 resets) in 350 ms. (113 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (11 resets) in 415 ms. (96 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (9 resets) in 368 ms. (108 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (12 resets) in 314 ms. (126 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40001 steps (10 resets) in 381 ms. (104 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (10 resets) in 314 ms. (126 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (11 resets) in 386 ms. (103 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (11 resets) in 359 ms. (111 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (11 resets) in 400 ms. (99 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (12 resets) in 446 ms. (89 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40001 steps (10 resets) in 391 ms. (102 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40001 steps (11 resets) in 402 ms. (99 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (8 resets) in 407 ms. (98 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40000 steps (8 resets) in 430 ms. (92 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (9 resets) in 438 ms. (91 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (11 resets) in 413 ms. (96 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (12 resets) in 301 ms. (132 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (10 resets) in 426 ms. (93 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (8 resets) in 425 ms. (93 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (10 resets) in 354 ms. (112 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (13 resets) in 434 ms. (91 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (10 resets) in 355 ms. (112 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40004 steps (13 resets) in 319 ms. (125 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (13 resets) in 434 ms. (91 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (11 resets) in 419 ms. (95 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40002 steps (13 resets) in 420 ms. (95 steps per ms) remains 128/128 properties
BEST_FIRST walk for 40003 steps (13 resets) in 413 ms. (96 steps per ms) remains 128/128 properties
Interrupted probabilistic random walk after 1987145 steps, run timeout after 63001 ms. (steps per millisecond=31 ) properties seen :0 out of 128
Probabilistic random walk after 1987145 steps, saw 1067850 distinct states, run finished after 63013 ms. (steps per millisecond=31 ) properties seen :0
[2025-06-02 21:29:59] [INFO ] Flow matrix only has 1070 transitions (discarded 16 similar events)
[2025-06-02 21:29:59] [INFO ] Invariant cache hit.
[2025-06-02 21:29:59] [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
[2025-06-02 21:29:59] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 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 4521ms, 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 63 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 64 ms. Remains : 460/460 places, 1086/1086 transitions.
Total runtime 184631 ms.
ITS solved all properties within timeout

BK_STOP 1748899804214

--------------------
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="gold2024"
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-5832"
echo " Executing tool gold2024"
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 r168-tall-174881266700277"
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.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 ;