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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 948K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.5K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 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 432K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717190113779

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-d1m10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:15:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:15:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:15:15] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2024-05-31 21:15:15] [INFO ] Transformed 1440 places.
[2024-05-31 21:15:15] [INFO ] Transformed 672 transitions.
[2024-05-31 21:15:15] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 241 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1093 places in 7 ms
Reduce places removed 1093 places and 0 transitions.
RANDOM walk for 40000 steps (9160 resets) in 2237 ms. (17 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (189 resets) in 52 ms. (75 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (190 resets) in 50 ms. (78 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (189 resets) in 149 ms. (26 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (175 resets) in 51 ms. (76 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (202 resets) in 61 ms. (64 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (200 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (190 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (176 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (200 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (186 resets) in 176 ms. (22 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (176 resets) in 109 ms. (36 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (211 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (202 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (186 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (166 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (256 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 472646 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :10 out of 16
Probabilistic random walk after 472646 steps, saw 182450 distinct states, run finished after 3009 ms. (steps per millisecond=157 ) properties seen :10
FORMULA DBSingleClientW-PT-d1m10-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m10-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m10-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m10-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m10-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m10-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m10-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m10-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m10-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m10-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 672 rows 347 cols
[2024-05-31 21:15:19] [INFO ] Computed 6 invariants in 38 ms
[2024-05-31 21:15:19] [INFO ] State equation strengthened by 418 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 113/251 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem DBSingleClientW-PT-d1m10-ReachabilityFireability-2024-02 is UNSAT
FORMULA DBSingleClientW-PT-d1m10-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem DBSingleClientW-PT-d1m10-ReachabilityFireability-2024-03 is UNSAT
FORMULA DBSingleClientW-PT-d1m10-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 96/347 variables, 4/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 672/1019 variables, 347/353 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1019 variables, 418/771 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1019 variables, 0/771 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1019 variables, 0/771 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1019/1019 variables, and 771 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1286 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 347/347 constraints, ReadFeed: 418/418 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 133/242 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 105/347 variables, 4/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 672/1019 variables, 347/353 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1019 variables, 418/771 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1019 variables, 4/775 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1019 variables, 0/775 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1019 variables, 0/775 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1019/1019 variables, and 775 constraints, problems are : Problem set: 2 solved, 4 unsolved in 2257 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 347/347 constraints, ReadFeed: 418/418 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 3959ms problems are : Problem set: 2 solved, 4 unsolved
Parikh walk visited 0 properties in 1888 ms.
Support contains 109 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 326 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.3 ms
Discarding 21 places :
Also discarding 0 output transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 326 transition count 592
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 124 place count 283 transition count 540
Iterating global reduction 1 with 43 rules applied. Total rules applied 167 place count 283 transition count 540
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 177 place count 283 transition count 530
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 202 place count 258 transition count 505
Iterating global reduction 2 with 25 rules applied. Total rules applied 227 place count 258 transition count 505
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 235 place count 250 transition count 496
Iterating global reduction 2 with 8 rules applied. Total rules applied 243 place count 250 transition count 496
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 255 place count 250 transition count 484
Applied a total of 255 rules in 115 ms. Remains 250 /347 variables (removed 97) and now considering 484/672 (removed 188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 250/347 places, 484/672 transitions.
RANDOM walk for 40000 steps (9121 resets) in 449 ms. (88 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1822 resets) in 148 ms. (268 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1881 resets) in 286 ms. (139 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (2212 resets) in 186 ms. (213 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (2514 resets) in 243 ms. (163 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 559308 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :1 out of 4
Probabilistic random walk after 559308 steps, saw 215781 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :1
FORMULA DBSingleClientW-PT-d1m10-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 484 rows 250 cols
[2024-05-31 21:15:28] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 21:15:29] [INFO ] State equation strengthened by 272 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 73/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 35/209 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 455/664 variables, 209/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/664 variables, 243/454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/664 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 70/734 variables, 41/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/734 variables, 29/524 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/734 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/734 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 734/734 variables, and 524 constraints, problems are : Problem set: 0 solved, 3 unsolved in 628 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 250/250 constraints, ReadFeed: 272/272 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/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 73/174 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 35/209 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 455/664 variables, 209/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/664 variables, 243/454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/664 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 70/734 variables, 41/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/734 variables, 29/524 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/734 variables, 3/527 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/734 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/734 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 734/734 variables, and 527 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1811 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 250/250 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2559ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1379 ms.
Support contains 101 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 484/484 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 245 transition count 474
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 245 transition count 474
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 245 transition count 464
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 243 transition count 462
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 243 transition count 462
Applied a total of 24 rules in 34 ms. Remains 243 /250 variables (removed 7) and now considering 462/484 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 243/250 places, 462/484 transitions.
RANDOM walk for 40000 steps (9191 resets) in 326 ms. (122 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1842 resets) in 225 ms. (177 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2177 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2452 resets) in 206 ms. (193 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 620870 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :0 out of 3
Probabilistic random walk after 620870 steps, saw 234809 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
// Phase 1: matrix 462 rows 243 cols
[2024-05-31 21:15:36] [INFO ] Computed 2 invariants in 5 ms
[2024-05-31 21:15:36] [INFO ] State equation strengthened by 253 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 70/171 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 33/204 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 440/644 variables, 204/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/644 variables, 231/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/644 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 61/705 variables, 39/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/705 variables, 22/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/705 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/705 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 705/705 variables, and 498 constraints, problems are : Problem set: 0 solved, 3 unsolved in 622 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 243/243 constraints, ReadFeed: 253/253 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/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 70/171 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 33/204 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 440/644 variables, 204/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/644 variables, 231/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/644 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 61/705 variables, 39/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/705 variables, 22/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/705 variables, 3/501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/705 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/705 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 705/705 variables, and 501 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1689 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 243/243 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2407ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 901 ms.
Support contains 101 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 462/462 transitions.
Applied a total of 0 rules in 16 ms. Remains 243 /243 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 243/243 places, 462/462 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 462/462 transitions.
Applied a total of 0 rules in 16 ms. Remains 243 /243 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2024-05-31 21:15:39] [INFO ] Invariant cache hit.
[2024-05-31 21:15:39] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-31 21:15:39] [INFO ] Invariant cache hit.
[2024-05-31 21:15:39] [INFO ] State equation strengthened by 253 read => feed constraints.
[2024-05-31 21:15:40] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
[2024-05-31 21:15:40] [INFO ] Redundant transitions in 30 ms returned []
Running 461 sub problems to find dead transitions.
[2024-05-31 21:15:40] [INFO ] Invariant cache hit.
[2024-05-31 21:15:40] [INFO ] State equation strengthened by 253 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 462/705 variables, 243/245 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/705 variables, 253/498 constraints. Problems are: Problem set: 0 solved, 461 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/705 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 7 (OVERLAPS) 0/705 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 461 unsolved
No progress, stopping.
After SMT solving in domain Real declared 705/705 variables, and 498 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 243/243 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 462/705 variables, 243/245 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/705 variables, 253/498 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/705 variables, 461/959 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/705 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 705/705 variables, and 959 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 243/243 constraints, ReadFeed: 253/253 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 0/0 constraints]
After SMT, in 61393ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 61399ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62118 ms. Remains : 243/243 places, 462/462 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 243 transition count 454
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 8 place count 243 transition count 448
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 20 place count 237 transition count 448
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 30 place count 232 transition count 443
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 1 with 20 rules applied. Total rules applied 50 place count 232 transition count 423
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 232 transition count 418
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 61 place count 227 transition count 417
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 227 transition count 417
Applied a total of 63 rules in 63 ms. Remains 227 /243 variables (removed 16) and now considering 417/462 (removed 45) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 417 rows 227 cols
[2024-05-31 21:16:41] [INFO ] Computed 3 invariants in 7 ms
[2024-05-31 21:16:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 21:16:41] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:16:41] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 21:16:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 21:16:42] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:16:42] [INFO ] After 508ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-31 21:16:42] [INFO ] After 928ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-31 21:16:43] [INFO ] After 1392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 1607 ms.
[2024-05-31 21:16:43] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-05-31 21:16:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 243 places, 462 transitions and 1817 arcs took 5 ms.
[2024-05-31 21:16:43] [INFO ] Flatten gal took : 55 ms
Total runtime 88453 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-d1m10-ReachabilityFireability-2023-10
Could not compute solution for formula : DBSingleClientW-PT-d1m10-ReachabilityFireability-2023-11
Could not compute solution for formula : DBSingleClientW-PT-d1m10-ReachabilityFireability-2023-15

BK_STOP 1717190203860

--------------------
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-d1m10-ReachabilityFireability-2023-10
rfs formula type AG
rfs formula formula --invariant=/tmp/556/inv_0_
rfs formula name DBSingleClientW-PT-d1m10-ReachabilityFireability-2023-11
rfs formula type EF
rfs formula formula --invariant=/tmp/556/inv_1_
rfs formula name DBSingleClientW-PT-d1m10-ReachabilityFireability-2023-15
rfs formula type EF
rfs formula formula --invariant=/tmp/556/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-d1m10"
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-d1m10, 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-171624189500543"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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