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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K 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 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K 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 82K 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-07-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-07-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-07-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-07-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-07-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-07-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-07-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-07-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-07-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-07-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-07-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-07-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-07-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-07-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-07-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-07-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717355231024

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-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 19:07:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:07:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:07:13] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2024-06-02 19:07:13] [INFO ] Transformed 145 places.
[2024-06-02 19:07:13] [INFO ] Transformed 287 transitions.
[2024-06-02 19:07:13] [INFO ] Found NUPN structural information;
[2024-06-02 19:07:13] [INFO ] Parsed PT model containing 145 places and 287 transitions and 1240 arcs in 432 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 153 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 2 transitions.
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 40000 steps (1401 resets) in 3563 ms. (11 steps per ms) remains 11/15 properties
FORMULA MedleyA-PT-07-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-07-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-07-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-07-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (348 resets) in 257 ms. (155 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (314 resets) in 136 ms. (291 steps per ms) remains 8/11 properties
FORMULA MedleyA-PT-07-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-07-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (347 resets) in 281 ms. (141 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (398 resets) in 162 ms. (245 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (312 resets) in 393 ms. (101 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (313 resets) in 241 ms. (165 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (349 resets) in 920 ms. (43 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (508 resets) in 1511 ms. (26 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (311 resets) in 579 ms. (68 steps per ms) remains 8/8 properties
// Phase 1: matrix 285 rows 143 cols
[2024-06-02 19:07:16] [INFO ] Computed 11 invariants in 22 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem MedleyA-PT-07-ReachabilityFireability-2024-05 is UNSAT
FORMULA MedleyA-PT-07-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-07-ReachabilityFireability-2024-09 is UNSAT
FORMULA MedleyA-PT-07-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 45/118 variables, 6/79 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 45/124 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/124 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 25/143 variables, 5/129 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 25/154 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/154 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 285/428 variables, 143/297 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 0/297 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/428 variables, 0/297 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 297 constraints, problems are : Problem set: 2 solved, 6 unsolved in 957 ms.
Refiners :[Domain max(s): 143/143 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem MedleyA-PT-07-ReachabilityFireability-2024-13 is UNSAT
FORMULA MedleyA-PT-07-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 49/111 variables, 6/68 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 49/117 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/117 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem MedleyA-PT-07-ReachabilityFireability-2024-02 is UNSAT
FORMULA MedleyA-PT-07-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 32/143 variables, 5/122 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 32/154 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-06-02 19:07:18] [INFO ] Deduced a trap composed of 53 places in 209 ms of which 56 ms to minimize.
[2024-06-02 19:07:18] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 2/156 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-06-02 19:07:18] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 1/157 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/157 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 285/428 variables, 143/300 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 4/304 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-06-02 19:07:19] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/428 variables, 1/305 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-06-02 19:07:20] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 3 ms to minimize.
[2024-06-02 19:07:20] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 3 ms to minimize.
[2024-06-02 19:07:20] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 3 ms to minimize.
[2024-06-02 19:07:20] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 3 ms to minimize.
[2024-06-02 19:07:20] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 5/310 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 0/310 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/428 variables, 0/310 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 310 constraints, problems are : Problem set: 4 solved, 4 unsolved in 3814 ms.
Refiners :[Domain max(s): 143/143 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 4/8 constraints, Known Traps: 9/9 constraints]
After SMT, in 5039ms problems are : Problem set: 4 solved, 4 unsolved
Parikh walk visited 0 properties in 2380 ms.
Support contains 37 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 285/285 transitions.
Graph (complete) has 445 edges and 143 vertex of which 136 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 136 transition count 266
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 24 place count 129 transition count 266
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 24 place count 129 transition count 258
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 40 place count 121 transition count 258
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 65 place count 96 transition count 232
Iterating global reduction 2 with 25 rules applied. Total rules applied 90 place count 96 transition count 232
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 93 place count 93 transition count 226
Iterating global reduction 2 with 3 rules applied. Total rules applied 96 place count 93 transition count 226
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 108 place count 87 transition count 220
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 81 transition count 250
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 126 place count 81 transition count 244
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 3 with 22 rules applied. Total rules applied 148 place count 81 transition count 222
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 3 with 2 rules applied. Total rules applied 150 place count 81 transition count 220
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 153 place count 79 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 154 place count 78 transition count 219
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 154 place count 78 transition count 217
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 158 place count 76 transition count 217
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 161 place count 76 transition count 214
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 164 place count 73 transition count 214
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 169 place count 73 transition count 214
Applied a total of 169 rules in 133 ms. Remains 73 /143 variables (removed 70) and now considering 214/285 (removed 71) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 73/143 places, 214/285 transitions.
RANDOM walk for 40000 steps (2369 resets) in 1185 ms. (33 steps per ms) remains 1/4 properties
FORMULA MedleyA-PT-07-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-07-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-07-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-07-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (502 resets) in 278 ms. (143 steps per ms) remains 1/1 properties
// Phase 1: matrix 214 rows 73 cols
[2024-06-02 19:07:24] [INFO ] Computed 8 invariants in 7 ms
[2024-06-02 19:07:24] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/67 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 214/281 variables, 67/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/287 variables, 6/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 101 constraints, problems are : Problem set: 0 solved, 1 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 20/20 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/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/67 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:07:25] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 214/281 variables, 67/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/287 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/287 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/287 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/287 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 635 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 913ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 160 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=160 )
FORMULA MedleyA-PT-07-ReachabilityFireability-2024-14 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 13 ms.
All properties solved without resorting to model-checking.
Total runtime 12334 ms.
ITS solved all properties within timeout

BK_STOP 1717355245778

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

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