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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 12 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Apr 12 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716299434075

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-d2m05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 13:50:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 13:50:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:50:35] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2024-05-21 13:50:35] [INFO ] Transformed 4763 places.
[2024-05-21 13:50:35] [INFO ] Transformed 2478 transitions.
[2024-05-21 13:50:35] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 330 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 3580 places in 16 ms
Reduce places removed 3580 places and 0 transitions.
RANDOM walk for 40000 steps (9181 resets) in 2893 ms. (13 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (155 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (393 resets) in 117 ms. (33 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (147 resets) in 52 ms. (75 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (173 resets) in 82 ms. (48 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (164 resets) in 175 ms. (22 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (341 resets) in 178 ms. (22 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (178 resets) in 188 ms. (21 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (201 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (190 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (183 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (174 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (363 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (184 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (177 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (361 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (167 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 173426 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :4 out of 16
Probabilistic random walk after 173426 steps, saw 72878 distinct states, run finished after 3005 ms. (steps per millisecond=57 ) properties seen :4
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 2478 rows 1183 cols
[2024-05-21 13:50:40] [INFO ] Computed 6 invariants in 140 ms
[2024-05-21 13:50:40] [INFO ] State equation strengthened by 1588 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 429/629 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/629 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-03 is UNSAT
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-04 is UNSAT
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-08 is UNSAT
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-09 is UNSAT
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-10 is UNSAT
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-12 is UNSAT
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-13 is UNSAT
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-14 is UNSAT
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 554/1183 variables, 4/6 constraints. Problems are: Problem set: 8 solved, 4 unsolved
[2024-05-21 13:50:42] [INFO ] Deduced a trap composed of 777 places in 623 ms of which 68 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1183 variables, 1/7 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1183 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2478/3661 variables, 1183/1190 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3661 variables, 1588/2778 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3661 variables, 0/2778 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/3661 variables, 0/2778 constraints. Problems are: Problem set: 8 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3661/3661 variables, and 2778 constraints, problems are : Problem set: 8 solved, 4 unsolved in 5056 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1183/1183 constraints, ReadFeed: 1588/1588 constraints, PredecessorRefiner: 12/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 8 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 491/564 variables, 1/1 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/564 variables, 0/1 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3/567 variables, 1/2 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 616/1183 variables, 4/6 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1183 variables, 1/7 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1183 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2478/3661 variables, 1183/1190 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3661 variables, 1588/2778 constraints. Problems are: Problem set: 8 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3661/3661 variables, and 2780 constraints, problems are : Problem set: 8 solved, 4 unsolved in 5026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 1183/1183 constraints, ReadFeed: 1588/1588 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 11301ms problems are : Problem set: 8 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 73 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1136 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.10 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 353 places :
Symmetric choice reduction at 1 with 353 rule applications. Total rules 571 place count 783 transition count 1593
Iterating global reduction 1 with 353 rules applied. Total rules applied 924 place count 783 transition count 1593
Ensure Unique test removed 108 transitions
Reduce isomorphic transitions removed 108 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 1032 place count 783 transition count 1485
Discarding 279 places :
Symmetric choice reduction at 2 with 279 rule applications. Total rules 1311 place count 504 transition count 1206
Iterating global reduction 2 with 279 rules applied. Total rules applied 1590 place count 504 transition count 1206
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1598 place count 504 transition count 1198
Discarding 198 places :
Symmetric choice reduction at 3 with 198 rule applications. Total rules 1796 place count 306 transition count 934
Iterating global reduction 3 with 198 rules applied. Total rules applied 1994 place count 306 transition count 934
Ensure Unique test removed 270 transitions
Reduce isomorphic transitions removed 270 transitions.
Iterating post reduction 3 with 270 rules applied. Total rules applied 2264 place count 306 transition count 664
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 2278 place count 292 transition count 644
Iterating global reduction 4 with 14 rules applied. Total rules applied 2292 place count 292 transition count 644
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 2328 place count 292 transition count 608
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 2335 place count 285 transition count 601
Iterating global reduction 5 with 7 rules applied. Total rules applied 2342 place count 285 transition count 601
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2343 place count 285 transition count 600
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 2349 place count 279 transition count 594
Iterating global reduction 6 with 6 rules applied. Total rules applied 2355 place count 279 transition count 594
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2359 place count 279 transition count 590
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2360 place count 278 transition count 588
Iterating global reduction 7 with 1 rules applied. Total rules applied 2361 place count 278 transition count 588
Applied a total of 2361 rules in 314 ms. Remains 278 /1183 variables (removed 905) and now considering 588/2478 (removed 1890) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 334 ms. Remains : 278/1183 places, 588/2478 transitions.
RANDOM walk for 40000 steps (9141 resets) in 557 ms. (71 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1793 resets) in 186 ms. (213 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1762 resets) in 219 ms. (181 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1750 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1789 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 386490 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 4
Probabilistic random walk after 386490 steps, saw 152167 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
// Phase 1: matrix 588 rows 278 cols
[2024-05-21 13:50:55] [INFO ] Computed 2 invariants in 12 ms
[2024-05-21 13:50:55] [INFO ] State equation strengthened by 319 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 148/221 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 548/769 variables, 221/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/769 variables, 279/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 97/866 variables, 57/559 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/866 variables, 40/599 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/866 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/866 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 866/866 variables, and 599 constraints, problems are : Problem set: 0 solved, 4 unsolved in 887 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 278/278 constraints, ReadFeed: 319/319 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 148/221 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 548/769 variables, 221/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/769 variables, 279/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/769 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 97/866 variables, 57/559 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/866 variables, 40/599 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/866 variables, 4/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/866 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/866 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 866/866 variables, and 603 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2495 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 278/278 constraints, ReadFeed: 319/319 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 3501ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 8213 ms.
Support contains 73 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 588/588 transitions.
Applied a total of 0 rules in 35 ms. Remains 278 /278 variables (removed 0) and now considering 588/588 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 278/278 places, 588/588 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 588/588 transitions.
Applied a total of 0 rules in 36 ms. Remains 278 /278 variables (removed 0) and now considering 588/588 (removed 0) transitions.
[2024-05-21 13:51:06] [INFO ] Invariant cache hit.
[2024-05-21 13:51:07] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-21 13:51:07] [INFO ] Invariant cache hit.
[2024-05-21 13:51:07] [INFO ] State equation strengthened by 319 read => feed constraints.
[2024-05-21 13:51:08] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
[2024-05-21 13:51:08] [INFO ] Redundant transitions in 34 ms returned []
Running 587 sub problems to find dead transitions.
[2024-05-21 13:51:08] [INFO ] Invariant cache hit.
[2024-05-21 13:51:08] [INFO ] State equation strengthened by 319 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 2 (OVERLAPS) 1/278 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 4 (OVERLAPS) 588/866 variables, 278/280 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/866 variables, 319/599 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/866 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 866/866 variables, and 599 constraints, problems are : Problem set: 0 solved, 587 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 278/278 constraints, ReadFeed: 319/319 constraints, PredecessorRefiner: 587/587 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 587 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 2 (OVERLAPS) 1/278 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 4 (OVERLAPS) 588/866 variables, 278/280 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/866 variables, 319/599 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/866 variables, 587/1186 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 866/866 variables, and 1186 constraints, problems are : Problem set: 0 solved, 587 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 278/278 constraints, ReadFeed: 319/319 constraints, PredecessorRefiner: 587/587 constraints, Known Traps: 0/0 constraints]
After SMT, in 62036ms problems are : Problem set: 0 solved, 587 unsolved
Search for dead transitions found 0 dead transitions in 62043ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63236 ms. Remains : 278/278 places, 588/588 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 278 transition count 579
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 9 place count 278 transition count 563
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 32 rules applied. Total rules applied 41 place count 262 transition count 563
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 261 transition count 562
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 261 transition count 562
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 260 transition count 561
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 260 transition count 561
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
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 57 place count 254 transition count 555
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 251 transition count 562
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 71 place count 251 transition count 554
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 82 place count 243 transition count 551
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 87 place count 243 transition count 551
Applied a total of 87 rules in 70 ms. Remains 243 /278 variables (removed 35) and now considering 551/588 (removed 37) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 551 rows 243 cols
[2024-05-21 13:52:10] [INFO ] Computed 3 invariants in 4 ms
[2024-05-21 13:52:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 13:52:10] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 33 ms returned sat
[2024-05-21 13:52:11] [INFO ] After 732ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 13:52:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 13:52:11] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:52:11] [INFO ] After 550ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-21 13:52:12] [INFO ] After 1050ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-21 13:52:12] [INFO ] After 1562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 2429 ms.
[2024-05-21 13:52:12] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-21 13:52:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 278 places, 588 transitions and 2324 arcs took 5 ms.
[2024-05-21 13:52:12] [INFO ] Flatten gal took : 74 ms
Total runtime 97652 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DBSingleClientW-PT-d2m05

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/409/model (.net / .def) ...
EXPORT TIME: [User 0.002s, 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: 585
MODEL NAME: /home/mcc/execution/409/model
278 places, 588 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-d2m05-ReachabilityFireability-2024-02 CANNOT_COMPUTE
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-06 CANNOT_COMPUTE
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-07 CANNOT_COMPUTE
FORMULA DBSingleClientW-PT-d2m05-ReachabilityFireability-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716299949761

--------------------
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

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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-d2m05"
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-d2m05, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-tall-171624188000559"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m05.tgz
mv DBSingleClientW-PT-d2m05 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;