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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 15:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 15:58 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-b064-ReachabilityCardinality-2024-00
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-2024-01
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-2024-02
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-2024-03
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-2024-04
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-2024-05
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-2024-06
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-2024-07
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-2024-08
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-2024-09
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-2024-10
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-2024-11
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-2024-12
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-2024-13
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-2023-14
FORMULA_NAME FunctionPointer-PT-b064-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716432890179

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-b064
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:54:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 02:54:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:54:51] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-05-23 02:54:51] [INFO ] Transformed 306 places.
[2024-05-23 02:54:51] [INFO ] Transformed 840 transitions.
[2024-05-23 02:54:51] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 224 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 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-b064-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40119 steps (30 resets) in 1138 ms. (35 steps per ms) remains 10/13 properties
FORMULA FunctionPointer-PT-b064-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b064-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b064-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (23 resets) in 167 ms. (238 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (25 resets) in 330 ms. (120 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (20 resets) in 238 ms. (167 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (30 resets) in 193 ms. (206 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (14 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (30 resets) in 57 ms. (689 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (14 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (24 resets) in 577 ms. (69 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (27 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (24 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
[2024-05-23 02:54:52] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
// Phase 1: matrix 414 rows 222 cols
[2024-05-23 02:54:52] [INFO ] Computed 4 invariants in 22 ms
[2024-05-23 02:54:52] [INFO ] State equation strengthened by 65 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem FunctionPointer-PT-b064-ReachabilityCardinality-2024-08 is UNSAT
FORMULA FunctionPointer-PT-b064-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 53/136 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 332/468 variables, 136/140 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 63/203 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 0/203 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 160/628 variables, 78/281 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/628 variables, 2/283 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/628 variables, 0/283 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 8/636 variables, 8/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 900 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/82 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 54/136 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 332/468 variables, 136/140 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 63/203 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 2/205 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 0/205 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 160/628 variables, 78/283 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/628 variables, 2/285 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/628 variables, 7/292 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/628 variables, 0/292 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 8/636 variables, 8/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 1311 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 2332ms problems are : Problem set: 1 solved, 9 unsolved
Fused 9 Parikh solutions to 7 different solutions.
FORMULA FunctionPointer-PT-b064-ReachabilityCardinality-2024-00 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 39179 ms.
Support contains 80 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.2 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 552
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 197 transition count 552
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 83 place count 197 transition count 504
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 89 place count 191 transition count 492
Iterating global reduction 1 with 6 rules applied. Total rules applied 95 place count 191 transition count 492
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 111 place count 191 transition count 476
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 127 place count 191 transition count 460
Applied a total of 127 rules in 95 ms. Remains 191 /222 variables (removed 31) and now considering 460/648 (removed 188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 191/222 places, 460/648 transitions.
RANDOM walk for 40047 steps (40 resets) in 99 ms. (400 steps per ms) remains 6/8 properties
FORMULA FunctionPointer-PT-b064-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-b064-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (25 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (26 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (32 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (25 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (22 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (19 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
[2024-05-23 02:55:34] [INFO ] Flow matrix only has 318 transitions (discarded 142 similar events)
// Phase 1: matrix 318 rows 191 cols
[2024-05-23 02:55:34] [INFO ] Computed 3 invariants in 3 ms
[2024-05-23 02:55:34] [INFO ] State equation strengthened by 63 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 58/120 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 269/389 variables, 120/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 59/182 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 105/494 variables, 57/239 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 4/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 15/509 variables, 14/257 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/509 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 509/509 variables, and 257 constraints, problems are : Problem set: 0 solved, 6 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 191/191 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 58/120 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 269/389 variables, 120/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 59/182 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 105/494 variables, 57/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 4/244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 5/249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 15/509 variables, 14/263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/509 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/509 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 509/509 variables, and 263 constraints, problems are : Problem set: 0 solved, 6 unsolved in 671 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 191/191 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1026ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 28002 ms.
Support contains 62 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 460/460 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 188 transition count 454
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 188 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 187 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 187 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 186 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 186 transition count 450
Applied a total of 10 rules in 39 ms. Remains 186 /191 variables (removed 5) and now considering 450/460 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 186/191 places, 450/460 transitions.
RANDOM walk for 40122 steps (49 resets) in 90 ms. (440 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (21 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (15 resets) in 37 ms. (1052 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (29 resets) in 47 ms. (833 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (24 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (32 resets) in 37 ms. (1052 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (26 resets) in 36 ms. (1081 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 308963 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 6
Probabilistic random walk after 308963 steps, saw 203134 distinct states, run finished after 3007 ms. (steps per millisecond=102 ) properties seen :0
[2024-05-23 02:56:06] [INFO ] Flow matrix only has 310 transitions (discarded 140 similar events)
// Phase 1: matrix 310 rows 186 cols
[2024-05-23 02:56:06] [INFO ] Computed 3 invariants in 2 ms
[2024-05-23 02:56:06] [INFO ] State equation strengthened by 62 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 55/117 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 262/379 variables, 117/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 58/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 103/482 variables, 56/234 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 4/238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 14/496 variables, 13/251 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/496 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 251 constraints, problems are : Problem set: 0 solved, 6 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 186/186 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 55/117 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 262/379 variables, 117/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 58/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 103/482 variables, 56/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 4/239 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 14/496 variables, 13/257 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/496 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 257 constraints, problems are : Problem set: 0 solved, 6 unsolved in 666 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 186/186 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1013ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9805 ms.
Support contains 62 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 450/450 transitions.
Applied a total of 0 rules in 13 ms. Remains 186 /186 variables (removed 0) and now considering 450/450 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 186/186 places, 450/450 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 450/450 transitions.
Applied a total of 0 rules in 12 ms. Remains 186 /186 variables (removed 0) and now considering 450/450 (removed 0) transitions.
[2024-05-23 02:56:17] [INFO ] Flow matrix only has 310 transitions (discarded 140 similar events)
[2024-05-23 02:56:17] [INFO ] Invariant cache hit.
[2024-05-23 02:56:17] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-23 02:56:17] [INFO ] Flow matrix only has 310 transitions (discarded 140 similar events)
[2024-05-23 02:56:17] [INFO ] Invariant cache hit.
[2024-05-23 02:56:17] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-23 02:56:17] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-05-23 02:56:18] [INFO ] Redundant transitions in 24 ms returned []
Running 448 sub problems to find dead transitions.
[2024-05-23 02:56:18] [INFO ] Flow matrix only has 310 transitions (discarded 140 similar events)
[2024-05-23 02:56:18] [INFO ] Invariant cache hit.
[2024-05-23 02:56:18] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (OVERLAPS) 310/495 variables, 185/188 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 62/250 constraints. Problems are: Problem set: 0 solved, 448 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 7 (OVERLAPS) 1/496 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 9 (OVERLAPS) 0/496 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 448 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 251 constraints, problems are : Problem set: 0 solved, 448 unsolved in 22481 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 186/186 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (OVERLAPS) 310/495 variables, 185/188 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 62/250 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 32/282 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 8 (OVERLAPS) 1/496 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 416/699 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 11 (OVERLAPS) 0/496 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 448 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 699 constraints, problems are : Problem set: 0 solved, 448 unsolved in 28980 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 186/186 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 0/0 constraints]
After SMT, in 52071ms problems are : Problem set: 0 solved, 448 unsolved
Search for dead transitions found 0 dead transitions in 52077ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52425 ms. Remains : 186/186 places, 450/450 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 140 edges and 186 vertex of which 9 / 186 are part of one of the 3 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 134 transitions
Reduce isomorphic transitions removed 149 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 8 rules applied. Total rules applied 9 place count 180 transition count 293
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 172 transition count 292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 171 transition count 292
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 19 place count 171 transition count 271
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 61 place count 150 transition count 271
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 63 place count 148 transition count 269
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 148 transition count 269
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 69 place count 148 transition count 265
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 95 place count 135 transition count 252
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 98 place count 132 transition count 246
Iterating global reduction 4 with 3 rules applied. Total rules applied 101 place count 132 transition count 246
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 103 place count 130 transition count 242
Iterating global reduction 4 with 2 rules applied. Total rules applied 105 place count 130 transition count 242
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 106 place count 129 transition count 240
Iterating global reduction 4 with 1 rules applied. Total rules applied 107 place count 129 transition count 240
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 111 place count 127 transition count 240
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 118 place count 127 transition count 233
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 124 place count 127 transition count 227
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 130 place count 121 transition count 227
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 131 place count 121 transition count 226
Applied a total of 131 rules in 64 ms. Remains 121 /186 variables (removed 65) and now considering 226/450 (removed 224) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 226 rows 121 cols
[2024-05-23 02:57:10] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 02:57:10] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 02:57:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:57:10] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-23 02:57:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 02:57:10] [INFO ] After 81ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-23 02:57:10] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 8 ms to minimize.
[2024-05-23 02:57:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
TRAPS : Iteration 1
[2024-05-23 02:57:10] [INFO ] After 406ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-23 02:57:10] [INFO ] After 687ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 818 ms.
[2024-05-23 02:57:10] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-23 02:57:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 186 places, 450 transitions and 1818 arcs took 6 ms.
[2024-05-23 02:57:11] [INFO ] Flatten gal took : 60 ms
Total runtime 139919 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FunctionPointer-PT-b064

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/407/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 186
TRANSITIONS: 450
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.008s, Sys 0.003s]


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


----------------------------------------------------------------------
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: 587
MODEL NAME: /home/mcc/execution/407/model
186 places, 450 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 1716433038237

--------------------
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-b064"
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-b064, 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-171640601100262"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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