Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r520-tall-171662337900127.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is RERS17pb113-PT-2, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337900127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 15M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RERS17pb113-PT-2-ReachabilityFireability-2024-00
FORMULA_NAME RERS17pb113-PT-2-ReachabilityFireability-2024-01
FORMULA_NAME RERS17pb113-PT-2-ReachabilityFireability-2024-02
FORMULA_NAME RERS17pb113-PT-2-ReachabilityFireability-2023-03
FORMULA_NAME RERS17pb113-PT-2-ReachabilityFireability-2024-04
FORMULA_NAME RERS17pb113-PT-2-ReachabilityFireability-2024-05
FORMULA_NAME RERS17pb113-PT-2-ReachabilityFireability-2024-06
FORMULA_NAME RERS17pb113-PT-2-ReachabilityFireability-2024-07
FORMULA_NAME RERS17pb113-PT-2-ReachabilityFireability-2024-08
FORMULA_NAME RERS17pb113-PT-2-ReachabilityFireability-2023-09
FORMULA_NAME RERS17pb113-PT-2-ReachabilityFireability-2024-10
FORMULA_NAME RERS17pb113-PT-2-ReachabilityFireability-2024-11
FORMULA_NAME RERS17pb113-PT-2-ReachabilityFireability-2023-12
FORMULA_NAME RERS17pb113-PT-2-ReachabilityFireability-2024-13
FORMULA_NAME RERS17pb113-PT-2-ReachabilityFireability-2024-14
FORMULA_NAME RERS17pb113-PT-2-ReachabilityFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717223293157

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb113-PT-2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:28:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:28:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:28:15] [INFO ] Load time of PNML (sax parser for PT used): 678 ms
[2024-06-01 06:28:15] [INFO ] Transformed 639 places.
[2024-06-01 06:28:15] [INFO ] Transformed 31353 transitions.
[2024-06-01 06:28:15] [INFO ] Parsed PT model containing 639 places and 31353 transitions and 125418 arcs in 927 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 37 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 5576 ms. (7 steps per ms) remains 9/16 properties
FORMULA RERS17pb113-PT-2-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-2-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-2-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-2-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-2-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-2-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-2-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 838 ms. (47 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 199 ms. (200 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 374 ms. (106 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1366 ms. (29 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 9/9 properties
[2024-06-01 06:28:18] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 639 cols
[2024-06-01 06:28:18] [INFO ] Computed 25 invariants in 104 ms
[2024-06-01 06:28:19] [INFO ] State equation strengthened by 829 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 384/627 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/627 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/639 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/639 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18965/18965 variables, and 664 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5065 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 639/639 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 9/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 384/627 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 06:28:26] [INFO ] Deduced a trap composed of 41 places in 1303 ms of which 29 ms to minimize.
[2024-06-01 06:28:27] [INFO ] Deduced a trap composed of 65 places in 1100 ms of which 2 ms to minimize.
[2024-06-01 06:28:28] [INFO ] Deduced a trap composed of 65 places in 1154 ms of which 2 ms to minimize.
[2024-06-01 06:28:29] [INFO ] Deduced a trap composed of 65 places in 1002 ms of which 2 ms to minimize.
SMT process timed out in 11524ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 243 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 31353/31353 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 627 transition count 31353
Applied a total of 12 rules in 359 ms. Remains 627 /639 variables (removed 12) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 374 ms. Remains : 627/639 places, 31353/31353 transitions.
RANDOM walk for 40000 steps (8 resets) in 1906 ms. (20 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 417 ms. (95 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 348 ms. (114 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 345 ms. (115 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 8/9 properties
FORMULA RERS17pb113-PT-2-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 345 ms. (115 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 251 ms. (158 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
[2024-06-01 06:28:31] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 627 cols
[2024-06-01 06:28:31] [INFO ] Computed 13 invariants in 82 ms
[2024-06-01 06:28:32] [INFO ] State equation strengthened by 829 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 386/627 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/627 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18953/18953 variables, and 640 constraints, problems are : Problem set: 0 solved, 8 unsolved in 45027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 627/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 8/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 386/627 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 06:29:18] [INFO ] Deduced a trap composed of 41 places in 1039 ms of which 3 ms to minimize.
[2024-06-01 06:29:20] [INFO ] Deduced a trap composed of 65 places in 1405 ms of which 2 ms to minimize.
[2024-06-01 06:29:21] [INFO ] Deduced a trap composed of 66 places in 1458 ms of which 2 ms to minimize.
[2024-06-01 06:29:23] [INFO ] Deduced a trap composed of 41 places in 1400 ms of which 3 ms to minimize.
[2024-06-01 06:29:23] [INFO ] Deduced a trap composed of 41 places in 743 ms of which 1 ms to minimize.
[2024-06-01 06:29:24] [INFO ] Deduced a trap composed of 65 places in 865 ms of which 1 ms to minimize.
[2024-06-01 06:29:25] [INFO ] Deduced a trap composed of 49 places in 801 ms of which 1 ms to minimize.
[2024-06-01 06:29:26] [INFO ] Deduced a trap composed of 65 places in 527 ms of which 1 ms to minimize.
[2024-06-01 06:29:26] [INFO ] Deduced a trap composed of 41 places in 638 ms of which 1 ms to minimize.
[2024-06-01 06:29:27] [INFO ] Deduced a trap composed of 65 places in 479 ms of which 1 ms to minimize.
[2024-06-01 06:29:28] [INFO ] Deduced a trap composed of 65 places in 1031 ms of which 6 ms to minimize.
[2024-06-01 06:29:29] [INFO ] Deduced a trap composed of 41 places in 792 ms of which 1 ms to minimize.
[2024-06-01 06:29:30] [INFO ] Deduced a trap composed of 49 places in 620 ms of which 1 ms to minimize.
[2024-06-01 06:29:30] [INFO ] Deduced a trap composed of 65 places in 676 ms of which 1 ms to minimize.
[2024-06-01 06:29:31] [INFO ] Deduced a trap composed of 65 places in 444 ms of which 1 ms to minimize.
[2024-06-01 06:29:32] [INFO ] Deduced a trap composed of 66 places in 699 ms of which 2 ms to minimize.
[2024-06-01 06:29:33] [INFO ] Deduced a trap composed of 49 places in 362 ms of which 0 ms to minimize.
[2024-06-01 06:29:33] [INFO ] Deduced a trap composed of 49 places in 419 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/627 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 06:29:34] [INFO ] Deduced a trap composed of 49 places in 609 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/627 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 18953/18953 variables, and 659 constraints, problems are : Problem set: 0 solved, 8 unsolved in 45026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 627/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 19/19 constraints]
After SMT, in 90791ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 241 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 195 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 627/627 places, 31353/31353 transitions.
RANDOM walk for 40000 steps (8 resets) in 1509 ms. (26 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 346 ms. (115 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 161 ms. (246 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 410 ms. (97 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 219 ms. (181 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 20376 steps, run timeout after 3002 ms. (steps per millisecond=6 ) properties seen :0 out of 8
Probabilistic random walk after 20376 steps, saw 17775 distinct states, run finished after 3006 ms. (steps per millisecond=6 ) properties seen :0
[2024-06-01 06:30:06] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2024-06-01 06:30:06] [INFO ] Invariant cache hit.
[2024-06-01 06:30:07] [INFO ] State equation strengthened by 829 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 386/627 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/627 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18953/18953 variables, and 640 constraints, problems are : Problem set: 0 solved, 8 unsolved in 75042 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 627/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 8/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 386/627 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 06:31:24] [INFO ] Deduced a trap composed of 65 places in 1319 ms of which 5 ms to minimize.
[2024-06-01 06:31:24] [INFO ] Deduced a trap composed of 41 places in 600 ms of which 1 ms to minimize.
[2024-06-01 06:31:25] [INFO ] Deduced a trap composed of 65 places in 659 ms of which 1 ms to minimize.
[2024-06-01 06:31:25] [INFO ] Deduced a trap composed of 49 places in 498 ms of which 0 ms to minimize.
[2024-06-01 06:31:26] [INFO ] Deduced a trap composed of 41 places in 449 ms of which 1 ms to minimize.
[2024-06-01 06:31:27] [INFO ] Deduced a trap composed of 41 places in 1251 ms of which 2 ms to minimize.
[2024-06-01 06:31:28] [INFO ] Deduced a trap composed of 41 places in 1014 ms of which 2 ms to minimize.
[2024-06-01 06:31:29] [INFO ] Deduced a trap composed of 65 places in 429 ms of which 1 ms to minimize.
[2024-06-01 06:31:29] [INFO ] Deduced a trap composed of 65 places in 450 ms of which 1 ms to minimize.
[2024-06-01 06:31:30] [INFO ] Deduced a trap composed of 41 places in 642 ms of which 1 ms to minimize.
[2024-06-01 06:31:31] [INFO ] Deduced a trap composed of 65 places in 875 ms of which 1 ms to minimize.
[2024-06-01 06:31:33] [INFO ] Deduced a trap composed of 65 places in 965 ms of which 5 ms to minimize.
[2024-06-01 06:31:33] [INFO ] Deduced a trap composed of 65 places in 477 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/627 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 06:31:35] [INFO ] Deduced a trap composed of 43 places in 301 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/627 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 06:31:37] [INFO ] Deduced a trap composed of 49 places in 453 ms of which 1 ms to minimize.
[2024-06-01 06:31:37] [INFO ] Deduced a trap composed of 49 places in 459 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/627 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem RERS17pb113-PT-2-ReachabilityFireability-2024-05 is UNSAT
FORMULA RERS17pb113-PT-2-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 18326/18953 variables, 627/656 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18953 variables, 829/1485 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18953 variables, 4/1489 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-01 06:32:35] [INFO ] Deduced a trap composed of 65 places in 788 ms of which 1 ms to minimize.
[2024-06-01 06:32:35] [INFO ] Deduced a trap composed of 49 places in 505 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 18953/18953 variables, and 1491 constraints, problems are : Problem set: 1 solved, 7 unsolved in 75032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 627/627 constraints, ReadFeed: 829/829 constraints, PredecessorRefiner: 8/4 constraints, Known Traps: 18/18 constraints]
After SMT, in 150633ms problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 211 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 184 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 627/627 places, 31353/31353 transitions.
RANDOM walk for 40000 steps (8 resets) in 1569 ms. (25 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 367 ms. (108 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 396 ms. (100 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 231 ms. (172 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 205 ms. (194 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 20606 steps, run timeout after 3001 ms. (steps per millisecond=6 ) properties seen :0 out of 7
Probabilistic random walk after 20606 steps, saw 17975 distinct states, run finished after 3001 ms. (steps per millisecond=6 ) properties seen :0
[2024-06-01 06:32:41] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2024-06-01 06:32:41] [INFO ] Invariant cache hit.
[2024-06-01 06:32:42] [INFO ] State equation strengthened by 829 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 416/627 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/627 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18953/18953 variables, and 640 constraints, problems are : Problem set: 0 solved, 7 unsolved in 90042 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 627/627 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 7/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 416/627 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 06:34:13] [INFO ] Deduced a trap composed of 41 places in 760 ms of which 1 ms to minimize.
[2024-06-01 06:34:14] [INFO ] Deduced a trap composed of 25 places in 1119 ms of which 2 ms to minimize.
[2024-06-01 06:34:15] [INFO ] Deduced a trap composed of 65 places in 1041 ms of which 2 ms to minimize.
[2024-06-01 06:34:16] [INFO ] Deduced a trap composed of 43 places in 711 ms of which 1 ms to minimize.
[2024-06-01 06:34:17] [INFO ] Deduced a trap composed of 49 places in 562 ms of which 1 ms to minimize.
[2024-06-01 06:34:18] [INFO ] Deduced a trap composed of 49 places in 499 ms of which 1 ms to minimize.
[2024-06-01 06:34:18] [INFO ] Deduced a trap composed of 66 places in 599 ms of which 1 ms to minimize.
[2024-06-01 06:34:19] [INFO ] Deduced a trap composed of 49 places in 517 ms of which 1 ms to minimize.
[2024-06-01 06:34:20] [INFO ] Deduced a trap composed of 65 places in 414 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/627 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 06:34:21] [INFO ] Deduced a trap composed of 41 places in 697 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/627 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/627 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 18326/18953 variables, 627/650 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18953 variables, 829/1479 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18953 variables, 4/1483 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 18953/18953 variables, and 1483 constraints, problems are : Problem set: 0 solved, 7 unsolved in 90032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 627/627 constraints, ReadFeed: 829/829 constraints, PredecessorRefiner: 7/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 180572ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 211 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 183 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 627/627 places, 31353/31353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 31353/31353 transitions.
Applied a total of 0 rules in 167 ms. Remains 627 /627 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2024-06-01 06:35:42] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2024-06-01 06:35:42] [INFO ] Invariant cache hit.
[2024-06-01 06:35:44] [INFO ] Implicit Places using invariants in 1398 ms returned []
Implicit Place search using SMT only with invariants took 1406 ms to find 0 implicit places.
Running 31352 sub problems to find dead transitions.
[2024-06-01 06:35:44] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2024-06-01 06:35:44] [INFO ] Invariant cache hit.
[2024-06-01 06:35:45] [INFO ] State equation strengthened by 829 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : RERS17pb113-PT-2-ReachabilityFireability-2024-00
Could not compute solution for formula : RERS17pb113-PT-2-ReachabilityFireability-2024-01
Could not compute solution for formula : RERS17pb113-PT-2-ReachabilityFireability-2024-02
Could not compute solution for formula : RERS17pb113-PT-2-ReachabilityFireability-2023-03
Could not compute solution for formula : RERS17pb113-PT-2-ReachabilityFireability-2024-04
Could not compute solution for formula : RERS17pb113-PT-2-ReachabilityFireability-2024-05
Could not compute solution for formula : RERS17pb113-PT-2-ReachabilityFireability-2024-06
Could not compute solution for formula : RERS17pb113-PT-2-ReachabilityFireability-2024-07
Could not compute solution for formula : RERS17pb113-PT-2-ReachabilityFireability-2024-08
Could not compute solution for formula : RERS17pb113-PT-2-ReachabilityFireability-2023-09
Could not compute solution for formula : RERS17pb113-PT-2-ReachabilityFireability-2024-10
Could not compute solution for formula : RERS17pb113-PT-2-ReachabilityFireability-2024-11
Could not compute solution for formula : RERS17pb113-PT-2-ReachabilityFireability-2023-12
Could not compute solution for formula : RERS17pb113-PT-2-ReachabilityFireability-2024-13
Could not compute solution for formula : RERS17pb113-PT-2-ReachabilityFireability-2024-14
Could not compute solution for formula : RERS17pb113-PT-2-ReachabilityFireability-2023-15

BK_STOP 1717223879102

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name RERS17pb113-PT-2-ReachabilityFireability-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/699/inv_0_
rfs formula name RERS17pb113-PT-2-ReachabilityFireability-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/699/inv_1_
rfs formula name RERS17pb113-PT-2-ReachabilityFireability-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/699/inv_2_
rfs formula name RERS17pb113-PT-2-ReachabilityFireability-2023-03
rfs formula type EF
rfs formula formula --invariant=/tmp/699/inv_3_
rfs formula name RERS17pb113-PT-2-ReachabilityFireability-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/699/inv_4_
rfs formula name RERS17pb113-PT-2-ReachabilityFireability-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/699/inv_5_
rfs formula name RERS17pb113-PT-2-ReachabilityFireability-2024-06
rfs formula type AG
rfs formula formula --invariant=/tmp/699/inv_6_
rfs formula name RERS17pb113-PT-2-ReachabilityFireability-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/699/inv_7_
rfs formula name RERS17pb113-PT-2-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/699/inv_8_
rfs formula name RERS17pb113-PT-2-ReachabilityFireability-2023-09
rfs formula type AG
rfs formula formula --invariant=/tmp/699/inv_9_
rfs formula name RERS17pb113-PT-2-ReachabilityFireability-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/699/inv_10_
rfs formula name RERS17pb113-PT-2-ReachabilityFireability-2024-11
rfs formula type EF
rfs formula formula --invariant=/tmp/699/inv_11_
rfs formula name RERS17pb113-PT-2-ReachabilityFireability-2023-12
rfs formula type EF
rfs formula formula --invariant=/tmp/699/inv_12_
rfs formula name RERS17pb113-PT-2-ReachabilityFireability-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/699/inv_13_
rfs formula name RERS17pb113-PT-2-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/699/inv_14_
rfs formula name RERS17pb113-PT-2-ReachabilityFireability-2023-15
rfs formula type EF
rfs formula formula --invariant=/tmp/699/inv_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="RERS17pb113-PT-2"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is RERS17pb113-PT-2, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r520-tall-171662337900127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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