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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 12 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K 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 1.6M 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-d2m05-ReachabilityFireability-2024-00
FORMULA_NAME DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-01
FORMULA_NAME DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-02
FORMULA_NAME DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-03
FORMULA_NAME DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-04
FORMULA_NAME DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-05
FORMULA_NAME DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-06
FORMULA_NAME DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-07
FORMULA_NAME DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-08
FORMULA_NAME DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-09
FORMULA_NAME DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-10
FORMULA_NAME DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-11
FORMULA_NAME DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-12
FORMULA_NAME DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-13
FORMULA_NAME DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-14
FORMULA_NAME DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717190448909

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-d2m05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:20:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:20:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:20:50] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2024-05-31 21:20:50] [INFO ] Transformed 4763 places.
[2024-05-31 21:20:50] [INFO ] Transformed 2478 transitions.
[2024-05-31 21:20:50] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 347 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 3580 places in 19 ms
Reduce places removed 3580 places and 0 transitions.
RANDOM walk for 40000 steps (9110 resets) in 3007 ms. (13 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (191 resets) in 57 ms. (69 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (363 resets) in 149 ms. (26 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (189 resets) in 157 ms. (25 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (178 resets) in 107 ms. (37 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (178 resets) in 239 ms. (16 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (372 resets) in 125 ms. (31 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (173 resets) in 79 ms. (50 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (184 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (165 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (178 resets) in 58 ms. (67 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (168 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (344 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (199 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (193 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (370 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (170 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 206757 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :4 out of 16
Probabilistic random walk after 206757 steps, saw 87283 distinct states, run finished after 3005 ms. (steps per millisecond=68 ) properties seen :4
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 2478 rows 1183 cols
[2024-05-31 21:20:55] [INFO ] Computed 6 invariants in 150 ms
[2024-05-31 21:20:55] [INFO ] State equation strengthened by 1588 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 429/629 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/629 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-03 is UNSAT
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-04 is UNSAT
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-08 is UNSAT
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-09 is UNSAT
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-10 is UNSAT
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-12 is UNSAT
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-13 is UNSAT
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-14 is UNSAT
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 554/1183 variables, 4/6 constraints. Problems are: Problem set: 8 solved, 4 unsolved
[2024-05-31 21:20:58] [INFO ] Deduced a trap composed of 777 places in 776 ms of which 123 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1183 variables, 1/7 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1183 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2478/3661 variables, 1183/1190 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3661 variables, 1588/2778 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3661 variables, 0/2778 constraints. Problems are: Problem set: 8 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3661/3661 variables, and 2778 constraints, problems are : Problem set: 8 solved, 4 unsolved in 5066 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1183/1183 constraints, ReadFeed: 1588/1588 constraints, PredecessorRefiner: 12/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 8 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 491/564 variables, 1/1 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/564 variables, 0/1 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3/567 variables, 1/2 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 616/1183 variables, 4/6 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1183 variables, 1/7 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1183 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2478/3661 variables, 1183/1190 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3661 variables, 1588/2778 constraints. Problems are: Problem set: 8 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3661/3661 variables, and 2780 constraints, problems are : Problem set: 8 solved, 4 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1183/1183 constraints, ReadFeed: 1588/1588 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 11451ms problems are : Problem set: 8 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 73 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1136 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.10 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 353 places :
Symmetric choice reduction at 1 with 353 rule applications. Total rules 571 place count 783 transition count 1593
Iterating global reduction 1 with 353 rules applied. Total rules applied 924 place count 783 transition count 1593
Ensure Unique test removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 1032 place count 783 transition count 1485
Discarding 279 places :
Symmetric choice reduction at 2 with 279 rule applications. Total rules 1311 place count 504 transition count 1206
Iterating global reduction 2 with 279 rules applied. Total rules applied 1590 place count 504 transition count 1206
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1598 place count 504 transition count 1198
Discarding 198 places :
Symmetric choice reduction at 3 with 198 rule applications. Total rules 1796 place count 306 transition count 934
Iterating global reduction 3 with 198 rules applied. Total rules applied 1994 place count 306 transition count 934
Ensure Unique test removed 270 transitions
Reduce isomorphic transitions removed 270 transitions.
Iterating post reduction 3 with 270 rules applied. Total rules applied 2264 place count 306 transition count 664
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 2278 place count 292 transition count 644
Iterating global reduction 4 with 14 rules applied. Total rules applied 2292 place count 292 transition count 644
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 2328 place count 292 transition count 608
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 2335 place count 285 transition count 601
Iterating global reduction 5 with 7 rules applied. Total rules applied 2342 place count 285 transition count 601
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2343 place count 285 transition count 600
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 2349 place count 279 transition count 594
Iterating global reduction 6 with 6 rules applied. Total rules applied 2355 place count 279 transition count 594
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2359 place count 279 transition count 590
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2360 place count 278 transition count 588
Iterating global reduction 7 with 1 rules applied. Total rules applied 2361 place count 278 transition count 588
Applied a total of 2361 rules in 391 ms. Remains 278 /1183 variables (removed 905) and now considering 588/2478 (removed 1890) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 404 ms. Remains : 278/1183 places, 588/2478 transitions.
RANDOM walk for 40000 steps (9134 resets) in 542 ms. (73 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1812 resets) in 282 ms. (141 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1738 resets) in 348 ms. (114 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1799 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1756 resets) in 153 ms. (259 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 578812 steps, run timeout after 3003 ms. (steps per millisecond=192 ) properties seen :1 out of 4
Probabilistic random walk after 578812 steps, saw 229764 distinct states, run finished after 3003 ms. (steps per millisecond=192 ) properties seen :1
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 588 rows 278 cols
[2024-05-31 21:21:10] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 21:21:10] [INFO ] State equation strengthened by 319 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 149/221 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 548/769 variables, 221/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/769 variables, 279/502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 97/866 variables, 57/559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/866 variables, 40/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/866 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/866 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 866/866 variables, and 599 constraints, problems are : Problem set: 0 solved, 3 unsolved in 986 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 278/278 constraints, ReadFeed: 319/319 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 149/221 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 548/769 variables, 221/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/769 variables, 279/502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 97/866 variables, 57/559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/866 variables, 40/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/866 variables, 3/602 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/866 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/866 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 866/866 variables, and 602 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1919 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 278/278 constraints, ReadFeed: 319/319 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2996ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1191 ms.
Support contains 72 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 588/588 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 277 transition count 587
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 277 transition count 587
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 276 transition count 586
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 276 transition count 586
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 275 transition count 582
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 275 transition count 582
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 274 transition count 581
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 274 transition count 581
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 273 transition count 580
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 273 transition count 580
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 272 transition count 579
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 272 transition count 579
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 271 transition count 577
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 271 transition count 577
Applied a total of 14 rules in 69 ms. Remains 271 /278 variables (removed 7) and now considering 577/588 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 271/278 places, 577/588 transitions.
RANDOM walk for 40000 steps (9125 resets) in 558 ms. (71 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1836 resets) in 208 ms. (191 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1772 resets) in 213 ms. (186 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1780 resets) in 145 ms. (273 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 674026 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :0 out of 3
Probabilistic random walk after 674026 steps, saw 270266 distinct states, run finished after 3001 ms. (steps per millisecond=224 ) properties seen :0
// Phase 1: matrix 577 rows 271 cols
[2024-05-31 21:21:18] [INFO ] Computed 2 invariants in 6 ms
[2024-05-31 21:21:18] [INFO ] State equation strengthened by 315 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 144/216 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 539/755 variables, 216/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/755 variables, 277/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/755 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 93/848 variables, 55/550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/848 variables, 38/588 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/848 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/848 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 848/848 variables, and 588 constraints, problems are : Problem set: 0 solved, 3 unsolved in 908 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 271/271 constraints, ReadFeed: 315/315 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 144/216 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 539/755 variables, 216/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/755 variables, 277/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/755 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 93/848 variables, 55/550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/848 variables, 38/588 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/848 variables, 3/591 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/848 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/848 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 848/848 variables, and 591 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1877 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 271/271 constraints, ReadFeed: 315/315 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2885ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1348 ms.
Support contains 72 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 577/577 transitions.
Applied a total of 0 rules in 22 ms. Remains 271 /271 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 271/271 places, 577/577 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 577/577 transitions.
Applied a total of 0 rules in 23 ms. Remains 271 /271 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2024-05-31 21:21:22] [INFO ] Invariant cache hit.
[2024-05-31 21:21:22] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-31 21:21:22] [INFO ] Invariant cache hit.
[2024-05-31 21:21:22] [INFO ] State equation strengthened by 315 read => feed constraints.
[2024-05-31 21:21:23] [INFO ] Implicit Places using invariants and state equation in 1113 ms returned []
Implicit Place search using SMT with State Equation took 1352 ms to find 0 implicit places.
[2024-05-31 21:21:23] [INFO ] Redundant transitions in 36 ms returned []
Running 576 sub problems to find dead transitions.
[2024-05-31 21:21:23] [INFO ] Invariant cache hit.
[2024-05-31 21:21:23] [INFO ] State equation strengthened by 315 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 4 (OVERLAPS) 577/848 variables, 271/273 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/848 variables, 315/588 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/848 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 848/848 variables, and 588 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 271/271 constraints, ReadFeed: 315/315 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 576 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 4 (OVERLAPS) 577/848 variables, 271/273 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/848 variables, 315/588 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/848 variables, 576/1164 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 848/848 variables, and 1164 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 271/271 constraints, ReadFeed: 315/315 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 0/0 constraints]
After SMT, in 62100ms problems are : Problem set: 0 solved, 576 unsolved
Search for dead transitions found 0 dead transitions in 62112ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63538 ms. Remains : 271/271 places, 577/577 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 271 transition count 569
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 8 place count 271 transition count 555
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 28 rules applied. Total rules applied 36 place count 257 transition count 555
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 256 transition count 554
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 256 transition count 554
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 255 transition count 553
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 255 transition count 553
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 52 place count 249 transition count 547
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 58 place count 246 transition count 554
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 66 place count 246 transition count 546
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 77 place count 238 transition count 543
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 82 place count 238 transition count 543
Applied a total of 82 rules in 62 ms. Remains 238 /271 variables (removed 33) and now considering 543/577 (removed 34) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 543 rows 238 cols
[2024-05-31 21:22:26] [INFO ] Computed 3 invariants in 3 ms
[2024-05-31 21:22:26] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 21:22:26] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 6 ms returned sat
[2024-05-31 21:22:26] [INFO ] After 426ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 21:22:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 21:22:26] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:22:27] [INFO ] After 488ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-31 21:22:27] [INFO ] After 874ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-31 21:22:27] [INFO ] After 1324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 1865 ms.
[2024-05-31 21:22:27] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-31 21:22:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 271 places, 577 transitions and 2281 arcs took 6 ms.
[2024-05-31 21:22:28] [INFO ] Flatten gal took : 75 ms
Total runtime 97918 ms.
There are residual formulas that ITS could not solve within timeout
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 : DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-02
Could not compute solution for formula : DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-06
Could not compute solution for formula : DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-15

BK_STOP 1717190548393

--------------------
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 DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/562/inv_0_
rfs formula name DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/562/inv_1_
rfs formula name DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-15
rfs formula type EF
rfs formula formula --invariant=/tmp/562/inv_2_
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="DBSingleClientW-PT-d2m05"
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-d2m05, 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-171624189500559"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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