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.r223-tall-171649611300366.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 LeafsetExtension-PT-S32C2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649611300366
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 15K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 13:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 13:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 12 13:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 13:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.4M 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 LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-00
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-01
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-02
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-03
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-04
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-05
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-06
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-07
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-08
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-09
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-10
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-11
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-12
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-13
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-14
FORMULA_NAME LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716544594172

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S32C2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 09:56:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 09:56:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 09:56:35] [INFO ] Load time of PNML (sax parser for PT used): 300 ms
[2024-05-24 09:56:35] [INFO ] Transformed 5622 places.
[2024-05-24 09:56:35] [INFO ] Transformed 5449 transitions.
[2024-05-24 09:56:35] [INFO ] Parsed PT model containing 5622 places and 5449 transitions and 17500 arcs in 446 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (2191 resets) in 2075 ms. (19 steps per ms) remains 11/16 properties
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (181 resets) in 253 ms. (157 steps per ms) remains 10/11 properties
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (181 resets) in 655 ms. (60 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (178 resets) in 179 ms. (222 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (182 resets) in 177 ms. (224 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (182 resets) in 177 ms. (224 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (180 resets) in 1060 ms. (37 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (181 resets) in 234 ms. (170 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (92 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (183 resets) in 171 ms. (232 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (182 resets) in 113 ms. (350 steps per ms) remains 10/10 properties
// Phase 1: matrix 5449 rows 5622 cols
[2024-05-24 09:56:37] [INFO ] Computed 173 invariants in 268 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-06 is UNSAT
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-10 is UNSAT
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-13 is UNSAT
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 5259/5474 variables, 102/103 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5474 variables, 0/103 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Problem LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-01 is UNSAT
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-07 is UNSAT
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-11 is UNSAT
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-15 is UNSAT
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 34/5508 variables, 34/137 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5508 variables, 0/137 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 114/5622 variables, 36/173 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5622 variables, 0/173 constraints. Problems are: Problem set: 7 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11071/11071 variables, and 5795 constraints, problems are : Problem set: 7 solved, 3 unsolved in 5059 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 138/138 constraints, State Equation: 5622/5622 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 3 unsolved
Problem LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-14 is UNSAT
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 5283/5425 variables, 86/86 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5425 variables, 0/86 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/5460 variables, 35/121 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5460 variables, 0/121 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 162/5622 variables, 52/173 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5622 variables, 0/173 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5449/11071 variables, 5622/5795 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/11071 variables, 2/5797 constraints. Problems are: Problem set: 8 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 11071/11071 variables, and 5797 constraints, problems are : Problem set: 8 solved, 2 unsolved in 5031 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 138/138 constraints, State Equation: 5622/5622 constraints, PredecessorRefiner: 2/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 10525ms problems are : Problem set: 8 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 84 out of 5622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5622/5622 places, 5449/5449 transitions.
Graph (complete) has 11001 edges and 5622 vertex of which 1465 are kept as prefixes of interest. Removing 4157 places using SCC suffix rule.12 ms
Discarding 4157 places :
Also discarding 2040 output transitions
Drop transitions (Output transitions of discarded places.) removed 2040 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1013 transitions
Reduce isomorphic transitions removed 1013 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 525 transitions
Trivial Post-agglo rules discarded 525 transitions
Performed 525 trivial Post agglomeration. Transition count delta: 525
Iterating post reduction 0 with 1538 rules applied. Total rules applied 1539 place count 1465 transition count 1871
Reduce places removed 527 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 1 with 561 rules applied. Total rules applied 2100 place count 938 transition count 1837
Reduce places removed 34 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 43 rules applied. Total rules applied 2143 place count 904 transition count 1828
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 2152 place count 895 transition count 1828
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 49 Pre rules applied. Total rules applied 2152 place count 895 transition count 1779
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 2250 place count 846 transition count 1779
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 2265 place count 831 transition count 1764
Iterating global reduction 4 with 15 rules applied. Total rules applied 2280 place count 831 transition count 1764
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 4 with 20 rules applied. Total rules applied 2300 place count 831 transition count 1744
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 2320 place count 811 transition count 1744
Partial Free-agglomeration rule applied 387 times.
Drop transitions (Partial Free agglomeration) removed 387 transitions
Iterating global reduction 5 with 387 rules applied. Total rules applied 2707 place count 811 transition count 1744
Discarding 14 places :
Implicit places reduction removed 14 places
Iterating post reduction 5 with 14 rules applied. Total rules applied 2721 place count 797 transition count 1744
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 6 with 11 rules applied. Total rules applied 2732 place count 797 transition count 1733
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 2743 place count 786 transition count 1733
Applied a total of 2743 rules in 469 ms. Remains 786 /5622 variables (removed 4836) and now considering 1733/5449 (removed 3716) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 479 ms. Remains : 786/5622 places, 1733/5449 transitions.
RANDOM walk for 40000 steps (6701 resets) in 860 ms. (46 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (280 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (278 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 115377 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 2
Probabilistic random walk after 115377 steps, saw 40052 distinct states, run finished after 3005 ms. (steps per millisecond=38 ) properties seen :0
[2024-05-24 09:56:51] [INFO ] Flow matrix only has 1287 transitions (discarded 446 similar events)
// Phase 1: matrix 1287 rows 786 cols
[2024-05-24 09:56:51] [INFO ] Computed 3 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 567/653 variables, 86/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/653 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1172/1825 variables, 538/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1825 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 32/1857 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1857 variables, 32/658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1857 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1858 variables, 1/659 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1858 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1858 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 215/2073 variables, 129/789 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2073 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/2073 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2073/2073 variables, and 789 constraints, problems are : Problem set: 0 solved, 2 unsolved in 718 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 786/786 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 567/653 variables, 86/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/653 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1172/1825 variables, 538/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1825 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 32/1857 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1857 variables, 32/658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1857 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/1858 variables, 1/659 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1858 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1858 variables, 2/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1858 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 215/2073 variables, 129/791 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2073 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2073 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2073/2073 variables, and 791 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1341 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 786/786 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2125ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
FORMULA LeafsetExtension-PT-S32C2-ReachabilityCardinality-2024-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 10 ms.
All properties solved without resorting to model-checking.
Total runtime 18675 ms.
ITS solved all properties within timeout

BK_STOP 1716544614040

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="LeafsetExtension-PT-S32C2"
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 LeafsetExtension-PT-S32C2, 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 r223-tall-171649611300366"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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