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.r480-tall-171624189500527.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 DBSingleClientW-PT-d1m08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189500527
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 12 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K May 18 16:42 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 DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-00
FORMULA_NAME DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-01
FORMULA_NAME DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-02
FORMULA_NAME DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-03
FORMULA_NAME DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-04
FORMULA_NAME DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-05
FORMULA_NAME DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-06
FORMULA_NAME DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-07
FORMULA_NAME DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-08
FORMULA_NAME DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-09
FORMULA_NAME DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-10
FORMULA_NAME DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-11
FORMULA_NAME DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-12
FORMULA_NAME DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-13
FORMULA_NAME DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-14
FORMULA_NAME DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717189725762

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:08:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:08:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:08:47] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2024-05-31 21:08:47] [INFO ] Transformed 1440 places.
[2024-05-31 21:08:47] [INFO ] Transformed 672 transitions.
[2024-05-31 21:08:47] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 252 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1093 places in 7 ms
Reduce places removed 1093 places and 0 transitions.
RANDOM walk for 40000 steps (9200 resets) in 2372 ms. (16 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (181 resets) in 125 ms. (31 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (187 resets) in 98 ms. (40 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (183 resets) in 129 ms. (30 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (191 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (208 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (181 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (63 resets) in 403 ms. (9 steps per ms) remains 14/16 properties
FORMULA DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4003 steps (191 resets) in 71 ms. (55 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (184 resets) in 33 ms. (117 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (189 resets) in 29 ms. (133 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (161 resets) in 25 ms. (153 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (166 resets) in 24 ms. (160 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (206 resets) in 29 ms. (133 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (399 resets) in 38 ms. (102 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (220 resets) in 34 ms. (114 steps per ms) remains 14/14 properties
// Phase 1: matrix 672 rows 347 cols
[2024-05-31 21:08:48] [INFO ] Computed 6 invariants in 35 ms
[2024-05-31 21:08:48] [INFO ] State equation strengthened by 418 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 109/252 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-06 is UNSAT
FORMULA DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-07 is UNSAT
FORMULA DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-11 is UNSAT
FORMULA DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-15 is UNSAT
FORMULA DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 95/347 variables, 4/6 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 672/1019 variables, 347/353 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1019 variables, 418/771 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1019 variables, 0/771 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/1019 variables, 0/771 constraints. Problems are: Problem set: 4 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1019/1019 variables, and 771 constraints, problems are : Problem set: 4 solved, 10 unsolved in 1951 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 347/347 constraints, ReadFeed: 418/418 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 154/233 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 114/347 variables, 4/6 constraints. Problems are: Problem set: 4 solved, 10 unsolved
[2024-05-31 21:08:51] [INFO ] Deduced a trap composed of 183 places in 195 ms of which 54 ms to minimize.
[2024-05-31 21:08:51] [INFO ] Deduced a trap composed of 99 places in 154 ms of which 3 ms to minimize.
[2024-05-31 21:08:52] [INFO ] Deduced a trap composed of 122 places in 144 ms of which 3 ms to minimize.
[2024-05-31 21:08:52] [INFO ] Deduced a trap composed of 127 places in 150 ms of which 2 ms to minimize.
[2024-05-31 21:08:52] [INFO ] Deduced a trap composed of 110 places in 142 ms of which 3 ms to minimize.
[2024-05-31 21:08:52] [INFO ] Deduced a trap composed of 127 places in 137 ms of which 3 ms to minimize.
[2024-05-31 21:08:52] [INFO ] Deduced a trap composed of 119 places in 136 ms of which 2 ms to minimize.
[2024-05-31 21:08:52] [INFO ] Deduced a trap composed of 206 places in 149 ms of which 2 ms to minimize.
[2024-05-31 21:08:53] [INFO ] Deduced a trap composed of 176 places in 152 ms of which 2 ms to minimize.
[2024-05-31 21:08:53] [INFO ] Deduced a trap composed of 206 places in 153 ms of which 2 ms to minimize.
[2024-05-31 21:08:53] [INFO ] Deduced a trap composed of 119 places in 149 ms of which 2 ms to minimize.
[2024-05-31 21:08:53] [INFO ] Deduced a trap composed of 122 places in 151 ms of which 3 ms to minimize.
[2024-05-31 21:08:53] [INFO ] Deduced a trap composed of 211 places in 151 ms of which 3 ms to minimize.
[2024-05-31 21:08:53] [INFO ] Deduced a trap composed of 99 places in 153 ms of which 3 ms to minimize.
[2024-05-31 21:08:54] [INFO ] Deduced a trap composed of 99 places in 152 ms of which 2 ms to minimize.
[2024-05-31 21:08:54] [INFO ] Deduced a trap composed of 86 places in 147 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 16/22 constraints. Problems are: Problem set: 4 solved, 10 unsolved
[2024-05-31 21:08:54] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 2 ms to minimize.
[2024-05-31 21:08:54] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 2 ms to minimize.
[2024-05-31 21:08:54] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 3 ms to minimize.
[2024-05-31 21:08:54] [INFO ] Deduced a trap composed of 186 places in 154 ms of which 3 ms to minimize.
[2024-05-31 21:08:55] [INFO ] Deduced a trap composed of 99 places in 146 ms of which 3 ms to minimize.
[2024-05-31 21:08:55] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 3 ms to minimize.
[2024-05-31 21:08:55] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 2 ms to minimize.
[2024-05-31 21:08:55] [INFO ] Deduced a trap composed of 213 places in 156 ms of which 3 ms to minimize.
[2024-05-31 21:08:55] [INFO ] Deduced a trap composed of 220 places in 142 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 9/31 constraints. Problems are: Problem set: 4 solved, 10 unsolved
[2024-05-31 21:08:56] [INFO ] Deduced a trap composed of 160 places in 125 ms of which 3 ms to minimize.
[2024-05-31 21:08:56] [INFO ] Deduced a trap composed of 199 places in 116 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 347/1019 variables, and 33 constraints, problems are : Problem set: 4 solved, 10 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/347 constraints, ReadFeed: 0/418 constraints, PredecessorRefiner: 0/14 constraints, Known Traps: 27/27 constraints]
After SMT, in 7502ms problems are : Problem set: 4 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 79 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 326 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.3 ms
Discarding 21 places :
Also discarding 0 output transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 326 transition count 592
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 138 place count 269 transition count 487
Iterating global reduction 1 with 57 rules applied. Total rules applied 195 place count 269 transition count 487
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 211 place count 269 transition count 471
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 251 place count 229 transition count 431
Iterating global reduction 2 with 40 rules applied. Total rules applied 291 place count 229 transition count 431
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 293 place count 229 transition count 429
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 309 place count 213 transition count 409
Iterating global reduction 3 with 16 rules applied. Total rules applied 325 place count 213 transition count 409
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 339 place count 213 transition count 395
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 341 place count 211 transition count 393
Iterating global reduction 4 with 2 rules applied. Total rules applied 343 place count 211 transition count 393
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 345 place count 209 transition count 391
Iterating global reduction 4 with 2 rules applied. Total rules applied 347 place count 209 transition count 391
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 349 place count 207 transition count 389
Iterating global reduction 4 with 2 rules applied. Total rules applied 351 place count 207 transition count 389
Applied a total of 351 rules in 121 ms. Remains 207 /347 variables (removed 140) and now considering 389/672 (removed 283) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 207/347 places, 389/672 transitions.
RANDOM walk for 40000 steps (9189 resets) in 578 ms. (69 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1885 resets) in 206 ms. (193 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1953 resets) in 211 ms. (188 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1869 resets) in 158 ms. (251 steps per ms) remains 9/10 properties
FORMULA DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (1924 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1906 resets) in 138 ms. (287 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1817 resets) in 149 ms. (266 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1912 resets) in 147 ms. (270 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1914 resets) in 116 ms. (341 steps per ms) remains 8/9 properties
FORMULA DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (3847 resets) in 122 ms. (325 steps per ms) remains 8/8 properties
// Phase 1: matrix 389 rows 207 cols
[2024-05-31 21:08:57] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 21:08:57] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 64/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 38/164 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 353/517 variables, 164/166 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 169/335 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 79/596 variables, 43/378 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/596 variables, 36/414 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/596 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 21:08:57] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/596 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/596 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/596 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 596/596 variables, and 415 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1119 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 207/207 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 64/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 38/164 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 353/517 variables, 164/166 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 169/335 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 79/596 variables, 43/378 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/596 variables, 36/414 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/596 variables, 8/422 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/596 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/596 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/596 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 596/596 variables, and 423 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2256 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 207/207 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 3454ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 2349 ms.
Support contains 62 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 389/389 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 197 transition count 371
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 197 transition count 371
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 189 transition count 362
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 189 transition count 362
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 189 transition count 359
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 187 transition count 355
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 187 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 187 transition count 353
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 186 transition count 352
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 186 transition count 352
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 185 transition count 351
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 185 transition count 351
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 184 transition count 350
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 184 transition count 350
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 183 transition count 348
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 183 transition count 348
Applied a total of 53 rules in 45 ms. Remains 183 /207 variables (removed 24) and now considering 348/389 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 183/207 places, 348/389 transitions.
RANDOM walk for 40000 steps (9233 resets) in 371 ms. (107 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1863 resets) in 144 ms. (275 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1869 resets) in 163 ms. (243 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1881 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1931 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1844 resets) in 77 ms. (512 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1832 resets) in 69 ms. (571 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1884 resets) in 136 ms. (291 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3927 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 306132 steps, run visited all 8 properties in 808 ms. (steps per millisecond=378 )
Probabilistic random walk after 306132 steps, saw 120325 distinct states, run finished after 812 ms. (steps per millisecond=377 ) properties seen :8
FORMULA DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m08-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 17082 ms.
ITS solved all properties within timeout

BK_STOP 1717189744245

--------------------
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

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="DBSingleClientW-PT-d1m08"
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 DBSingleClientW-PT-d1m08, 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 r480-tall-171624189500527"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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