fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r480-tall-171624189500567
Last Updated
July 7, 2024

About the Execution of LTSMin+red for DBSingleClientW-PT-d2m06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1659.951 76744.00 102968.00 131.80 FTTFFFFT?FFTTTFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 12:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 12 12:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 12:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 12:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 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-d2m06-ReachabilityFireability-2024-00
FORMULA_NAME DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-01
FORMULA_NAME DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-02
FORMULA_NAME DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-03
FORMULA_NAME DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-04
FORMULA_NAME DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-05
FORMULA_NAME DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-06
FORMULA_NAME DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-07
FORMULA_NAME DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-08
FORMULA_NAME DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-09
FORMULA_NAME DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-10
FORMULA_NAME DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-11
FORMULA_NAME DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-12
FORMULA_NAME DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-13
FORMULA_NAME DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-14
FORMULA_NAME DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717190735777

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-d2m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:25:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:25:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:25:37] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2024-05-31 21:25:37] [INFO ] Transformed 4763 places.
[2024-05-31 21:25:37] [INFO ] Transformed 2478 transitions.
[2024-05-31 21:25:37] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 343 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 3580 places in 17 ms
Reduce places removed 3580 places and 0 transitions.
RANDOM walk for 40000 steps (9195 resets) in 3453 ms. (11 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (354 resets) in 120 ms. (33 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (185 resets) in 61 ms. (64 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (196 resets) in 91 ms. (43 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (184 resets) in 125 ms. (31 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (199 resets) in 72 ms. (54 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (370 resets) in 140 ms. (28 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (167 resets) in 255 ms. (15 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (194 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (172 resets) in 64 ms. (61 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (377 resets) in 132 ms. (30 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (166 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (202 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (173 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (162 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (160 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (392 resets) in 59 ms. (66 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 201013 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :8 out of 16
Probabilistic random walk after 201013 steps, saw 84834 distinct states, run finished after 3010 ms. (steps per millisecond=66 ) properties seen :8
FORMULA DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 2478 rows 1183 cols
[2024-05-31 21:25:42] [INFO ] Computed 6 invariants in 138 ms
[2024-05-31 21:25:42] [INFO ] State equation strengthened by 1588 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 465/599 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/599 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-06 is UNSAT
FORMULA DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-10 is UNSAT
FORMULA DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-11 is UNSAT
FORMULA DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-12 is UNSAT
FORMULA DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-14 is UNSAT
FORMULA DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-15 is UNSAT
FORMULA DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 584/1183 variables, 4/6 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1183 variables, 0/6 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2478/3661 variables, 1183/1189 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3661 variables, 1588/2777 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3661 variables, 0/2777 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/3661 variables, 0/2777 constraints. Problems are: Problem set: 6 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3661/3661 variables, and 2777 constraints, problems are : Problem set: 6 solved, 2 unsolved in 2944 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: 8/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 518/554 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/554 variables, 0/1 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/557 variables, 1/2 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 626/1183 variables, 4/6 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1183 variables, 0/6 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2478/3661 variables, 1183/1189 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3661 variables, 1588/2777 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3661 variables, 1/2778 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3661 variables, 0/2778 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/3661 variables, 0/2778 constraints. Problems are: Problem set: 6 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3661/3661 variables, and 2778 constraints, problems are : Problem set: 6 solved, 2 unsolved in 3948 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: 2/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 7921ms problems are : Problem set: 6 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 574 ms.
Support contains 36 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.7 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 374 places :
Symmetric choice reduction at 1 with 374 rule applications. Total rules 592 place count 762 transition count 1391
Iterating global reduction 1 with 374 rules applied. Total rules applied 966 place count 762 transition count 1391
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 1011 place count 762 transition count 1346
Discarding 298 places :
Symmetric choice reduction at 2 with 298 rule applications. Total rules 1309 place count 464 transition count 1048
Iterating global reduction 2 with 298 rules applied. Total rules applied 1607 place count 464 transition count 1048
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1614 place count 464 transition count 1041
Discarding 219 places :
Symmetric choice reduction at 3 with 219 rule applications. Total rules 1833 place count 245 transition count 736
Iterating global reduction 3 with 219 rules applied. Total rules applied 2052 place count 245 transition count 736
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Iterating post reduction 3 with 254 rules applied. Total rules applied 2306 place count 245 transition count 482
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 2324 place count 227 transition count 454
Iterating global reduction 4 with 18 rules applied. Total rules applied 2342 place count 227 transition count 454
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 2357 place count 227 transition count 439
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 2367 place count 217 transition count 429
Iterating global reduction 5 with 10 rules applied. Total rules applied 2377 place count 217 transition count 429
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2381 place count 217 transition count 425
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 2388 place count 210 transition count 418
Iterating global reduction 6 with 7 rules applied. Total rules applied 2395 place count 210 transition count 418
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 2400 place count 210 transition count 413
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2402 place count 208 transition count 409
Iterating global reduction 7 with 2 rules applied. Total rules applied 2404 place count 208 transition count 409
Applied a total of 2404 rules in 255 ms. Remains 208 /1183 variables (removed 975) and now considering 409/2478 (removed 2069) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 264 ms. Remains : 208/1183 places, 409/2478 transitions.
RANDOM walk for 40000 steps (9231 resets) in 341 ms. (116 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1748 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1771 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1242354 steps, run timeout after 3001 ms. (steps per millisecond=413 ) properties seen :1 out of 2
Probabilistic random walk after 1242354 steps, saw 453628 distinct states, run finished after 3001 ms. (steps per millisecond=413 ) properties seen :1
FORMULA DBSingleClientW-PT-d2m06-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 409 rows 208 cols
[2024-05-31 21:25:54] [INFO ] Computed 2 invariants in 6 ms
[2024-05-31 21:25:54] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 122/157 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 351/508 variables, 157/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 152/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/615 variables, 50/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/615 variables, 57/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/617 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/617 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/617 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/617 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 617/617 variables, and 420 constraints, problems are : Problem set: 0 solved, 1 unsolved in 379 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 208/208 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 122/157 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 351/508 variables, 157/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 152/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/508 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/615 variables, 50/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/615 variables, 57/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/615 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/617 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/617 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/617 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/617 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 617/617 variables, and 421 constraints, problems are : Problem set: 0 solved, 1 unsolved in 597 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 208/208 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1030ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 44 ms.
Support contains 35 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 409/409 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 207 transition count 402
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 207 transition count 402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 206 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 206 transition count 401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 205 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 205 transition count 400
Applied a total of 6 rules in 29 ms. Remains 205 /208 variables (removed 3) and now considering 400/409 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 205/208 places, 400/409 transitions.
RANDOM walk for 40000 steps (9221 resets) in 296 ms. (134 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1789 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1323132 steps, run timeout after 3001 ms. (steps per millisecond=440 ) properties seen :0 out of 1
Probabilistic random walk after 1323132 steps, saw 479020 distinct states, run finished after 3001 ms. (steps per millisecond=440 ) properties seen :0
// Phase 1: matrix 400 rows 205 cols
[2024-05-31 21:25:58] [INFO ] Computed 2 invariants in 7 ms
[2024-05-31 21:25:58] [INFO ] State equation strengthened by 202 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/156 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 350/506 variables, 156/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 152/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/506 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 99/605 variables, 49/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/605 variables, 50/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/605 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/605 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 605/605 variables, and 409 constraints, problems are : Problem set: 0 solved, 1 unsolved in 419 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 205/205 constraints, ReadFeed: 202/202 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 121/156 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 350/506 variables, 156/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 152/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/506 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 99/605 variables, 49/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/605 variables, 50/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/605 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/605 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/605 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 605/605 variables, and 410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 475 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 205/205 constraints, ReadFeed: 202/202 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 933ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 35 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 400/400 transitions.
Applied a total of 0 rules in 12 ms. Remains 205 /205 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 205/205 places, 400/400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 400/400 transitions.
Applied a total of 0 rules in 11 ms. Remains 205 /205 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-31 21:25:59] [INFO ] Invariant cache hit.
[2024-05-31 21:25:59] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-31 21:25:59] [INFO ] Invariant cache hit.
[2024-05-31 21:25:59] [INFO ] State equation strengthened by 202 read => feed constraints.
[2024-05-31 21:26:00] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
[2024-05-31 21:26:00] [INFO ] Redundant transitions in 28 ms returned []
Running 399 sub problems to find dead transitions.
[2024-05-31 21:26:00] [INFO ] Invariant cache hit.
[2024-05-31 21:26:00] [INFO ] State equation strengthened by 202 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (OVERLAPS) 1/205 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (OVERLAPS) 400/605 variables, 205/207 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/605 variables, 202/409 constraints. Problems are: Problem set: 0 solved, 399 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/605 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 7 (OVERLAPS) 0/605 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 399 unsolved
No progress, stopping.
After SMT solving in domain Real declared 605/605 variables, and 409 constraints, problems are : Problem set: 0 solved, 399 unsolved in 19687 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 205/205 constraints, ReadFeed: 202/202 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 399 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (OVERLAPS) 1/205 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 4 (OVERLAPS) 400/605 variables, 205/207 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/605 variables, 202/409 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/605 variables, 399/808 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/605 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 605/605 variables, and 808 constraints, problems are : Problem set: 0 solved, 399 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 205/205 constraints, ReadFeed: 202/202 constraints, PredecessorRefiner: 399/399 constraints, Known Traps: 0/0 constraints]
After SMT, in 50767ms problems are : Problem set: 0 solved, 399 unsolved
Search for dead transitions found 0 dead transitions in 50774ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51884 ms. Remains : 205/205 places, 400/400 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 205 transition count 391
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 17 Pre rules applied. Total rules applied 9 place count 205 transition count 374
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 1 with 34 rules applied. Total rules applied 43 place count 188 transition count 374
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 187 transition count 373
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 187 transition count 373
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 186 transition count 372
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 186 transition count 372
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 63 place count 178 transition count 364
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 176 transition count 372
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 74 place count 176 transition count 372
Applied a total of 74 rules in 36 ms. Remains 176 /205 variables (removed 29) and now considering 372/400 (removed 28) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 372 rows 176 cols
[2024-05-31 21:26:51] [INFO ] Computed 3 invariants in 3 ms
[2024-05-31 21:26:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 21:26:51] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:26:51] [INFO ] After 307ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:26:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 21:26:51] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:26:51] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:26:51] [INFO ] After 309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:26:52] [INFO ] After 444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 819 ms.
[2024-05-31 21:26:52] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-31 21:26:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 205 places, 400 transitions and 1580 arcs took 5 ms.
[2024-05-31 21:26:52] [INFO ] Flatten gal took : 54 ms
Total runtime 75190 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-d2m06-ReachabilityFireability-2024-08

BK_STOP 1717190812521

--------------------
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-d2m06-ReachabilityFireability-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/551/inv_0_
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-d2m06"
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-d2m06, 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-171624189500567"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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