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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K 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 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 89K 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-16-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-16-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-16-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-16-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-16-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-16-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-16-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-16-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-16-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-16-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-16-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-16-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-16-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-16-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-16-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-16-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717366041142

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-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:07:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 22:07:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:07:24] [INFO ] Load time of PNML (sax parser for PT used): 223 ms
[2024-06-02 22:07:24] [INFO ] Transformed 196 places.
[2024-06-02 22:07:24] [INFO ] Transformed 392 transitions.
[2024-06-02 22:07:24] [INFO ] Found NUPN structural information;
[2024-06-02 22:07:24] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 530 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 41 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
RANDOM walk for 40000 steps (8 resets) in 3509 ms. (11 steps per ms) remains 15/16 properties
FORMULA MedleyA-PT-16-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 118 ms. (33 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 116 ms. (34 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 161 ms. (24 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 13/15 properties
FORMULA MedleyA-PT-16-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-16-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4002 steps (8 resets) in 69 ms. (57 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 97 ms. (40 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 114 ms. (34 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 268 ms. (14 steps per ms) remains 13/13 properties
// Phase 1: matrix 390 rows 196 cols
[2024-06-02 22:07:25] [INFO ] Computed 7 invariants in 40 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 62/196 variables, 7/141 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 62/203 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 22:07:27] [INFO ] Deduced a trap composed of 19 places in 328 ms of which 43 ms to minimize.
Problem MedleyA-PT-16-ReachabilityFireability-2024-02 is UNSAT
FORMULA MedleyA-PT-16-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 1/204 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/204 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 390/586 variables, 196/400 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/586 variables, 0/400 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/586 variables, 0/400 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 586/586 variables, and 400 constraints, problems are : Problem set: 1 solved, 12 unsolved in 2601 ms.
Refiners :[Domain max(s): 196/196 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 71/196 variables, 7/132 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 71/203 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 1/204 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-02 22:07:29] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 4 ms to minimize.
[2024-06-02 22:07:29] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 3 ms to minimize.
[2024-06-02 22:07:30] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 4 ms to minimize.
[2024-06-02 22:07:30] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 3 ms to minimize.
[2024-06-02 22:07:30] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 3 ms to minimize.
[2024-06-02 22:07:30] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 3 ms to minimize.
[2024-06-02 22:07:30] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-06-02 22:07:31] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 4 ms to minimize.
[2024-06-02 22:07:31] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 6 ms to minimize.
[2024-06-02 22:07:31] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 10/214 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-02 22:07:31] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/215 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-02 22:07:32] [INFO ] Deduced a trap composed of 27 places in 216 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/216 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-02 22:07:32] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 1/217 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/217 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 390/586 variables, 196/413 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/586 variables, 12/425 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/586 variables, and 425 constraints, problems are : Problem set: 1 solved, 12 unsolved in 5013 ms.
Refiners :[Domain max(s): 196/196 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 12/13 constraints, Known Traps: 14/14 constraints]
After SMT, in 8198ms problems are : Problem set: 1 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 125 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 390/390 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 3 place count 196 transition count 387
Reduce places removed 3 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 11 rules applied. Total rules applied 14 place count 193 transition count 379
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 22 place count 185 transition count 379
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 22 place count 185 transition count 377
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 183 transition count 377
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 35 place count 174 transition count 365
Iterating global reduction 3 with 9 rules applied. Total rules applied 44 place count 174 transition count 365
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 56 place count 174 transition count 353
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 56 place count 174 transition count 352
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 58 place count 173 transition count 352
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 62 place count 171 transition count 350
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 170 transition count 351
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 69 place count 170 transition count 346
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 73 place count 170 transition count 342
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 77 place count 166 transition count 342
Applied a total of 77 rules in 162 ms. Remains 166 /196 variables (removed 30) and now considering 342/390 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 166/196 places, 342/390 transitions.
RANDOM walk for 40000 steps (8 resets) in 825 ms. (48 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 193 ms. (206 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 11/12 properties
FORMULA MedleyA-PT-16-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 325 ms. (122 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (8 resets) in 185 ms. (215 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 158 ms. (251 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 174 ms. (228 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 592 ms. (67 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 10/11 properties
FORMULA MedleyA-PT-16-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 167 ms. (238 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 227 ms. (175 steps per ms) remains 10/10 properties
// Phase 1: matrix 342 rows 166 cols
[2024-06-02 22:07:35] [INFO ] Computed 7 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 52/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 342/508 variables, 166/173 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/508 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 508/508 variables, and 173 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1173 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 52/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 22:07:37] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 3 ms to minimize.
[2024-06-02 22:07:37] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 3 ms to minimize.
[2024-06-02 22:07:37] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 4 ms to minimize.
[2024-06-02 22:07:37] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 2 ms to minimize.
[2024-06-02 22:07:37] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 3 ms to minimize.
[2024-06-02 22:07:38] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:07:38] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 22:07:38] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-06-02 22:07:38] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 3 ms to minimize.
[2024-06-02 22:07:38] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 342/508 variables, 166/183 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 10/193 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/508 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 508/508 variables, and 193 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5875 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 10/10 constraints]
After SMT, in 7244ms problems are : Problem set: 0 solved, 10 unsolved
FORMULA MedleyA-PT-16-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-16-ReachabilityFireability-2024-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-16-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-16-ReachabilityFireability-2024-08 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 15114 ms.
Support contains 72 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 342/342 transitions.
Graph (trivial) has 49 edges and 166 vertex of which 3 / 166 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 164 transition count 337
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 7 rules applied. Total rules applied 10 place count 162 transition count 332
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 15 place count 157 transition count 332
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 15 place count 157 transition count 329
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 21 place count 154 transition count 329
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 34 place count 141 transition count 308
Iterating global reduction 3 with 13 rules applied. Total rules applied 47 place count 141 transition count 308
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 49 place count 141 transition count 306
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 49 place count 141 transition count 305
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 51 place count 140 transition count 305
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 59 place count 136 transition count 301
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 60 place count 135 transition count 299
Iterating global reduction 4 with 1 rules applied. Total rules applied 61 place count 135 transition count 299
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 63 place count 134 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 134 transition count 302
Free-agglomeration rule applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 75 place count 134 transition count 291
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 86 place count 123 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 87 place count 123 transition count 290
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 89 place count 122 transition count 289
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 91 place count 122 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 92 place count 122 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 93 place count 121 transition count 287
Applied a total of 93 rules in 126 ms. Remains 121 /166 variables (removed 45) and now considering 287/342 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 121/166 places, 287/342 transitions.
RANDOM walk for 40000 steps (8 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 213 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 155 ms. (256 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 181 ms. (219 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 275376 steps, run visited all 6 properties in 890 ms. (steps per millisecond=309 )
Probabilistic random walk after 275376 steps, saw 72958 distinct states, run finished after 897 ms. (steps per millisecond=306 ) properties seen :6
FORMULA MedleyA-PT-16-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-16-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-16-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-16-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-16-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-16-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 35747 ms.
ITS solved all properties within timeout

BK_STOP 1717366079433

--------------------
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-16"
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-16, 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-171734919700127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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