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-171640600800126.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-18b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640600800126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.4K 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 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 13 08:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 13 08:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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.2M 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-18b-ReachabilityCardinality-2024-00
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-01
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-02
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-03
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-04
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-05
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-06
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-07
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-08
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-09
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-10
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-11
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-12
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-13
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-14
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716426315046

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-18b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 01:05:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 01:05:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 01:05:16] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2024-05-23 01:05:16] [INFO ] Transformed 4370 places.
[2024-05-23 01:05:16] [INFO ] Transformed 5037 transitions.
[2024-05-23 01:05:16] [INFO ] Found NUPN structural information;
[2024-05-23 01:05:16] [INFO ] Parsed PT model containing 4370 places and 5037 transitions and 12657 arcs in 356 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (326 resets) in 2598 ms. (15 steps per ms) remains 11/15 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (26 resets) in 215 ms. (185 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (24 resets) in 369 ms. (108 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (24 resets) in 296 ms. (134 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (24 resets) in 88 ms. (449 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (25 resets) in 177 ms. (224 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (26 resets) in 99 ms. (400 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (24 resets) in 104 ms. (380 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (25 resets) in 93 ms. (425 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (25 resets) in 102 ms. (388 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (28 resets) in 96 ms. (412 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (25 resets) in 77 ms. (512 steps per ms) remains 11/11 properties
// Phase 1: matrix 5037 rows 4370 cols
[2024-05-23 01:05:18] [INFO ] Computed 20 invariants in 169 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 4135/4259 variables, 18/142 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4259 variables, 4135/4277 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4259 variables, 0/4277 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 111/4370 variables, 2/4279 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4370 variables, 111/4390 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4370 variables, 0/4390 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 5037/9407 variables, 4370/8760 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9407/9407 variables, and 8760 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5067 ms.
Refiners :[Domain max(s): 4370/4370 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 4370/4370 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 4135/4259 variables, 18/142 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4259 variables, 4135/4277 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-23 01:05:27] [INFO ] Deduced a trap composed of 474 places in 3245 ms of which 186 ms to minimize.
[2024-05-23 01:05:30] [INFO ] Deduced a trap composed of 1652 places in 3029 ms of which 25 ms to minimize.
SMT process timed out in 12751ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 124 out of 4370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4370/4370 places, 5037/5037 transitions.
Graph (trivial) has 4131 edges and 4370 vertex of which 104 / 4370 are part of one of the 17 SCC in 15 ms
Free SCC test removed 87 places
Drop transitions (Empty/Sink Transition effects.) removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1006 transitions
Trivial Post-agglo rules discarded 1006 transitions
Performed 1006 trivial Post agglomeration. Transition count delta: 1006
Iterating post reduction 0 with 1006 rules applied. Total rules applied 1007 place count 4283 transition count 3926
Reduce places removed 1006 places and 0 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 1 with 1037 rules applied. Total rules applied 2044 place count 3277 transition count 3895
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 2075 place count 3246 transition count 3895
Performed 266 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 266 Pre rules applied. Total rules applied 2075 place count 3246 transition count 3629
Deduced a syphon composed of 266 places in 6 ms
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 3 with 532 rules applied. Total rules applied 2607 place count 2980 transition count 3629
Discarding 1689 places :
Symmetric choice reduction at 3 with 1689 rule applications. Total rules 4296 place count 1291 transition count 1940
Iterating global reduction 3 with 1689 rules applied. Total rules applied 5985 place count 1291 transition count 1940
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 5985 place count 1291 transition count 1934
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 5997 place count 1285 transition count 1934
Discarding 238 places :
Symmetric choice reduction at 3 with 238 rule applications. Total rules 6235 place count 1047 transition count 1696
Iterating global reduction 3 with 238 rules applied. Total rules applied 6473 place count 1047 transition count 1696
Ensure Unique test removed 215 transitions
Reduce isomorphic transitions removed 215 transitions.
Iterating post reduction 3 with 215 rules applied. Total rules applied 6688 place count 1047 transition count 1481
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 4 with 204 rules applied. Total rules applied 6892 place count 945 transition count 1379
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 6923 place count 945 transition count 1348
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 6937 place count 931 transition count 1334
Iterating global reduction 5 with 14 rules applied. Total rules applied 6951 place count 931 transition count 1334
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 6952 place count 931 transition count 1333
Free-agglomeration rule applied 665 times.
Iterating global reduction 5 with 665 rules applied. Total rules applied 7617 place count 931 transition count 668
Reduce places removed 665 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Iterating post reduction 5 with 876 rules applied. Total rules applied 8493 place count 266 transition count 457
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 6 with 37 rules applied. Total rules applied 8530 place count 266 transition count 420
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 8534 place count 266 transition count 420
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 8535 place count 266 transition count 419
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 8536 place count 266 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 8537 place count 265 transition count 418
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 94 edges and 264 vertex of which 26 / 264 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
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 7 with 9 rules applied. Total rules applied 8546 place count 251 transition count 411
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 34 rules applied. Total rules applied 8580 place count 244 transition count 384
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 8581 place count 243 transition count 384
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 16 Pre rules applied. Total rules applied 8581 place count 243 transition count 368
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 10 with 32 rules applied. Total rules applied 8613 place count 227 transition count 368
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 8627 place count 227 transition count 354
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 11 with 36 rules applied. Total rules applied 8663 place count 209 transition count 336
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 8664 place count 209 transition count 335
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 8666 place count 208 transition count 335
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 8668 place count 208 transition count 333
Free-agglomeration rule applied 18 times.
Iterating global reduction 12 with 18 rules applied. Total rules applied 8686 place count 208 transition count 315
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 12 with 31 rules applied. Total rules applied 8717 place count 189 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 13 with 9 rules applied. Total rules applied 8726 place count 189 transition count 294
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 8727 place count 189 transition count 293
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 8729 place count 188 transition count 292
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 8730 place count 188 transition count 292
Applied a total of 8730 rules in 1421 ms. Remains 188 /4370 variables (removed 4182) and now considering 292/5037 (removed 4745) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1431 ms. Remains : 188/4370 places, 292/5037 transitions.
RANDOM walk for 40000 steps (8 resets) in 319 ms. (125 steps per ms) remains 6/11 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 5/6 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 4/5 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 3/4 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 137 ms. (289 steps per ms) remains 2/3 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 1/2 properties
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 292 rows 188 cols
[2024-05-23 01:05:32] [INFO ] Computed 18 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/213 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 64/277 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/306 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 15/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 54/360 variables, 25/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 19/379 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/379 variables, 9/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/379 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/397 variables, 12/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/397 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/402 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/402 variables, 5/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/402 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/402 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/480 variables, and 170 constraints, problems are : Problem set: 0 solved, 1 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, State Equation: 157/188 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/213 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 64/277 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 29/306 variables, 5/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 15/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 54/360 variables, 25/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/360 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 19/379 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/379 variables, 9/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/379 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 18/397 variables, 12/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/397 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 5/402 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/402 variables, 5/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/402 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/402 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/480 variables, and 171 constraints, problems are : Problem set: 0 solved, 1 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, State Equation: 157/188 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 274ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 9 ms.
All properties solved without resorting to model-checking.
Total runtime 16854 ms.
ITS solved all properties within timeout

BK_STOP 1716426333381

--------------------
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 ReachabilityCardinality -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-18b"
export BK_EXAMINATION="ReachabilityCardinality"
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-18b, examination is ReachabilityCardinality"
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-171640600800126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-18b.tgz
mv FlexibleBarrier-PT-18b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;