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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2490.447 93538.00 128489.00 311.20 TTTTT?FFT?FT?FTF 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-171624189600583.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-d2m08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189600583
=====================================================================

--------------------
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 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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 17K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 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-d2m08-ReachabilityFireability-2024-00
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-01
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-02
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-03
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-04
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-05
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-06
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-07
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-08
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-2023-09
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-10
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-11
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-12
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-13
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-14
FORMULA_NAME DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717191202739

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-d2m08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:33:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:33:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:33:24] [INFO ] Load time of PNML (sax parser for PT used): 299 ms
[2024-05-31 21:33:24] [INFO ] Transformed 4763 places.
[2024-05-31 21:33:24] [INFO ] Transformed 2478 transitions.
[2024-05-31 21:33:24] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 436 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 3580 places in 23 ms
Reduce places removed 3580 places and 0 transitions.
RANDOM walk for 40000 steps (9074 resets) in 3012 ms. (13 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (167 resets) in 52 ms. (75 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (800 resets) in 154 ms. (25 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (165 resets) in 103 ms. (38 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (162 resets) in 71 ms. (55 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (386 resets) in 103 ms. (38 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (187 resets) in 75 ms. (52 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (167 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (176 resets) in 124 ms. (32 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (369 resets) in 97 ms. (40 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (75 resets) in 128 ms. (31 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (186 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (358 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (156 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (180 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (169 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (163 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 215264 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :11 out of 16
Probabilistic random walk after 215264 steps, saw 90972 distinct states, run finished after 3006 ms. (steps per millisecond=71 ) properties seen :11
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 2478 rows 1183 cols
[2024-05-31 21:33:29] [INFO ] Computed 6 invariants in 134 ms
[2024-05-31 21:33:29] [INFO ] State equation strengthened by 1588 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 483/590 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-00 is UNSAT
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-15 is UNSAT
FORMULA DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 593/1183 variables, 4/6 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1183 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2478/3661 variables, 1183/1189 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3661 variables, 1588/2777 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3661 variables, 0/2777 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/3661 variables, 0/2777 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3661/3661 variables, and 2777 constraints, problems are : Problem set: 2 solved, 3 unsolved in 2934 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: 5/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 489/584 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-31 21:33:33] [INFO ] Deduced a trap composed of 321 places in 306 ms of which 61 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 599/1183 variables, 4/7 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1183 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2478/3661 variables, 1183/1190 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3661 variables, 1588/2778 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3661/3661 variables, and 2778 constraints, problems are : Problem set: 2 solved, 3 unsolved in 5018 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: 3/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 8913ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 440 ms.
Support contains 95 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 1137 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.8 ms
Discarding 46 places :
Also discarding 0 output transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 199 rules applied. Total rules applied 200 place count 1137 transition count 2279
Discarding 349 places :
Symmetric choice reduction at 1 with 349 rule applications. Total rules 549 place count 788 transition count 1637
Iterating global reduction 1 with 349 rules applied. Total rules applied 898 place count 788 transition count 1637
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Iterating post reduction 1 with 91 rules applied. Total rules applied 989 place count 788 transition count 1546
Discarding 275 places :
Symmetric choice reduction at 2 with 275 rule applications. Total rules 1264 place count 513 transition count 1271
Iterating global reduction 2 with 275 rules applied. Total rules applied 1539 place count 513 transition count 1271
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1547 place count 513 transition count 1263
Discarding 186 places :
Symmetric choice reduction at 3 with 186 rule applications. Total rules 1733 place count 327 transition count 1020
Iterating global reduction 3 with 186 rules applied. Total rules applied 1919 place count 327 transition count 1020
Ensure Unique test removed 250 transitions
Reduce isomorphic transitions removed 250 transitions.
Iterating post reduction 3 with 250 rules applied. Total rules applied 2169 place count 327 transition count 770
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 2181 place count 315 transition count 750
Iterating global reduction 4 with 12 rules applied. Total rules applied 2193 place count 315 transition count 750
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 2232 place count 315 transition count 711
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2235 place count 312 transition count 708
Iterating global reduction 5 with 3 rules applied. Total rules applied 2238 place count 312 transition count 708
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2240 place count 312 transition count 706
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2242 place count 310 transition count 704
Iterating global reduction 6 with 2 rules applied. Total rules applied 2244 place count 310 transition count 704
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2248 place count 310 transition count 700
Applied a total of 2248 rules in 332 ms. Remains 310 /1183 variables (removed 873) and now considering 700/2478 (removed 1778) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 359 ms. Remains : 310/1183 places, 700/2478 transitions.
RANDOM walk for 40000 steps (9273 resets) in 451 ms. (88 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1772 resets) in 185 ms. (215 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (796 resets) in 175 ms. (227 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1804 resets) in 196 ms. (203 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 507520 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :0 out of 3
Probabilistic random walk after 507520 steps, saw 193066 distinct states, run finished after 3001 ms. (steps per millisecond=169 ) properties seen :0
// Phase 1: matrix 700 rows 310 cols
[2024-05-31 21:33:42] [INFO ] Computed 2 invariants in 9 ms
[2024-05-31 21:33:42] [INFO ] State equation strengthened by 396 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 92/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 55/242 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 633/875 variables, 242/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/875 variables, 329/573 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/875 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 135/1010 variables, 68/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1010 variables, 67/708 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1010 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 708 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1080 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 310/310 constraints, ReadFeed: 396/396 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/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 92/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 55/242 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 633/875 variables, 242/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/875 variables, 329/573 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/875 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 135/1010 variables, 68/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1010 variables, 67/708 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1010 variables, 3/711 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1010 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1010 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1010/1010 variables, and 711 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2782 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 310/310 constraints, ReadFeed: 396/396 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3998ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2653 ms.
Support contains 95 out of 310 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 700/700 transitions.
Applied a total of 0 rules in 43 ms. Remains 310 /310 variables (removed 0) and now considering 700/700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 310/310 places, 700/700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 700/700 transitions.
Applied a total of 0 rules in 43 ms. Remains 310 /310 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2024-05-31 21:33:49] [INFO ] Invariant cache hit.
[2024-05-31 21:33:49] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-31 21:33:49] [INFO ] Invariant cache hit.
[2024-05-31 21:33:49] [INFO ] State equation strengthened by 396 read => feed constraints.
[2024-05-31 21:33:50] [INFO ] Implicit Places using invariants and state equation in 1192 ms returned []
Implicit Place search using SMT with State Equation took 1442 ms to find 0 implicit places.
[2024-05-31 21:33:50] [INFO ] Redundant transitions in 34 ms returned []
Running 699 sub problems to find dead transitions.
[2024-05-31 21:33:50] [INFO ] Invariant cache hit.
[2024-05-31 21:33:50] [INFO ] State equation strengthened by 396 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 1 (OVERLAPS) 1/310 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 4 (OVERLAPS) 700/1010 variables, 310/312 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1010 variables, 396/708 constraints. Problems are: Problem set: 0 solved, 699 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/1010 variables, and 708 constraints, problems are : Problem set: 0 solved, 699 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 310/310 constraints, ReadFeed: 396/396 constraints, PredecessorRefiner: 699/699 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 699 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 1 (OVERLAPS) 1/310 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 4 (OVERLAPS) 700/1010 variables, 310/312 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1010 variables, 396/708 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1010 variables, 699/1407 constraints. Problems are: Problem set: 0 solved, 699 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1010/1010 variables, and 1407 constraints, problems are : Problem set: 0 solved, 699 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 310/310 constraints, ReadFeed: 396/396 constraints, PredecessorRefiner: 699/699 constraints, Known Traps: 0/0 constraints]
After SMT, in 62903ms problems are : Problem set: 0 solved, 699 unsolved
Search for dead transitions found 0 dead transitions in 62912ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64443 ms. Remains : 310/310 places, 700/700 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 310 transition count 684
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 19 Pre rules applied. Total rules applied 16 place count 310 transition count 665
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 1 with 38 rules applied. Total rules applied 54 place count 291 transition count 665
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 290 transition count 664
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 290 transition count 664
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 289 transition count 663
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 289 transition count 663
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 72 place count 282 transition count 656
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 280 transition count 661
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 1 with 26 rules applied. Total rules applied 102 place count 280 transition count 635
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 109 place count 280 transition count 628
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 120 place count 273 transition count 624
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 134 place count 273 transition count 624
Applied a total of 134 rules in 143 ms. Remains 273 /310 variables (removed 37) and now considering 624/700 (removed 76) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 624 rows 273 cols
[2024-05-31 21:34:53] [INFO ] Computed 3 invariants in 6 ms
[2024-05-31 21:34:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 21:34:53] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 21:34:53] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 21:34:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 21:34:53] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 21:34:54] [INFO ] After 678ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-31 21:34:55] [INFO ] After 1223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-31 21:34:55] [INFO ] After 1909ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 2204 ms.
[2024-05-31 21:34:55] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-31 21:34:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 310 places, 700 transitions and 2763 arcs took 9 ms.
[2024-05-31 21:34:55] [INFO ] Flatten gal took : 78 ms
Total runtime 91889 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-d2m08-ReachabilityFireability-2024-05
Could not compute solution for formula : DBSingleClientW-PT-d2m08-ReachabilityFireability-2023-09
Could not compute solution for formula : DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-12

BK_STOP 1717191296277

--------------------
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-d2m08-ReachabilityFireability-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/555/inv_0_
rfs formula name DBSingleClientW-PT-d2m08-ReachabilityFireability-2023-09
rfs formula type EF
rfs formula formula --invariant=/tmp/555/inv_1_
rfs formula name DBSingleClientW-PT-d2m08-ReachabilityFireability-2024-12
rfs formula type EF
rfs formula formula --invariant=/tmp/555/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-d2m08"
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-d2m08, 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-171624189600583"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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