Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r179-tall-171640601200270.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 FunctionPointer-PT-b128, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601200270
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 880K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 16:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 11 16:07 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-b128-ReachabilityCardinality-2024-00
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2024-01
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2024-02
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2024-03
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2024-04
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2024-05
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2024-06
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2024-07
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2024-08
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2024-09
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2024-10
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2024-11
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2024-12
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2024-13
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2024-14
FORMULA_NAME FunctionPointer-PT-b128-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716433164091

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b128
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:59:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 02:59:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:59:25] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-05-23 02:59:25] [INFO ] Transformed 306 places.
[2024-05-23 02:59:25] [INFO ] Transformed 840 transitions.
[2024-05-23 02:59:25] [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 6 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40082 steps (16 resets) in 1406 ms. (28 steps per ms) remains 10/14 properties
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (27 resets) in 556 ms. (71 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (23 resets) in 457 ms. (87 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (24 resets) in 156 ms. (254 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (21 resets) in 168 ms. (236 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (29 resets) in 231 ms. (172 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (28 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (19 resets) in 75 ms. (526 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (23 resets) in 126 ms. (314 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (16 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (22 resets) in 84 ms. (470 steps per ms) remains 10/10 properties
[2024-05-23 02:59:26] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2024-05-23 02:59:26] [INFO ] Computed 4 invariants in 16 ms
[2024-05-23 02:59:26] [INFO ] State equation strengthened by 65 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem FunctionPointer-PT-b128-ReachabilityCardinality-2024-03 is UNSAT
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 59/137 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 347/484 variables, 137/141 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 60/201 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 0/201 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 138/622 variables, 71/272 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/622 variables, 5/277 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/622 variables, 0/277 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 14/636 variables, 14/291 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/636 variables, 0/291 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/636 variables, 0/291 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 636/636 variables, and 291 constraints, problems are : Problem set: 1 solved, 9 unsolved in 869 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: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 60/137 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 347/484 variables, 137/141 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 60/201 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 1/202 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 138/622 variables, 71/273 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/622 variables, 5/278 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/622 variables, 8/286 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/622 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 14/636 variables, 14/300 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/636 variables, 0/300 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/636 variables, 0/300 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 636/636 variables, and 300 constraints, problems are : Problem set: 1 solved, 9 unsolved in 1523 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: 9/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 2492ms problems are : Problem set: 1 solved, 9 unsolved
FORMULA FunctionPointer-PT-b128-ReachabilityCardinality-2024-09 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 45652 ms.
Support contains 75 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 214 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 0 output transitions
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 197 transition count 556
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 197 transition count 556
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 57 place count 197 transition count 534
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 193 transition count 526
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 193 transition count 526
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 191 transition count 522
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 191 transition count 522
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 85 place count 191 transition count 506
Applied a total of 85 rules in 140 ms. Remains 191 /222 variables (removed 31) and now considering 506/648 (removed 142) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 191/222 places, 506/648 transitions.
RANDOM walk for 40208 steps (27 resets) in 146 ms. (273 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (25 resets) in 102 ms. (388 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (18 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (28 resets) in 66 ms. (597 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (17 resets) in 67 ms. (588 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (27 resets) in 95 ms. (416 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (21 resets) in 78 ms. (506 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (19 resets) in 55 ms. (714 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (14 resets) in 55 ms. (714 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 230849 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 8
Probabilistic random walk after 230849 steps, saw 169035 distinct states, run finished after 3008 ms. (steps per millisecond=76 ) properties seen :0
[2024-05-23 03:00:18] [INFO ] Flow matrix only has 336 transitions (discarded 170 similar events)
// Phase 1: matrix 336 rows 191 cols
[2024-05-23 03:00:18] [INFO ] Computed 3 invariants in 9 ms
[2024-05-23 03:00:18] [INFO ] State equation strengthened by 62 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 53/128 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 298/426 variables, 128/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/426 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 92/518 variables, 54/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 5/247 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 9/527 variables, 9/256 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/527 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/527 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 527/527 variables, and 256 constraints, problems are : Problem set: 0 solved, 8 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 191/191 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 53/128 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 298/426 variables, 128/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/426 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 92/518 variables, 54/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 5/247 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 8/255 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/518 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 9/527 variables, 9/264 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/527 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/527 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 527/527 variables, and 264 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1239 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 191/191 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 1750ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 35377 ms.
Support contains 75 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 506/506 transitions.
Applied a total of 0 rules in 21 ms. Remains 191 /191 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 191/191 places, 506/506 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 506/506 transitions.
Applied a total of 0 rules in 16 ms. Remains 191 /191 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-23 03:00:55] [INFO ] Flow matrix only has 336 transitions (discarded 170 similar events)
[2024-05-23 03:00:55] [INFO ] Invariant cache hit.
[2024-05-23 03:00:55] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-23 03:00:55] [INFO ] Flow matrix only has 336 transitions (discarded 170 similar events)
[2024-05-23 03:00:55] [INFO ] Invariant cache hit.
[2024-05-23 03:00:55] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-23 03:00:55] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2024-05-23 03:00:55] [INFO ] Redundant transitions in 22 ms returned []
Running 504 sub problems to find dead transitions.
[2024-05-23 03:00:55] [INFO ] Flow matrix only has 336 transitions (discarded 170 similar events)
[2024-05-23 03:00:55] [INFO ] Invariant cache hit.
[2024-05-23 03:00:55] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 4 (OVERLAPS) 336/526 variables, 190/193 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 62/255 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 7 (OVERLAPS) 1/527 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/527 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 9 (OVERLAPS) 0/527 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 504 unsolved
No progress, stopping.
After SMT solving in domain Real declared 527/527 variables, and 256 constraints, problems are : Problem set: 0 solved, 504 unsolved in 28934 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 191/191 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 504/504 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 504 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 4 (OVERLAPS) 336/526 variables, 190/193 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 62/255 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 32/287 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 8 (OVERLAPS) 1/527 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/527 variables, 472/760 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/527 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 11 (OVERLAPS) 0/527 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 504 unsolved
No progress, stopping.
After SMT solving in domain Int declared 527/527 variables, and 760 constraints, problems are : Problem set: 0 solved, 504 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 191/191 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 504/504 constraints, Known Traps: 0/0 constraints]
After SMT, in 59754ms problems are : Problem set: 0 solved, 504 unsolved
Search for dead transitions found 0 dead transitions in 59767ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60288 ms. Remains : 191/191 places, 506/506 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 115 edges and 191 vertex of which 6 / 191 are part of one of the 2 SCC in 5 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 166 transitions
Reduce isomorphic transitions removed 176 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 187 transition count 323
Reduce places removed 7 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 10 rules applied. Total rules applied 18 place count 180 transition count 320
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 21 place count 177 transition count 320
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 21 place count 177 transition count 303
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 55 place count 160 transition count 303
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 159 transition count 302
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 159 transition count 302
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 59 place count 159 transition count 300
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 81 place count 148 transition count 289
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 83 place count 146 transition count 285
Iterating global reduction 4 with 2 rules applied. Total rules applied 85 place count 146 transition count 285
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 86 place count 145 transition count 283
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 145 transition count 283
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 88 place count 144 transition count 281
Iterating global reduction 4 with 1 rules applied. Total rules applied 89 place count 144 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 93 place count 144 transition count 277
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 99 place count 144 transition count 271
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 105 place count 138 transition count 271
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 107 place count 138 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 109 place count 138 transition count 269
Applied a total of 109 rules in 64 ms. Remains 138 /191 variables (removed 53) and now considering 269/506 (removed 237) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 269 rows 138 cols
[2024-05-23 03:01:55] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 03:01:55] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-23 03:01:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 03:01:56] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-23 03:01:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 03:01:56] [INFO ] After 91ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2024-05-23 03:01:56] [INFO ] After 245ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2024-05-23 03:01:56] [INFO ] After 586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Over-approximation ignoring read arcs solved 0 properties in 743 ms.
[2024-05-23 03:01:56] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 13 ms.
[2024-05-23 03:01:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 191 places, 506 transitions and 2044 arcs took 7 ms.
[2024-05-23 03:01:56] [INFO ] Flatten gal took : 64 ms
Total runtime 151397 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FunctionPointer-PT-b128

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 191
TRANSITIONS: 506
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.011s, Sys 0.000s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 581
MODEL NAME: /home/mcc/execution/413/model
191 places, 506 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
coverability test failed!!
Convergence in 11 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716433336733

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-b128"
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 FunctionPointer-PT-b128, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-171640601200270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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