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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 6.6K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K 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 90K 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-08-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-08-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717355668000

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-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 19:14:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:14:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:14:30] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2024-06-02 19:14:30] [INFO ] Transformed 147 places.
[2024-06-02 19:14:30] [INFO ] Transformed 312 transitions.
[2024-06-02 19:14:30] [INFO ] Found NUPN structural information;
[2024-06-02 19:14:30] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 426 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 43 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1969 resets) in 3405 ms. (11 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (57 resets) in 87 ms. (45 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (53 resets) in 252 ms. (15 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (53 resets) in 74 ms. (53 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (50 resets) in 69 ms. (57 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (54 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (47 resets) in 150 ms. (26 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (53 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (42 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (54 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (61 resets) in 142 ms. (27 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (53 resets) in 68 ms. (58 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (57 resets) in 89 ms. (44 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (75 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (59 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (53 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (53 resets) in 60 ms. (65 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 345424 steps, run timeout after 3002 ms. (steps per millisecond=115 ) properties seen :3 out of 16
Probabilistic random walk after 345424 steps, saw 67701 distinct states, run finished after 3023 ms. (steps per millisecond=114 ) properties seen :3
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 312 rows 147 cols
[2024-06-02 19:14:35] [INFO ] Computed 11 invariants in 33 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem MedleyA-PT-08-ReachabilityFireability-2024-11 is UNSAT
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-08-ReachabilityFireability-2024-12 is UNSAT
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 19/130 variables, 6/117 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 19/136 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/136 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 17/147 variables, 5/141 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 17/158 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/158 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 312/459 variables, 147/305 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/305 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/459 variables, 0/305 constraints. Problems are: Problem set: 2 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 305 constraints, problems are : Problem set: 2 solved, 11 unsolved in 1535 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 105/105 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/105 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 24/129 variables, 6/111 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 24/135 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/135 constraints. Problems are: Problem set: 2 solved, 11 unsolved
Problem MedleyA-PT-08-ReachabilityFireability-2024-13 is UNSAT
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 18/147 variables, 5/140 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 18/158 constraints. Problems are: Problem set: 3 solved, 10 unsolved
[2024-06-02 19:14:38] [INFO ] Deduced a trap composed of 33 places in 239 ms of which 34 ms to minimize.
[2024-06-02 19:14:39] [INFO ] Deduced a trap composed of 28 places in 197 ms of which 3 ms to minimize.
[2024-06-02 19:14:39] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 3 ms to minimize.
[2024-06-02 19:14:39] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 2 ms to minimize.
[2024-06-02 19:14:39] [INFO ] Deduced a trap composed of 57 places in 151 ms of which 3 ms to minimize.
[2024-06-02 19:14:39] [INFO ] Deduced a trap composed of 34 places in 177 ms of which 3 ms to minimize.
[2024-06-02 19:14:39] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 2 ms to minimize.
[2024-06-02 19:14:40] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 2 ms to minimize.
Problem MedleyA-PT-08-ReachabilityFireability-2024-02 is UNSAT
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
[2024-06-02 19:14:40] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2024-06-02 19:14:40] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2024-06-02 19:14:40] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2024-06-02 19:14:40] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 3 ms to minimize.
[2024-06-02 19:14:40] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 13/171 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/171 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 312/459 variables, 147/318 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 9/327 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 0/327 constraints. Problems are: Problem set: 4 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/459 variables, and 327 constraints, problems are : Problem set: 4 solved, 9 unsolved in 5010 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 9/13 constraints, Known Traps: 13/13 constraints]
After SMT, in 7317ms problems are : Problem set: 4 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 102 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 312/312 transitions.
Graph (complete) has 508 edges and 147 vertex of which 142 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Discarding 5 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 129 transition count 295
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 129 transition count 295
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 29 place count 129 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 129 transition count 285
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 37 place count 129 transition count 284
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 128 transition count 284
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 128 transition count 283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 127 transition count 283
Applied a total of 41 rules in 171 ms. Remains 127 /147 variables (removed 20) and now considering 283/312 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 127/147 places, 283/312 transitions.
RANDOM walk for 40000 steps (1873 resets) in 1425 ms. (28 steps per ms) remains 8/9 properties
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (551 resets) in 168 ms. (236 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (469 resets) in 334 ms. (119 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (509 resets) in 192 ms. (207 steps per ms) remains 7/8 properties
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (470 resets) in 272 ms. (146 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (471 resets) in 189 ms. (210 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (471 resets) in 259 ms. (153 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (471 resets) in 252 ms. (158 steps per ms) remains 7/7 properties
// Phase 1: matrix 283 rows 127 cols
[2024-06-02 19:14:44] [INFO ] Computed 9 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 18/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 17/124 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 282/406 variables, 124/133 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 4/410 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/410 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 136 constraints, problems are : Problem set: 0 solved, 7 unsolved in 929 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 18/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 17/124 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 19:14:45] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 19:14:46] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 19:14:46] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 282/406 variables, 124/136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 4/410 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/410 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/410 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 410/410 variables, and 146 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3391 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 3/3 constraints]
After SMT, in 4474ms problems are : Problem set: 0 solved, 7 unsolved
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-15 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-07 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 4221 ms.
Support contains 54 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 283/283 transitions.
Graph (complete) has 465 edges and 127 vertex of which 125 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 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 5 rules applied. Total rules applied 6 place count 125 transition count 277
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 122 transition count 275
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 120 transition count 275
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 13 place count 120 transition count 271
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 21 place count 116 transition count 271
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 34 place count 103 transition count 254
Iterating global reduction 3 with 13 rules applied. Total rules applied 47 place count 103 transition count 254
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 51 place count 99 transition count 247
Iterating global reduction 3 with 4 rules applied. Total rules applied 55 place count 99 transition count 247
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 61 place count 96 transition count 244
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 95 transition count 253
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 75 place count 95 transition count 241
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 95 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 94 transition count 240
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 81 place count 94 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 93 transition count 239
Applied a total of 82 rules in 82 ms. Remains 93 /127 variables (removed 34) and now considering 239/283 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 93/127 places, 239/283 transitions.
RANDOM walk for 40000 steps (2788 resets) in 276 ms. (144 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (665 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (655 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (577 resets) in 207 ms. (192 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (593 resets) in 155 ms. (256 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 710364 steps, run visited all 4 properties in 2960 ms. (steps per millisecond=239 )
Probabilistic random walk after 710364 steps, saw 127397 distinct states, run finished after 2970 ms. (steps per millisecond=239 ) properties seen :4
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-08-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 26003 ms.
ITS solved all properties within timeout

BK_STOP 1717355696540

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

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