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.r575-smll-171734919400031.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 MedleyA-PT-04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919400031
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 28K Jun 2 16:33 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 MedleyA-PT-04-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717352480730

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:21:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:21:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:21:23] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2024-06-02 18:21:23] [INFO ] Transformed 115 places.
[2024-06-02 18:21:23] [INFO ] Transformed 107 transitions.
[2024-06-02 18:21:23] [INFO ] Found NUPN structural information;
[2024-06-02 18:21:23] [INFO ] Parsed PT model containing 115 places and 107 transitions and 300 arcs in 383 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 48 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1119 resets) in 3041 ms. (13 steps per ms) remains 10/16 properties
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (338 resets) in 504 ms. (79 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (341 resets) in 222 ms. (179 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (294 resets) in 238 ms. (167 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (270 resets) in 1500 ms. (26 steps per ms) remains 9/10 properties
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (310 resets) in 163 ms. (243 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (340 resets) in 198 ms. (201 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (338 resets) in 321 ms. (124 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (348 resets) in 249 ms. (160 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (327 resets) in 115 ms. (344 steps per ms) remains 8/9 properties
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 107 rows 115 cols
[2024-06-02 18:21:26] [INFO ] Computed 9 invariants in 18 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 10/115 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 10/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 107/222 variables, 115/239 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 239 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1516 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem MedleyA-PT-04-ReachabilityFireability-2024-05 is UNSAT
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 4/109 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-02 18:21:28] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 21 ms to minimize.
[2024-06-02 18:21:28] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
Problem MedleyA-PT-04-ReachabilityFireability-2024-11 is UNSAT
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 2/111 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-02 18:21:28] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 2 ms to minimize.
[2024-06-02 18:21:28] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:21:28] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-06-02 18:21:28] [INFO ] Deduced a trap composed of 14 places in 316 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 4/115 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/115 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/115 variables, 5/120 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 10/130 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-02 18:21:28] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 3 ms to minimize.
[2024-06-02 18:21:29] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-06-02 18:21:29] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-06-02 18:21:29] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
[2024-06-02 18:21:29] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:21:29] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
Problem MedleyA-PT-04-ReachabilityFireability-2024-03 is UNSAT
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-02 18:21:29] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
Problem MedleyA-PT-04-ReachabilityFireability-2024-06 is UNSAT
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-02 18:21:29] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 8/138 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/138 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Problem MedleyA-PT-04-ReachabilityFireability-2024-09 is UNSAT
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 107/222 variables, 115/253 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 3/256 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/256 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/256 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 256 constraints, problems are : Problem set: 5 solved, 3 unsolved in 2863 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 3/8 constraints, Known Traps: 14/14 constraints]
After SMT, in 4670ms problems are : Problem set: 5 solved, 3 unsolved
Parikh walk visited 0 properties in 2381 ms.
Support contains 60 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 107/107 transitions.
Graph (complete) has 207 edges and 115 vertex of which 114 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 114 transition count 104
Reduce places removed 3 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 7 rules applied. Total rules applied 11 place count 111 transition count 100
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 15 place count 107 transition count 100
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 107 transition count 99
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 106 transition count 99
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 105 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 105 transition count 98
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 3 with 12 rules applied. Total rules applied 31 place count 99 transition count 92
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 99 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 33 place count 98 transition count 91
Applied a total of 33 rules in 97 ms. Remains 98 /115 variables (removed 17) and now considering 91/107 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 98/115 places, 91/107 transitions.
RANDOM walk for 40000 steps (1411 resets) in 274 ms. (145 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (490 resets) in 215 ms. (185 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (519 resets) in 236 ms. (168 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (498 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1658583 steps, run timeout after 3001 ms. (steps per millisecond=552 ) properties seen :2 out of 3
Probabilistic random walk after 1658583 steps, saw 295352 distinct states, run finished after 3008 ms. (steps per millisecond=551 ) properties seen :2
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 91 rows 98 cols
[2024-06-02 18:21:36] [INFO ] Computed 8 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/80 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/171 variables, 80/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/189 variables, 18/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 106 constraints, problems are : Problem set: 0 solved, 1 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 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/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/80 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:21:36] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2024-06-02 18:21:36] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-06-02 18:21:36] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:21:37] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:21:37] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 91/171 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 18/189 variables, 18/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 632 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 871ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 37 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 91/91 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 98 transition count 87
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 94 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 93 transition count 86
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 93 transition count 83
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 16 place count 90 transition count 83
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 18 place count 88 transition count 81
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 88 transition count 81
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 38 place count 79 transition count 72
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 79 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 78 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 77 transition count 70
Applied a total of 41 rules in 40 ms. Remains 77 /98 variables (removed 21) and now considering 70/91 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 77/98 places, 70/91 transitions.
RANDOM walk for 40000 steps (2468 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (924 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3118375 steps, run timeout after 3001 ms. (steps per millisecond=1039 ) properties seen :0 out of 1
Probabilistic random walk after 3118375 steps, saw 550517 distinct states, run finished after 3001 ms. (steps per millisecond=1039 ) properties seen :0
// Phase 1: matrix 70 rows 77 cols
[2024-06-02 18:21:40] [INFO ] Computed 8 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/59 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/129 variables, 59/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/147 variables, 18/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/147 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 77/77 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/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/59 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:21:40] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 3 ms to minimize.
[2024-06-02 18:21:40] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 4 ms to minimize.
[2024-06-02 18:21:40] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 3 ms to minimize.
[2024-06-02 18:21:40] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:21:40] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 70/129 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 18/147 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:21:41] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
[2024-06-02 18:21:41] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:21:41] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 94 constraints, problems are : Problem set: 0 solved, 1 unsolved in 711 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 861ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 63 ms.
Support contains 37 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 70/70 transitions.
Applied a total of 0 rules in 11 ms. Remains 77 /77 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 77/77 places, 70/70 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 70/70 transitions.
Applied a total of 0 rules in 5 ms. Remains 77 /77 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-06-02 18:21:41] [INFO ] Invariant cache hit.
[2024-06-02 18:21:41] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 18:21:41] [INFO ] Invariant cache hit.
[2024-06-02 18:21:41] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-06-02 18:21:41] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2024-06-02 18:21:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-02 18:21:42] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 4/77 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-02 18:21:42] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:21:42] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:21:42] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:21:42] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-02 18:21:42] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-02 18:21:42] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 2 ms to minimize.
[2024-06-02 18:21:42] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 2 ms to minimize.
[2024-06-02 18:21:43] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:21:43] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-02 18:21:43] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 70/147 variables, 77/96 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-02 18:21:43] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 2 ms to minimize.
[2024-06-02 18:21:44] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 3 ms to minimize.
[2024-06-02 18:21:44] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-02 18:21:45] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/147 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 12 (OVERLAPS) 0/147 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 100 constraints, problems are : Problem set: 0 solved, 66 unsolved in 4369 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 4/77 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 70/147 variables, 77/100 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 66/166 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-02 18:21:47] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-02 18:21:48] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (OVERLAPS) 0/147 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 168 constraints, problems are : Problem set: 0 solved, 66 unsolved in 6118 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 17/17 constraints]
After SMT, in 10541ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 10544ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10783 ms. Remains : 77/77 places, 70/70 transitions.
[2024-06-02 18:21:52] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2024-06-02 18:21:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 77 places, 70 transitions and 219 arcs took 10 ms.
[2024-06-02 18:21:52] [INFO ] Flatten gal took : 54 ms
Total runtime 29446 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-04

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: 77
TRANSITIONS: 70
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, 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: 710
MODEL NAME: /home/mcc/execution/413/model
77 places, 70 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 MedleyA-PT-04-ReachabilityFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717352513561

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

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="MedleyA-PT-04"
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 MedleyA-PT-04, 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 r575-smll-171734919400031"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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