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.r091-tall-171624187900511.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 greatspnxred
Input is DBSingleClientW-PT-d1m06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187900511
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K 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.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 12 12:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716291022113

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 11:30:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 11:30:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 11:30:23] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2024-05-21 11:30:23] [INFO ] Transformed 1440 places.
[2024-05-21 11:30:23] [INFO ] Transformed 672 transitions.
[2024-05-21 11:30:23] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 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.
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 40000 steps (9105 resets) in 2888 ms. (13 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (191 resets) in 56 ms. (70 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (179 resets) in 159 ms. (25 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (194 resets) in 135 ms. (29 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (176 resets) in 99 ms. (40 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (192 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (185 resets) in 64 ms. (61 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (203 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (183 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (169 resets) in 154 ms. (25 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (191 resets) in 60 ms. (65 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (196 resets) in 162 ms. (24 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (205 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (192 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (401 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (205 resets) in 294 ms. (13 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 359974 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :10 out of 15
Probabilistic random walk after 359974 steps, saw 142415 distinct states, run finished after 3019 ms. (steps per millisecond=119 ) properties seen :10
FORMULA DBSingleClientW-PT-d1m06-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m06-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m06-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m06-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m06-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m06-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m06-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m06-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m06-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m06-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d1m06-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 672 rows 347 cols
[2024-05-21 11:30:27] [INFO ] Computed 6 invariants in 33 ms
[2024-05-21 11:30:28] [INFO ] State equation strengthened by 418 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 144/227 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem DBSingleClientW-PT-d1m06-ReachabilityFireability-2024-01 is UNSAT
FORMULA DBSingleClientW-PT-d1m06-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem DBSingleClientW-PT-d1m06-ReachabilityFireability-2024-09 is UNSAT
FORMULA DBSingleClientW-PT-d1m06-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem DBSingleClientW-PT-d1m06-ReachabilityFireability-2024-14 is UNSAT
FORMULA DBSingleClientW-PT-d1m06-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 120/347 variables, 4/6 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 672/1019 variables, 347/353 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1019 variables, 418/771 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1019 variables, 0/771 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1019 variables, 0/771 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1019/1019 variables, and 771 constraints, problems are : Problem set: 3 solved, 2 unsolved in 789 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: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 175/215 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 132/347 variables, 4/6 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 672/1019 variables, 347/353 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1019 variables, 418/771 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1019 variables, 2/773 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1019 variables, 0/773 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1019 variables, 0/773 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1019/1019 variables, and 773 constraints, problems are : Problem set: 3 solved, 2 unsolved in 1412 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: 2/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 2559ms problems are : Problem set: 3 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 219 ms.
Support contains 40 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 325 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 325 transition count 584
Discarding 73 places :
Symmetric choice reduction at 1 with 73 rule applications. Total rules 162 place count 252 transition count 447
Iterating global reduction 1 with 73 rules applied. Total rules applied 235 place count 252 transition count 447
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 259 place count 252 transition count 423
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 316 place count 195 transition count 366
Iterating global reduction 2 with 57 rules applied. Total rules applied 373 place count 195 transition count 366
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 375 place count 195 transition count 364
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 399 place count 171 transition count 328
Iterating global reduction 3 with 24 rules applied. Total rules applied 423 place count 171 transition count 328
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 449 place count 171 transition count 302
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 454 place count 166 transition count 294
Iterating global reduction 4 with 5 rules applied. Total rules applied 459 place count 166 transition count 294
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 461 place count 164 transition count 292
Iterating global reduction 4 with 2 rules applied. Total rules applied 463 place count 164 transition count 292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 464 place count 164 transition count 291
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 465 place count 163 transition count 290
Iterating global reduction 5 with 1 rules applied. Total rules applied 466 place count 163 transition count 290
Applied a total of 466 rules in 116 ms. Remains 163 /347 variables (removed 184) and now considering 290/672 (removed 382) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 163/347 places, 290/672 transitions.
RANDOM walk for 40000 steps (9208 resets) in 222 ms. (179 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1907 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1890 resets) in 108 ms. (366 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1356900 steps, run timeout after 3001 ms. (steps per millisecond=452 ) properties seen :1 out of 2
Probabilistic random walk after 1356900 steps, saw 473211 distinct states, run finished after 3008 ms. (steps per millisecond=451 ) properties seen :1
FORMULA DBSingleClientW-PT-d1m06-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 290 rows 163 cols
[2024-05-21 11:30:34] [INFO ] Computed 2 invariants in 6 ms
[2024-05-21 11:30:34] [INFO ] State equation strengthened by 145 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 102/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 234/355 variables, 121/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 89/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 98/453 variables, 42/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 56/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/453 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 453/453 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 206 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 163/163 constraints, ReadFeed: 145/145 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/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 102/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 234/355 variables, 121/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 89/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 98/453 variables, 42/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 56/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/453 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 453/453 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 382 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 163/163 constraints, ReadFeed: 145/145 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 618ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 72 ms.
Support contains 19 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 290/290 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 151 transition count 248
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 151 transition count 248
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 151 transition count 247
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 33 place count 143 transition count 238
Iterating global reduction 1 with 8 rules applied. Total rules applied 41 place count 143 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 143 transition count 236
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 49 place count 137 transition count 228
Iterating global reduction 2 with 6 rules applied. Total rules applied 55 place count 137 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 137 transition count 226
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 60 place count 134 transition count 221
Iterating global reduction 3 with 3 rules applied. Total rules applied 63 place count 134 transition count 221
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 65 place count 132 transition count 219
Iterating global reduction 3 with 2 rules applied. Total rules applied 67 place count 132 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 132 transition count 218
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 69 place count 131 transition count 217
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 131 transition count 217
Applied a total of 70 rules in 34 ms. Remains 131 /163 variables (removed 32) and now considering 217/290 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 131/163 places, 217/290 transitions.
RANDOM walk for 40000 steps (9185 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1897 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2188887 steps, run timeout after 3001 ms. (steps per millisecond=729 ) properties seen :0 out of 1
Probabilistic random walk after 2188887 steps, saw 771127 distinct states, run finished after 3001 ms. (steps per millisecond=729 ) properties seen :0
// Phase 1: matrix 217 rows 131 cols
[2024-05-21 11:30:37] [INFO ] Computed 2 invariants in 6 ms
[2024-05-21 11:30:37] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 82/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 190/291 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 70/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 57/348 variables, 30/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/348 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 230 constraints, problems are : Problem set: 0 solved, 1 unsolved in 147 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 131/131 constraints, ReadFeed: 97/97 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/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 82/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 190/291 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 70/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 57/348 variables, 30/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 27/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/348 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/348 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 231 constraints, problems are : Problem set: 0 solved, 1 unsolved in 318 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 131/131 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 489ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 19 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 217/217 transitions.
Applied a total of 0 rules in 7 ms. Remains 131 /131 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 131/131 places, 217/217 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 217/217 transitions.
Applied a total of 0 rules in 8 ms. Remains 131 /131 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2024-05-21 11:30:38] [INFO ] Invariant cache hit.
[2024-05-21 11:30:38] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 11:30:38] [INFO ] Invariant cache hit.
[2024-05-21 11:30:38] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-05-21 11:30:38] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-21 11:30:38] [INFO ] Redundant transitions in 9 ms returned []
Running 216 sub problems to find dead transitions.
[2024-05-21 11:30:38] [INFO ] Invariant cache hit.
[2024-05-21 11:30:38] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/348 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 97/230 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/348 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 230 constraints, problems are : Problem set: 0 solved, 216 unsolved in 7434 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 131/131 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/348 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 97/230 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 216/446 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 0/348 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 446 constraints, problems are : Problem set: 0 solved, 216 unsolved in 15941 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 131/131 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
After SMT, in 23805ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 23810ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24177 ms. Remains : 131/131 places, 217/217 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 131 transition count 211
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 6 place count 131 transition count 199
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 30 place count 119 transition count 199
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 118 transition count 198
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 118 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 117 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 117 transition count 197
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 46 place count 111 transition count 191
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
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 50 place count 109 transition count 200
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 109 transition count 200
Applied a total of 52 rules in 28 ms. Remains 109 /131 variables (removed 22) and now considering 200/217 (removed 17) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 200 rows 109 cols
[2024-05-21 11:31:02] [INFO ] Computed 3 invariants in 7 ms
[2024-05-21 11:31:02] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 11:31:02] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-21 11:31:02] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 11:31:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 11:31:02] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:31:02] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 11:31:02] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 11:31:02] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 405 ms.
[2024-05-21 11:31:02] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-21 11:31:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 131 places, 217 transitions and 855 arcs took 4 ms.
[2024-05-21 11:31:03] [INFO ] Flatten gal took : 46 ms
Total runtime 39886 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DBSingleClientW-PT-d1m06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 131
TRANSITIONS: 217
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.005s, Sys 0.000s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 583
MODEL NAME: /home/mcc/execution/413/model
131 places, 217 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DBSingleClientW-PT-d1m06-ReachabilityFireability-2024-05 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716291481585

--------------------
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
MEDDLY ERROR: Insufficient memory

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-d1m06"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is DBSingleClientW-PT-d1m06, 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 r091-tall-171624187900511"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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