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.r179-tall-171640600900159.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 FlexibleBarrier-PT-22b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640600900159
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 13 08:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 13 08:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 08:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 118K Apr 13 08:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.8M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716430747173

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-22b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:19:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 02:19:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:19:08] [INFO ] Load time of PNML (sax parser for PT used): 258 ms
[2024-05-23 02:19:08] [INFO ] Transformed 6478 places.
[2024-05-23 02:19:08] [INFO ] Transformed 7469 transitions.
[2024-05-23 02:19:08] [INFO ] Found NUPN structural information;
[2024-05-23 02:19:08] [INFO ] Parsed PT model containing 6478 places and 7469 transitions and 18797 arcs in 418 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (272 resets) in 2053 ms. (19 steps per ms) remains 12/16 properties
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (17 resets) in 183 ms. (217 steps per ms) remains 11/12 properties
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (19 resets) in 117 ms. (339 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (17 resets) in 580 ms. (68 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (19 resets) in 123 ms. (322 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (18 resets) in 96 ms. (412 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (18 resets) in 113 ms. (350 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (17 resets) in 68 ms. (579 steps per ms) remains 10/11 properties
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (18 resets) in 59 ms. (666 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 9/10 properties
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 7469 rows 6478 cols
[2024-05-23 02:19:10] [INFO ] Computed 24 invariants in 252 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 187/187 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem FlexibleBarrier-PT-22b-ReachabilityFireability-2024-05 is UNSAT
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 6291/6478 variables, 24/211 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6478 variables, 6291/6502 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6478 variables, 0/6502 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13947/13947 variables, and 12980 constraints, problems are : Problem set: 1 solved, 8 unsolved in 5059 ms.
Refiners :[Domain max(s): 6478/6478 constraints, Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 6478/6478 constraints, PredecessorRefiner: 9/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 179/179 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem FlexibleBarrier-PT-22b-ReachabilityFireability-2024-00 is UNSAT
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 6299/6478 variables, 24/203 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6478 variables, 6299/6502 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-05-23 02:19:17] [INFO ] Deduced a trap composed of 374 places in 539 ms of which 68 ms to minimize.
[2024-05-23 02:19:18] [INFO ] Deduced a trap composed of 396 places in 237 ms of which 4 ms to minimize.
[2024-05-23 02:19:18] [INFO ] Deduced a trap composed of 321 places in 230 ms of which 4 ms to minimize.
[2024-05-23 02:19:18] [INFO ] Deduced a trap composed of 200 places in 456 ms of which 7 ms to minimize.
[2024-05-23 02:19:24] [INFO ] Deduced a trap composed of 110 places in 5018 ms of which 32 ms to minimize.
SMT process timed out in 13939ms, After SMT, problems are : Problem set: 2 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 157 out of 6478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6478/6478 places, 7469/7469 transitions.
Graph (trivial) has 4956 edges and 6478 vertex of which 74 / 6478 are part of one of the 12 SCC in 24 ms
Free SCC test removed 62 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1079 transitions
Trivial Post-agglo rules discarded 1079 transitions
Performed 1079 trivial Post agglomeration. Transition count delta: 1079
Iterating post reduction 0 with 1079 rules applied. Total rules applied 1080 place count 6416 transition count 6315
Reduce places removed 1079 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 1098 rules applied. Total rules applied 2178 place count 5337 transition count 6296
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 2197 place count 5318 transition count 6296
Performed 857 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 857 Pre rules applied. Total rules applied 2197 place count 5318 transition count 5439
Deduced a syphon composed of 857 places in 5 ms
Reduce places removed 857 places and 0 transitions.
Iterating global reduction 3 with 1714 rules applied. Total rules applied 3911 place count 4461 transition count 5439
Discarding 2614 places :
Symmetric choice reduction at 3 with 2614 rule applications. Total rules 6525 place count 1847 transition count 2825
Iterating global reduction 3 with 2614 rules applied. Total rules applied 9139 place count 1847 transition count 2825
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 9139 place count 1847 transition count 2813
Deduced a syphon composed of 12 places in 6 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 9163 place count 1835 transition count 2813
Discarding 388 places :
Symmetric choice reduction at 3 with 388 rule applications. Total rules 9551 place count 1447 transition count 2425
Iterating global reduction 3 with 388 rules applied. Total rules applied 9939 place count 1447 transition count 2425
Ensure Unique test removed 366 transitions
Reduce isomorphic transitions removed 366 transitions.
Iterating post reduction 3 with 366 rules applied. Total rules applied 10305 place count 1447 transition count 2059
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 1 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 4 with 290 rules applied. Total rules applied 10595 place count 1302 transition count 1914
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 10611 place count 1294 transition count 1914
Free-agglomeration rule applied 314 times.
Iterating global reduction 4 with 314 rules applied. Total rules applied 10925 place count 1294 transition count 1600
Reduce places removed 314 places and 0 transitions.
Iterating post reduction 4 with 314 rules applied. Total rules applied 11239 place count 980 transition count 1600
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 11246 place count 973 transition count 1593
Iterating global reduction 5 with 7 rules applied. Total rules applied 11253 place count 973 transition count 1593
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 11260 place count 973 transition count 1586
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 11279 place count 973 transition count 1567
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 11290 place count 973 transition count 1567
Applied a total of 11290 rules in 1944 ms. Remains 973 /6478 variables (removed 5505) and now considering 1567/7469 (removed 5902) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1961 ms. Remains : 973/6478 places, 1567/7469 transitions.
RANDOM walk for 40000 steps (623 resets) in 2681 ms. (14 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (28 resets) in 45 ms. (869 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (25 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (25 resets) in 79 ms. (500 steps per ms) remains 6/7 properties
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (27 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (26 resets) in 170 ms. (233 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (28 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
[2024-05-23 02:19:27] [INFO ] Flow matrix only has 1537 transitions (discarded 30 similar events)
// Phase 1: matrix 1537 rows 973 cols
[2024-05-23 02:19:27] [INFO ] Computed 24 invariants in 36 ms
[2024-05-23 02:19:27] [INFO ] State equation strengthened by 296 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 865/953 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/953 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 20/973 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/973 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1537/2510 variables, 973/997 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2510 variables, 296/1293 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2510 variables, 0/1293 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/2510 variables, 0/1293 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2510/2510 variables, and 1293 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1210 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 973/973 constraints, ReadFeed: 296/296 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 865/953 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 02:19:28] [INFO ] Deduced a trap composed of 485 places in 374 ms of which 5 ms to minimize.
[2024-05-23 02:19:29] [INFO ] Deduced a trap composed of 489 places in 355 ms of which 6 ms to minimize.
[2024-05-23 02:19:29] [INFO ] Deduced a trap composed of 42 places in 386 ms of which 6 ms to minimize.
[2024-05-23 02:19:30] [INFO ] Deduced a trap composed of 31 places in 361 ms of which 6 ms to minimize.
[2024-05-23 02:19:30] [INFO ] Deduced a trap composed of 8 places in 372 ms of which 5 ms to minimize.
[2024-05-23 02:19:30] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 2 ms to minimize.
[2024-05-23 02:19:30] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-05-23 02:19:30] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
[2024-05-23 02:19:31] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/953 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 02:19:31] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/953 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 02:19:31] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/953 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/953 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 20/973 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/973 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1537/2510 variables, 973/1008 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2510 variables, 296/1304 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2510 variables, 6/1310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 02:19:33] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-05-23 02:19:33] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2510 variables, 2/1312 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2510 variables, 0/1312 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/2510 variables, 0/1312 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2510/2510 variables, and 1312 constraints, problems are : Problem set: 0 solved, 6 unsolved in 7552 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 973/973 constraints, ReadFeed: 296/296 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 13/13 constraints]
After SMT, in 8884ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 3423 steps, including 123 resets, run visited all 1 properties in 22 ms. (steps per millisecond=155 )
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 667 ms.
All properties solved without resorting to model-checking.
Total runtime 28405 ms.
ITS solved all properties within timeout

BK_STOP 1716430776742

--------------------
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="FlexibleBarrier-PT-22b"
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 FlexibleBarrier-PT-22b, 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 r179-tall-171640600900159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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