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.r504-tall-171649612600358.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 ltsminxred
Input is LeafsetExtension-PT-S16C4, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612600358
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 19 18:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 13:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 12 13:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 12 13:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Apr 12 13:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 905K 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-S16C4-ReachabilityCardinality-2024-00
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-01
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-02
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-03
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-04
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-05
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-06
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-07
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-08
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-09
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-10
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-11
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-12
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-13
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-14
FORMULA_NAME LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717228514105

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S16C4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:55:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:55:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:55:15] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2024-06-01 07:55:15] [INFO ] Transformed 1542 places.
[2024-06-01 07:55:15] [INFO ] Transformed 1449 transitions.
[2024-06-01 07:55:15] [INFO ] Parsed PT model containing 1542 places and 1449 transitions and 4668 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1189 resets) in 2062 ms. (19 steps per ms) remains 12/16 properties
FORMULA LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (113 resets) in 204 ms. (195 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (117 resets) in 392 ms. (101 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (114 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (115 resets) in 374 ms. (106 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (111 resets) in 91 ms. (434 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (112 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (118 resets) in 95 ms. (416 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (113 resets) in 160 ms. (248 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (114 resets) in 86 ms. (459 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (116 resets) in 634 ms. (62 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (115 resets) in 66 ms. (597 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (113 resets) in 61 ms. (645 steps per ms) remains 12/12 properties
// Phase 1: matrix 1449 rows 1542 cols
[2024-06-01 07:55:17] [INFO ] Computed 93 invariants in 90 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-04 is UNSAT
FORMULA LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-13 is UNSAT
FORMULA LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 5/142 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Problem LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-00 is UNSAT
FORMULA LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-09 is UNSAT
FORMULA LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-14 is UNSAT
FORMULA LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-15 is UNSAT
FORMULA LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 1335/1477 variables, 55/60 constraints. Problems are: Problem set: 6 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 0/60 constraints. Problems are: Problem set: 6 solved, 6 unsolved
Problem LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-01 is UNSAT
FORMULA LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-03 is UNSAT
FORMULA LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-05 is UNSAT
FORMULA LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-07 is UNSAT
FORMULA LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 14/1491 variables, 14/74 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1491 variables, 0/74 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 51/1542 variables, 19/93 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1542 variables, 0/93 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1449/2991 variables, 1542/1635 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2991 variables, 0/1635 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2991 variables, 0/1635 constraints. Problems are: Problem set: 10 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2991/2991 variables, and 1635 constraints, problems are : Problem set: 10 solved, 2 unsolved in 1585 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 74/74 constraints, State Equation: 1542/1542 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1369/1405 variables, 36/36 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1405 variables, 0/36 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/1424 variables, 19/55 constraints. Problems are: Problem set: 10 solved, 2 unsolved
[2024-06-01 07:55:19] [INFO ] Deduced a trap composed of 70 places in 705 ms of which 84 ms to minimize.
[2024-06-01 07:55:20] [INFO ] Deduced a trap composed of 79 places in 618 ms of which 11 ms to minimize.
[2024-06-01 07:55:21] [INFO ] Deduced a trap composed of 79 places in 586 ms of which 13 ms to minimize.
[2024-06-01 07:55:21] [INFO ] Deduced a trap composed of 70 places in 580 ms of which 9 ms to minimize.
[2024-06-01 07:55:22] [INFO ] Deduced a trap composed of 95 places in 535 ms of which 10 ms to minimize.
[2024-06-01 07:55:22] [INFO ] Deduced a trap composed of 95 places in 548 ms of which 10 ms to minimize.
[2024-06-01 07:55:23] [INFO ] Deduced a trap composed of 70 places in 577 ms of which 9 ms to minimize.
[2024-06-01 07:55:24] [INFO ] Deduced a trap composed of 95 places in 575 ms of which 11 ms to minimize.
SMT process timed out in 7122ms, After SMT, problems are : Problem set: 10 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 1542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1542/1542 places, 1449/1449 transitions.
Graph (complete) has 2953 edges and 1542 vertex of which 473 are kept as prefixes of interest. Removing 1069 places using SCC suffix rule.4 ms
Discarding 1069 places :
Also discarding 537 output transitions
Drop transitions (Output transitions of discarded places.) removed 537 transitions
Drop transitions (Empty/Sink Transition effects.) removed 234 transitions
Reduce isomorphic transitions removed 234 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 360 rules applied. Total rules applied 361 place count 473 transition count 552
Reduce places removed 128 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 143 rules applied. Total rules applied 504 place count 345 transition count 537
Reduce places removed 15 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 25 rules applied. Total rules applied 529 place count 330 transition count 527
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 539 place count 320 transition count 527
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 539 place count 320 transition count 502
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 589 place count 295 transition count 502
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 607 place count 277 transition count 484
Iterating global reduction 4 with 18 rules applied. Total rules applied 625 place count 277 transition count 484
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 633 place count 277 transition count 476
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 641 place count 269 transition count 476
Partial Free-agglomeration rule applied 77 times.
Drop transitions (Partial Free agglomeration) removed 77 transitions
Iterating global reduction 5 with 77 rules applied. Total rules applied 718 place count 269 transition count 476
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 5 with 6 rules applied. Total rules applied 724 place count 263 transition count 476
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 728 place count 263 transition count 472
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 732 place count 259 transition count 472
Applied a total of 732 rules in 145 ms. Remains 259 /1542 variables (removed 1283) and now considering 472/1449 (removed 977) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 259/1542 places, 472/1449 transitions.
RANDOM walk for 40000 steps (3262 resets) in 759 ms. (52 steps per ms) remains 1/2 properties
FORMULA LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (199 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
[2024-06-01 07:55:24] [INFO ] Flow matrix only has 369 transitions (discarded 103 similar events)
// Phase 1: matrix 369 rows 259 cols
[2024-06-01 07:55:24] [INFO ] Computed 5 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 112/122 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 324/446 variables, 142/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 11/457 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 9/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 164/621 variables, 84/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/621 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/626 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/626 variables, 5/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/626 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/628 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/628 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/628 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 628/628 variables, and 264 constraints, problems are : Problem set: 0 solved, 1 unsolved in 142 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 259/259 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 112/122 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 324/446 variables, 142/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/457 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 9/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 164/621 variables, 84/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/621 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/626 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/626 variables, 5/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/626 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/628 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/628 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/628 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 628/628 variables, and 265 constraints, problems are : Problem set: 0 solved, 1 unsolved in 216 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 259/259 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 372ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
FORMULA LeafsetExtension-PT-S16C4-ReachabilityCardinality-2024-11 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 6 ms.
All properties solved without resorting to model-checking.
Total runtime 9639 ms.
ITS solved all properties within timeout

BK_STOP 1717228524963

--------------------
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-S16C4"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is LeafsetExtension-PT-S16C4, 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 r504-tall-171649612600358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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