About the Execution of LTSMin+red for FunctionPointer-PT-c128
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
822.888 | 3600000.00 | 14305828.00 | 418.20 | FTF??TTFFTF???FT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r169-tall-167838856400767.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is FunctionPointer-PT-c128, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856400767
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 9.5K Feb 25 12:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 12:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 11:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 11:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 12:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Feb 25 12:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 12:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 12:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.2M Mar 5 18:22 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-c128-ReachabilityFireability-00
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-01
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-02
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-03
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-04
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-05
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-06
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-07
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-08
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-09
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-10
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-11
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-12
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-13
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-14
FORMULA_NAME FunctionPointer-PT-c128-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1678643131457
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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-c128
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:45:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 17:45:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:45:33] [INFO ] Load time of PNML (sax parser for PT used): 343 ms
[2023-03-12 17:45:33] [INFO ] Transformed 2826 places.
[2023-03-12 17:45:33] [INFO ] Transformed 8960 transitions.
[2023-03-12 17:45:33] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 457 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 30 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :2
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-12 17:45:34] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2023-03-12 17:45:34] [INFO ] Computed 4 place invariants in 129 ms
[2023-03-12 17:45:35] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2023-03-12 17:45:35] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 17:45:36] [INFO ] After 883ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-12 17:45:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 17:45:36] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 17:45:38] [INFO ] After 2259ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2023-03-12 17:45:38] [INFO ] State equation strengthened by 479 read => feed constraints.
[2023-03-12 17:45:40] [INFO ] After 1406ms SMT Verify possible using 479 Read/Feed constraints in natural domain returned unsat :2 sat :7
[2023-03-12 17:45:42] [INFO ] After 3150ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 1094 ms.
[2023-03-12 17:45:43] [INFO ] After 7206ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 667 ms.
Support contains 33 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 281 places :
Symmetric choice reduction at 0 with 281 rule applications. Total rules 282 place count 1330 transition count 3910
Iterating global reduction 0 with 281 rules applied. Total rules applied 563 place count 1330 transition count 3910
Ensure Unique test removed 478 transitions
Reduce isomorphic transitions removed 478 transitions.
Iterating post reduction 0 with 478 rules applied. Total rules applied 1041 place count 1330 transition count 3432
Discarding 141 places :
Symmetric choice reduction at 1 with 141 rule applications. Total rules 1182 place count 1189 transition count 3150
Iterating global reduction 1 with 141 rules applied. Total rules applied 1323 place count 1189 transition count 3150
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 1 with 112 rules applied. Total rules applied 1435 place count 1189 transition count 3038
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1449 place count 1175 transition count 3010
Iterating global reduction 2 with 14 rules applied. Total rules applied 1463 place count 1175 transition count 3010
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1477 place count 1161 transition count 2982
Iterating global reduction 2 with 14 rules applied. Total rules applied 1491 place count 1161 transition count 2982
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1505 place count 1147 transition count 2954
Iterating global reduction 2 with 14 rules applied. Total rules applied 1519 place count 1147 transition count 2954
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1532 place count 1134 transition count 2928
Iterating global reduction 2 with 13 rules applied. Total rules applied 1545 place count 1134 transition count 2928
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1557 place count 1122 transition count 2904
Iterating global reduction 2 with 12 rules applied. Total rules applied 1569 place count 1122 transition count 2904
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1580 place count 1111 transition count 2882
Iterating global reduction 2 with 11 rules applied. Total rules applied 1591 place count 1111 transition count 2882
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1598 place count 1104 transition count 2868
Iterating global reduction 2 with 7 rules applied. Total rules applied 1605 place count 1104 transition count 2868
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 1635 place count 1074 transition count 2752
Iterating global reduction 2 with 30 rules applied. Total rules applied 1665 place count 1074 transition count 2752
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 1698 place count 1041 transition count 2620
Iterating global reduction 2 with 33 rules applied. Total rules applied 1731 place count 1041 transition count 2620
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 1764 place count 1008 transition count 2544
Iterating global reduction 2 with 33 rules applied. Total rules applied 1797 place count 1008 transition count 2544
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 1830 place count 975 transition count 2478
Iterating global reduction 2 with 33 rules applied. Total rules applied 1863 place count 975 transition count 2478
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 1895 place count 943 transition count 2414
Iterating global reduction 2 with 32 rules applied. Total rules applied 1927 place count 943 transition count 2414
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 1959 place count 911 transition count 2350
Iterating global reduction 2 with 32 rules applied. Total rules applied 1991 place count 911 transition count 2350
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 2023 place count 879 transition count 2286
Iterating global reduction 2 with 32 rules applied. Total rules applied 2055 place count 879 transition count 2286
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2060 place count 874 transition count 2276
Iterating global reduction 2 with 5 rules applied. Total rules applied 2065 place count 874 transition count 2276
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 2 with 62 rules applied. Total rules applied 2127 place count 874 transition count 2214
Applied a total of 2127 rules in 2066 ms. Remains 874 /1628 variables (removed 754) and now considering 2214/5962 (removed 3748) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2067 ms. Remains : 874/1628 places, 2214/5962 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :2
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c128-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 17:45:46] [INFO ] Flow matrix only has 1495 transitions (discarded 719 similar events)
// Phase 1: matrix 1495 rows 874 cols
[2023-03-12 17:45:46] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-12 17:45:46] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 17:45:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 17:45:47] [INFO ] After 1083ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 17:45:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 17:45:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 17:45:48] [INFO ] After 968ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 17:45:48] [INFO ] State equation strengthened by 354 read => feed constraints.
[2023-03-12 17:45:49] [INFO ] After 634ms SMT Verify possible using 354 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 17:45:49] [INFO ] After 1329ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 578 ms.
[2023-03-12 17:45:50] [INFO ] After 3183ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 157 ms.
Support contains 18 out of 874 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 874/874 places, 2214/2214 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 863 transition count 2188
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 863 transition count 2188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 863 transition count 2184
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 37 place count 852 transition count 2160
Iterating global reduction 1 with 11 rules applied. Total rules applied 48 place count 852 transition count 2160
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 57 place count 843 transition count 2132
Iterating global reduction 1 with 9 rules applied. Total rules applied 66 place count 843 transition count 2132
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 76 place count 833 transition count 2106
Iterating global reduction 1 with 10 rules applied. Total rules applied 86 place count 833 transition count 2106
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 96 place count 823 transition count 2086
Iterating global reduction 1 with 10 rules applied. Total rules applied 106 place count 823 transition count 2086
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 118 place count 811 transition count 2056
Iterating global reduction 1 with 12 rules applied. Total rules applied 130 place count 811 transition count 2056
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 142 place count 799 transition count 2032
Iterating global reduction 1 with 12 rules applied. Total rules applied 154 place count 799 transition count 2032
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 166 place count 787 transition count 2008
Iterating global reduction 1 with 12 rules applied. Total rules applied 178 place count 787 transition count 2008
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 189 place count 776 transition count 1986
Iterating global reduction 1 with 11 rules applied. Total rules applied 200 place count 776 transition count 1986
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 206 place count 770 transition count 1974
Iterating global reduction 1 with 6 rules applied. Total rules applied 212 place count 770 transition count 1974
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 215 place count 767 transition count 1968
Iterating global reduction 1 with 3 rules applied. Total rules applied 218 place count 767 transition count 1968
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 221 place count 764 transition count 1962
Iterating global reduction 1 with 3 rules applied. Total rules applied 224 place count 764 transition count 1962
Applied a total of 224 rules in 398 ms. Remains 764 /874 variables (removed 110) and now considering 1962/2214 (removed 252) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 402 ms. Remains : 764/874 places, 1962/2214 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 173492 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 173492 steps, saw 112627 distinct states, run finished after 3005 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-12 17:45:54] [INFO ] Flow matrix only has 1318 transitions (discarded 644 similar events)
// Phase 1: matrix 1318 rows 764 cols
[2023-03-12 17:45:54] [INFO ] Computed 2 place invariants in 19 ms
[2023-03-12 17:45:54] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 17:45:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 17:45:55] [INFO ] After 878ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 17:45:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 17:45:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 17:45:56] [INFO ] After 745ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 17:45:56] [INFO ] State equation strengthened by 316 read => feed constraints.
[2023-03-12 17:45:56] [INFO ] After 578ms SMT Verify possible using 316 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 17:45:57] [INFO ] After 1191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 583 ms.
[2023-03-12 17:45:57] [INFO ] After 2751ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 76 ms.
Support contains 18 out of 764 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 764/764 places, 1962/1962 transitions.
Applied a total of 0 rules in 118 ms. Remains 764 /764 variables (removed 0) and now considering 1962/1962 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 764/764 places, 1962/1962 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 764/764 places, 1962/1962 transitions.
Applied a total of 0 rules in 131 ms. Remains 764 /764 variables (removed 0) and now considering 1962/1962 (removed 0) transitions.
[2023-03-12 17:45:58] [INFO ] Flow matrix only has 1318 transitions (discarded 644 similar events)
[2023-03-12 17:45:58] [INFO ] Invariant cache hit.
[2023-03-12 17:45:58] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-03-12 17:45:58] [INFO ] Flow matrix only has 1318 transitions (discarded 644 similar events)
[2023-03-12 17:45:58] [INFO ] Invariant cache hit.
[2023-03-12 17:45:58] [INFO ] State equation strengthened by 316 read => feed constraints.
[2023-03-12 17:46:02] [INFO ] Implicit Places using invariants and state equation in 3567 ms returned []
Implicit Place search using SMT with State Equation took 3943 ms to find 0 implicit places.
[2023-03-12 17:46:02] [INFO ] Redundant transitions in 153 ms returned []
[2023-03-12 17:46:02] [INFO ] Flow matrix only has 1318 transitions (discarded 644 similar events)
[2023-03-12 17:46:02] [INFO ] Invariant cache hit.
[2023-03-12 17:46:03] [INFO ] Dead Transitions using invariants and state equation in 736 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4985 ms. Remains : 764/764 places, 1962/1962 transitions.
Graph (trivial) has 1158 edges and 764 vertex of which 186 / 764 are part of one of the 62 SCC in 5 ms
Free SCC test removed 124 places
Drop transitions removed 310 transitions
Ensure Unique test removed 520 transitions
Reduce isomorphic transitions removed 830 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 640 transition count 1109
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 617 transition count 1109
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 126 Pre rules applied. Total rules applied 47 place count 617 transition count 983
Deduced a syphon composed of 126 places in 0 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 299 place count 491 transition count 983
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 360 place count 430 transition count 922
Iterating global reduction 2 with 61 rules applied. Total rules applied 421 place count 430 transition count 922
Ensure Unique test removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Iterating post reduction 2 with 122 rules applied. Total rules applied 543 place count 430 transition count 800
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 0 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 3 with 268 rules applied. Total rules applied 811 place count 296 transition count 666
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 875 place count 232 transition count 538
Iterating global reduction 3 with 64 rules applied. Total rules applied 939 place count 232 transition count 538
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 940 place count 232 transition count 537
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1003 place count 169 transition count 411
Iterating global reduction 4 with 63 rules applied. Total rules applied 1066 place count 169 transition count 411
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1129 place count 106 transition count 285
Iterating global reduction 4 with 63 rules applied. Total rules applied 1192 place count 106 transition count 285
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1255 place count 106 transition count 222
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1255 place count 106 transition count 221
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1257 place count 105 transition count 221
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1259 place count 104 transition count 220
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 1293 place count 87 transition count 229
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1295 place count 87 transition count 227
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 6 with 24 rules applied. Total rules applied 1319 place count 87 transition count 203
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1320 place count 86 transition count 202
Iterating global reduction 6 with 1 rules applied. Total rules applied 1321 place count 86 transition count 202
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1328 place count 86 transition count 195
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1330 place count 86 transition count 193
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1332 place count 84 transition count 193
Applied a total of 1332 rules in 125 ms. Remains 84 /764 variables (removed 680) and now considering 193/1962 (removed 1769) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 193 rows 84 cols
[2023-03-12 17:46:03] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 17:46:03] [INFO ] [Real]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-12 17:46:03] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 28 ms returned sat
[2023-03-12 17:46:03] [INFO ] After 494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 17:46:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 17:46:03] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 17:46:03] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 17:46:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:46:03] [INFO ] After 66ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 17:46:04] [INFO ] After 155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-12 17:46:04] [INFO ] After 367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-12 17:46:04] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-12 17:46:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 764 places, 1962 transitions and 7974 arcs took 15 ms.
[2023-03-12 17:46:04] [INFO ] Flatten gal took : 161 ms
Total runtime 31295 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/505/inv_0_ --invariant=/tmp/505/inv_1_ --invariant=/tmp/505/inv_2_ --invariant=/tmp/505/inv_3_ --invariant=/tmp/505/inv_4_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15321132 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16094152 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
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-c128"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is FunctionPointer-PT-c128, 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 r169-tall-167838856400767"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c128.tgz
mv FunctionPointer-PT-c128 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 '
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 ;