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-171640603100287.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-c004, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603100287
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K 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.9K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K 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:27 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 4.2M 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-c004-ReachabilityFireability-2024-00
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-01
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-02
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-03
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2023-04
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-05
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-06
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-07
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-08
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-09
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2023-10
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-11
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-12
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2023-13
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2024-14
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717191121141

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:32:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:32:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:32:02] [INFO ] Load time of PNML (sax parser for PT used): 355 ms
[2024-05-31 21:32:02] [INFO ] Transformed 2826 places.
[2024-05-31 21:32:02] [INFO ] Transformed 8960 transitions.
[2024-05-31 21:32:02] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 513 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 46 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40001 steps (8 resets) in 2834 ms. (14 steps per ms) remains 8/12 properties
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 398 ms. (100 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 7/8 properties
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 644 ms. (62 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 330 ms. (120 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 115 ms. (344 steps per ms) remains 7/7 properties
[2024-05-31 21:32:04] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-31 21:32:04] [INFO ] Computed 4 invariants in 157 ms
[2024-05-31 21:32:04] [INFO ] State equation strengthened by 479 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem FunctionPointer-PT-c004-ReachabilityFireability-2024-09 is UNSAT
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 538/588 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/589 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/589 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1598/2187 variables, 589/593 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2187 variables, 399/992 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2187 variables, 0/992 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2043/4230 variables, 535/1527 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4230 variables, 80/1607 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4230 variables, 0/1607 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 633/4863 variables, 425/2032 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4863 variables, 0/2032 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 227/5090 variables, 57/2089 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5090 variables, 0/2089 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 78/5168 variables, 22/2111 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/5168 variables, 0/2111 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5168/5168 variables, and 2111 constraints, problems are : Problem set: 1 solved, 6 unsolved in 3486 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1628/1628 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 543/566 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-31 21:32:08] [INFO ] Deduced a trap composed of 135 places in 232 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/566 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/566 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1/567 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/567 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1476/2043 variables, 567/572 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2043 variables, 399/971 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2043 variables, 0/971 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1694/3737 variables, 461/1432 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3737 variables, 80/1512 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3737 variables, 5/1517 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3737 variables, 0/1517 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 695/4432 variables, 427/1944 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4432 variables, 0/1944 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 401/4833 variables, 86/2030 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4833 variables, 0/2030 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 335/5168 variables, 87/2117 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5168/5168 variables, and 2117 constraints, problems are : Problem set: 1 solved, 6 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1628/1628 constraints, ReadFeed: 479/479 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 9027ms problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1611 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.15 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 290 places :
Symmetric choice reduction at 0 with 290 rule applications. Total rules 291 place count 1321 transition count 3788
Iterating global reduction 0 with 290 rules applied. Total rules applied 581 place count 1321 transition count 3788
Ensure Unique test removed 416 transitions
Reduce isomorphic transitions removed 416 transitions.
Iterating post reduction 0 with 416 rules applied. Total rules applied 997 place count 1321 transition count 3372
Discarding 148 places :
Symmetric choice reduction at 1 with 148 rule applications. Total rules 1145 place count 1173 transition count 3076
Iterating global reduction 1 with 148 rules applied. Total rules applied 1293 place count 1173 transition count 3076
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 1381 place count 1173 transition count 2988
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1395 place count 1159 transition count 2960
Iterating global reduction 2 with 14 rules applied. Total rules applied 1409 place count 1159 transition count 2960
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1423 place count 1145 transition count 2932
Iterating global reduction 2 with 14 rules applied. Total rules applied 1437 place count 1145 transition count 2932
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1451 place count 1131 transition count 2904
Iterating global reduction 2 with 14 rules applied. Total rules applied 1465 place count 1131 transition count 2904
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1479 place count 1117 transition count 2876
Iterating global reduction 2 with 14 rules applied. Total rules applied 1493 place count 1117 transition count 2876
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1507 place count 1103 transition count 2848
Iterating global reduction 2 with 14 rules applied. Total rules applied 1521 place count 1103 transition count 2848
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1533 place count 1091 transition count 2824
Iterating global reduction 2 with 12 rules applied. Total rules applied 1545 place count 1091 transition count 2824
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1556 place count 1080 transition count 2802
Iterating global reduction 2 with 11 rules applied. Total rules applied 1567 place count 1080 transition count 2802
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 1607 place count 1040 transition count 2654
Iterating global reduction 2 with 40 rules applied. Total rules applied 1647 place count 1040 transition count 2654
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 1696 place count 991 transition count 2458
Iterating global reduction 2 with 49 rules applied. Total rules applied 1745 place count 991 transition count 2458
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 1794 place count 942 transition count 2328
Iterating global reduction 2 with 49 rules applied. Total rules applied 1843 place count 942 transition count 2328
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 1892 place count 893 transition count 2230
Iterating global reduction 2 with 49 rules applied. Total rules applied 1941 place count 893 transition count 2230
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 1990 place count 844 transition count 2132
Iterating global reduction 2 with 49 rules applied. Total rules applied 2039 place count 844 transition count 2132
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 2088 place count 795 transition count 2034
Iterating global reduction 2 with 49 rules applied. Total rules applied 2137 place count 795 transition count 2034
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 2183 place count 749 transition count 1942
Iterating global reduction 2 with 46 rules applied. Total rules applied 2229 place count 749 transition count 1942
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 2243 place count 735 transition count 1914
Iterating global reduction 2 with 14 rules applied. Total rules applied 2257 place count 735 transition count 1914
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 2 with 30 rules applied. Total rules applied 2287 place count 735 transition count 1884
Applied a total of 2287 rules in 1616 ms. Remains 735 /1628 variables (removed 893) and now considering 1884/5962 (removed 4078) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1626 ms. Remains : 735/1628 places, 1884/5962 transitions.
RANDOM walk for 40001 steps (8 resets) in 288 ms. (138 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 238791 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 6
Probabilistic random walk after 238791 steps, saw 156187 distinct states, run finished after 3004 ms. (steps per millisecond=79 ) properties seen :0
[2024-05-31 21:32:18] [INFO ] Flow matrix only has 1273 transitions (discarded 611 similar events)
// Phase 1: matrix 1273 rows 735 cols
[2024-05-31 21:32:18] [INFO ] Computed 2 invariants in 8 ms
[2024-05-31 21:32:18] [INFO ] State equation strengthened by 314 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 381/404 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 970/1374 variables, 404/405 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1374 variables, 232/637 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1374 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 515/1889 variables, 232/869 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1889 variables, 1/870 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1889 variables, 82/952 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1889 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 118/2007 variables, 98/1050 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2007 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1/2008 variables, 1/1051 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2008 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/2008 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2008/2008 variables, and 1051 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1365 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 735/735 constraints, ReadFeed: 314/314 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 381/404 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 970/1374 variables, 404/405 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1374 variables, 232/637 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1374 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 515/1889 variables, 232/869 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1889 variables, 1/870 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1889 variables, 82/952 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1889 variables, 6/958 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 21:32:21] [INFO ] Deduced a trap composed of 131 places in 178 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1889 variables, 1/959 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1889 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 118/2007 variables, 98/1057 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2007 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 1/2008 variables, 1/1058 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2008 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/2008 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2008/2008 variables, and 1058 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3729 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 735/735 constraints, ReadFeed: 314/314 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 5201ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 2135 ms.
Support contains 22 out of 735 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1884/1884 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 734 transition count 1882
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 734 transition count 1882
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 733 transition count 1880
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 733 transition count 1880
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 732 transition count 1876
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 732 transition count 1876
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 731 transition count 1874
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 731 transition count 1874
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 730 transition count 1872
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 730 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 729 transition count 1870
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 729 transition count 1870
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 728 transition count 1868
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 728 transition count 1868
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 727 transition count 1866
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 727 transition count 1866
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 726 transition count 1864
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 726 transition count 1864
Applied a total of 18 rules in 277 ms. Remains 726 /735 variables (removed 9) and now considering 1864/1884 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 726/735 places, 1864/1884 transitions.
RANDOM walk for 40006 steps (8 resets) in 203 ms. (196 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 38 ms. (1025 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 258132 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 5
Probabilistic random walk after 258132 steps, saw 168867 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
[2024-05-31 21:32:29] [INFO ] Flow matrix only has 1259 transitions (discarded 605 similar events)
// Phase 1: matrix 1259 rows 726 cols
[2024-05-31 21:32:29] [INFO ] Computed 2 invariants in 9 ms
[2024-05-31 21:32:29] [INFO ] State equation strengthened by 311 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 381/403 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 962/1365 variables, 403/404 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1365 variables, 230/634 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1365 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 504/1869 variables, 226/860 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1869 variables, 1/861 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1869 variables, 81/942 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1869 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 115/1984 variables, 96/1038 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1984 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/1985 variables, 1/1039 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1985 variables, 0/1039 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/1985 variables, 0/1039 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1985/1985 variables, and 1039 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1191 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 726/726 constraints, ReadFeed: 311/311 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 381/403 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 962/1365 variables, 403/404 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1365 variables, 230/634 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1365 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 504/1869 variables, 226/860 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1869 variables, 1/861 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1869 variables, 81/942 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1869 variables, 5/947 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 21:32:31] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1869 variables, 1/948 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1869 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 115/1984 variables, 96/1044 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1984 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1/1985 variables, 1/1045 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1985 variables, 0/1045 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/1985 variables, 0/1045 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1985/1985 variables, and 1045 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3362 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 726/726 constraints, ReadFeed: 311/311 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 4624ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 2047 ms.
Support contains 22 out of 726 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 726/726 places, 1864/1864 transitions.
Applied a total of 0 rules in 135 ms. Remains 726 /726 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 726/726 places, 1864/1864 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 726/726 places, 1864/1864 transitions.
Applied a total of 0 rules in 110 ms. Remains 726 /726 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
[2024-05-31 21:32:36] [INFO ] Flow matrix only has 1259 transitions (discarded 605 similar events)
[2024-05-31 21:32:36] [INFO ] Invariant cache hit.
[2024-05-31 21:32:36] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-31 21:32:36] [INFO ] Flow matrix only has 1259 transitions (discarded 605 similar events)
[2024-05-31 21:32:36] [INFO ] Invariant cache hit.
[2024-05-31 21:32:36] [INFO ] State equation strengthened by 311 read => feed constraints.
[2024-05-31 21:32:38] [INFO ] Implicit Places using invariants and state equation in 1982 ms returned []
Implicit Place search using SMT with State Equation took 2357 ms to find 0 implicit places.
[2024-05-31 21:32:38] [INFO ] Redundant transitions in 95 ms returned []
Running 1862 sub problems to find dead transitions.
[2024-05-31 21:32:38] [INFO ] Flow matrix only has 1259 transitions (discarded 605 similar events)
[2024-05-31 21:32:38] [INFO ] Invariant cache hit.
[2024-05-31 21:32:38] [INFO ] State equation strengthened by 311 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/726 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/726 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1862 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/1985 variables, and 2 constraints, problems are : Problem set: 0 solved, 1862 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/726 constraints, ReadFeed: 0/311 constraints, PredecessorRefiner: 1862/1862 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1862 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/726 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/726 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1862 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/726 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1862 unsolved
At refinement iteration 3 (OVERLAPS) 1259/1985 variables, 726/728 constraints. Problems are: Problem set: 0 solved, 1862 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1985 variables, 311/1039 constraints. Problems are: Problem set: 0 solved, 1862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1985/1985 variables, and 2901 constraints, problems are : Problem set: 0 solved, 1862 unsolved in 32050 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 726/726 constraints, ReadFeed: 311/311 constraints, PredecessorRefiner: 1862/1862 constraints, Known Traps: 0/0 constraints]
After SMT, in 70961ms problems are : Problem set: 0 solved, 1862 unsolved
Search for dead transitions found 0 dead transitions in 70981ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73563 ms. Remains : 726/726 places, 1864/1864 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1097 edges and 726 vertex of which 192 / 726 are part of one of the 64 SCC in 4 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 477 transitions
Reduce isomorphic transitions removed 797 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 598 transition count 1052
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 583 transition count 1052
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 105 Pre rules applied. Total rules applied 31 place count 583 transition count 947
Deduced a syphon composed of 105 places in 1 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 241 place count 478 transition count 947
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 304 place count 415 transition count 884
Iterating global reduction 2 with 63 rules applied. Total rules applied 367 place count 415 transition count 884
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 493 place count 415 transition count 758
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 138
Deduced a syphon composed of 138 places in 0 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 276 rules applied. Total rules applied 769 place count 277 transition count 620
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 831 place count 215 transition count 496
Iterating global reduction 3 with 62 rules applied. Total rules applied 893 place count 215 transition count 496
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 894 place count 215 transition count 495
Discarding 60 places :
Symmetric choice reduction at 4 with 60 rule applications. Total rules 954 place count 155 transition count 375
Iterating global reduction 4 with 60 rules applied. Total rules applied 1014 place count 155 transition count 375
Discarding 60 places :
Symmetric choice reduction at 4 with 60 rule applications. Total rules 1074 place count 95 transition count 255
Iterating global reduction 4 with 60 rules applied. Total rules applied 1134 place count 95 transition count 255
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 4 with 60 rules applied. Total rules applied 1194 place count 95 transition count 195
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1196 place count 94 transition count 194
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 1222 place count 81 transition count 212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1224 place count 81 transition count 210
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 6 with 21 rules applied. Total rules applied 1245 place count 81 transition count 189
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1246 place count 80 transition count 188
Iterating global reduction 6 with 1 rules applied. Total rules applied 1247 place count 80 transition count 188
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1255 place count 80 transition count 180
Applied a total of 1255 rules in 93 ms. Remains 80 /726 variables (removed 646) and now considering 180/1864 (removed 1684) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 180 rows 80 cols
[2024-05-31 21:33:49] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:33:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 21:33:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 7 ms returned sat
[2024-05-31 21:33:49] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-31 21:33:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 21:33:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:33:50] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-31 21:33:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:33:50] [INFO ] After 51ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-31 21:33:50] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-31 21:33:50] [INFO ] After 362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 642 ms.
[2024-05-31 21:33:50] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-31 21:33:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 726 places, 1864 transitions and 7582 arcs took 12 ms.
[2024-05-31 21:33:50] [INFO ] Flatten gal took : 160 ms
Total runtime 108349 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-c004-ReachabilityFireability-2023-04
Could not compute solution for formula : FunctionPointer-PT-c004-ReachabilityFireability-2024-08
Could not compute solution for formula : FunctionPointer-PT-c004-ReachabilityFireability-2023-10
Could not compute solution for formula : FunctionPointer-PT-c004-ReachabilityFireability-2023-13
Could not compute solution for formula : FunctionPointer-PT-c004-ReachabilityFireability-2023-15

BK_STOP 1717191230915

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name FunctionPointer-PT-c004-ReachabilityFireability-2023-04
rfs formula type EF
rfs formula formula --invariant=/tmp/568/inv_0_
rfs formula name FunctionPointer-PT-c004-ReachabilityFireability-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/568/inv_1_
rfs formula name FunctionPointer-PT-c004-ReachabilityFireability-2023-10
rfs formula type AG
rfs formula formula --invariant=/tmp/568/inv_2_
rfs formula name FunctionPointer-PT-c004-ReachabilityFireability-2023-13
rfs formula type EF
rfs formula formula --invariant=/tmp/568/inv_3_
rfs formula name FunctionPointer-PT-c004-ReachabilityFireability-2023-15
rfs formula type AG
rfs formula formula --invariant=/tmp/568/inv_4_
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-c004"
export BK_EXAMINATION="ReachabilityFireability"
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-c004, examination is ReachabilityFireability"
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-171640603100287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c004.tgz
mv FunctionPointer-PT-c004 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;