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.r496-tall-171640602900230.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 FunctionPointer-PT-b004, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602900230
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 11 16:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 11 16:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 391K 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 FunctionPointer-PT-b004-ReachabilityCardinality-2024-00
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-2024-01
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-2024-02
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-2024-03
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-2024-04
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-2024-05
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-2024-06
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-2024-07
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-2024-08
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-2024-09
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-2024-10
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-2024-11
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-2024-12
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-2024-13
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-2024-14
FORMULA_NAME FunctionPointer-PT-b004-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717188234946

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:43:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:43:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:43:56] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-05-31 20:43:56] [INFO ] Transformed 306 places.
[2024-05-31 20:43:56] [INFO ] Transformed 840 transitions.
[2024-05-31 20:43:56] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (65 resets) in 1011 ms. (39 steps per ms) remains 2/10 properties
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (11 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (13 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
[2024-05-31 20:43:56] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2024-05-31 20:43:56] [INFO ] Computed 4 invariants in 24 ms
[2024-05-31 20:43:56] [INFO ] State equation strengthened by 65 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem FunctionPointer-PT-b004-ReachabilityCardinality-2024-08 is UNSAT
FORMULA FunctionPointer-PT-b004-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 36/40 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/42 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 183/226 variables, 43/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 18/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 230/456 variables, 107/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 47/218 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/462 variables, 1/219 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 0/219 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 80/542 variables, 54/273 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/542 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 86/628 variables, 10/283 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/628 variables, 0/283 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/636 variables, 8/291 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/636 variables, 0/291 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/636 variables, 0/291 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 636/636 variables, and 291 constraints, problems are : Problem set: 1 solved, 1 unsolved in 487 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 222/222 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 173/182 variables, 9/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 3/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 1/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/216 variables, 2/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 4/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/217 variables, 1/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 239/456 variables, 133/157 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/456 variables, 62/219 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/456 variables, 0/219 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/462 variables, 1/220 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/462 variables, 0/220 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 80/542 variables, 54/274 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/542 variables, 0/274 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 86/628 variables, 10/284 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/628 variables, 0/284 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 8/636 variables, 8/292 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/636 variables, 0/292 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/636 variables, 0/292 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 636/636 variables, and 292 constraints, problems are : Problem set: 1 solved, 1 unsolved in 452 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 222/222 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1048ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 96 ms.
Support contains 3 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 195 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.2 ms
Discarding 27 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 195 transition count 610
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 67 place count 167 transition count 448
Iterating global reduction 1 with 28 rules applied. Total rules applied 95 place count 167 transition count 448
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 125 place count 167 transition count 418
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 140 place count 152 transition count 388
Iterating global reduction 2 with 15 rules applied. Total rules applied 155 place count 152 transition count 388
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 159 place count 152 transition count 384
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 165 place count 146 transition count 372
Iterating global reduction 3 with 6 rules applied. Total rules applied 171 place count 146 transition count 372
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 177 place count 140 transition count 348
Iterating global reduction 3 with 6 rules applied. Total rules applied 183 place count 140 transition count 348
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 189 place count 134 transition count 336
Iterating global reduction 3 with 6 rules applied. Total rules applied 195 place count 134 transition count 336
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 201 place count 128 transition count 312
Iterating global reduction 3 with 6 rules applied. Total rules applied 207 place count 128 transition count 312
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 213 place count 122 transition count 288
Iterating global reduction 3 with 6 rules applied. Total rules applied 219 place count 122 transition count 288
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 225 place count 116 transition count 276
Iterating global reduction 3 with 6 rules applied. Total rules applied 231 place count 116 transition count 276
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 237 place count 110 transition count 264
Iterating global reduction 3 with 6 rules applied. Total rules applied 243 place count 110 transition count 264
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 249 place count 104 transition count 252
Iterating global reduction 3 with 6 rules applied. Total rules applied 255 place count 104 transition count 252
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 261 place count 98 transition count 240
Iterating global reduction 3 with 6 rules applied. Total rules applied 267 place count 98 transition count 240
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 273 place count 92 transition count 228
Iterating global reduction 3 with 6 rules applied. Total rules applied 279 place count 92 transition count 228
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 283 place count 92 transition count 224
Applied a total of 283 rules in 116 ms. Remains 92 /222 variables (removed 130) and now considering 224/648 (removed 424) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 92/222 places, 224/648 transitions.
RANDOM walk for 40008 steps (8 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1767655 steps, run timeout after 3001 ms. (steps per millisecond=589 ) properties seen :0 out of 1
Probabilistic random walk after 1767655 steps, saw 1095345 distinct states, run finished after 3005 ms. (steps per millisecond=588 ) properties seen :0
[2024-05-31 20:44:01] [INFO ] Flow matrix only has 143 transitions (discarded 81 similar events)
// Phase 1: matrix 143 rows 92 cols
[2024-05-31 20:44:01] [INFO ] Computed 3 invariants in 2 ms
[2024-05-31 20:44:01] [INFO ] State equation strengthened by 25 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/92 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/101 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 105/206 variables, 60/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 22/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/212 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/228 variables, 13/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/228 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/232 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/232 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/235 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/235 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/235 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 120 constraints, problems are : Problem set: 0 solved, 1 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 92/92 constraints, ReadFeed: 25/25 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/92 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/101 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 105/206 variables, 60/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 22/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/212 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/212 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 16/228 variables, 13/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/228 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/232 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/232 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/235 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/235 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/235 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 121 constraints, problems are : Problem set: 0 solved, 1 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 92/92 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 248ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 224/224 transitions.
Applied a total of 0 rules in 10 ms. Remains 92 /92 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 92/92 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 224/224 transitions.
Applied a total of 0 rules in 8 ms. Remains 92 /92 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-05-31 20:44:01] [INFO ] Flow matrix only has 143 transitions (discarded 81 similar events)
[2024-05-31 20:44:01] [INFO ] Invariant cache hit.
[2024-05-31 20:44:01] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-31 20:44:01] [INFO ] Flow matrix only has 143 transitions (discarded 81 similar events)
[2024-05-31 20:44:01] [INFO ] Invariant cache hit.
[2024-05-31 20:44:01] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-31 20:44:01] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2024-05-31 20:44:01] [INFO ] Redundant transitions in 7 ms returned []
Running 222 sub problems to find dead transitions.
[2024-05-31 20:44:01] [INFO ] Flow matrix only has 143 transitions (discarded 81 similar events)
[2024-05-31 20:44:01] [INFO ] Invariant cache hit.
[2024-05-31 20:44:01] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 143/234 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 25/119 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 1/235 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 0/235 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 120 constraints, problems are : Problem set: 0 solved, 222 unsolved in 6475 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 92/92 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 143/234 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 25/119 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 32/151 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 1/235 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 190/342 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (OVERLAPS) 0/235 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 342 constraints, problems are : Problem set: 0 solved, 222 unsolved in 7212 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 92/92 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints]
After SMT, in 13887ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 13892ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14205 ms. Remains : 92/92 places, 224/224 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 92 transition count 135
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 97 place count 84 transition count 135
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 97 place count 84 transition count 116
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 135 place count 65 transition count 116
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 165 place count 50 transition count 101
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 172 place count 43 transition count 87
Iterating global reduction 2 with 7 rules applied. Total rules applied 179 place count 43 transition count 87
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 186 place count 36 transition count 73
Iterating global reduction 2 with 7 rules applied. Total rules applied 193 place count 36 transition count 73
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 200 place count 29 transition count 59
Iterating global reduction 2 with 7 rules applied. Total rules applied 207 place count 29 transition count 59
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 214 place count 29 transition count 52
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 214 place count 29 transition count 51
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 216 place count 28 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 220 place count 26 transition count 51
Applied a total of 220 rules in 23 ms. Remains 26 /92 variables (removed 66) and now considering 51/224 (removed 173) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 51 rows 26 cols
[2024-05-31 20:44:15] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 20:44:15] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 20:44:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:44:15] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 20:44:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 20:44:15] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 20:44:15] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 20:44:15] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 108 ms.
[2024-05-31 20:44:15] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-05-31 20:44:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 92 places, 224 transitions and 914 arcs took 5 ms.
[2024-05-31 20:44:16] [INFO ] Flatten gal took : 47 ms
Total runtime 19981 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : FunctionPointer-PT-b004-ReachabilityCardinality-2024-00

BK_STOP 1717188256274

--------------------
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:
++ 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
++ sed s/.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
mcc2024
rfs formula name FunctionPointer-PT-b004-ReachabilityCardinality-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/532/inv_0_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="FunctionPointer-PT-b004"
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 FunctionPointer-PT-b004, 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 r496-tall-171640602900230"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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