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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 5.2K Feb 25 11:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 25 11:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 12:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Feb 25 12:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 12:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 25 12:02 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-c064-ReachabilityFireability-00
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-01
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-02
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-03
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-04
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-05
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-06
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-07
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-08
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-09
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-10
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-11
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-12
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-13
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-14
FORMULA_NAME FunctionPointer-PT-c064-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678639614517

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-c064
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:46:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:46:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:46:56] [INFO ] Load time of PNML (sax parser for PT used): 330 ms
[2023-03-12 16:46:56] [INFO ] Transformed 2826 places.
[2023-03-12 16:46:56] [INFO ] Transformed 8960 transitions.
[2023-03-12 16:46:56] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 442 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 31 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10034 steps, including 2 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :2
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :1
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 9 properties.
[2023-03-12 16:46:57] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2023-03-12 16:46:57] [INFO ] Computed 4 place invariants in 96 ms
[2023-03-12 16:46:58] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2023-03-12 16:46:58] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 16:46:59] [INFO ] After 880ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-12 16:46:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 16:46:59] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 16:47:01] [INFO ] After 2174ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2023-03-12 16:47:01] [INFO ] State equation strengthened by 479 read => feed constraints.
[2023-03-12 16:47:03] [INFO ] After 1664ms SMT Verify possible using 479 Read/Feed constraints in natural domain returned unsat :2 sat :7
[2023-03-12 16:47:05] [INFO ] After 3327ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 955 ms.
[2023-03-12 16:47:06] [INFO ] After 7091ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 255 ms.
Support contains 37 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.18 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 289 places :
Symmetric choice reduction at 0 with 289 rule applications. Total rules 290 place count 1322 transition count 3818
Iterating global reduction 0 with 289 rules applied. Total rules applied 579 place count 1322 transition count 3818
Ensure Unique test removed 432 transitions
Reduce isomorphic transitions removed 432 transitions.
Iterating post reduction 0 with 432 rules applied. Total rules applied 1011 place count 1322 transition count 3386
Discarding 148 places :
Symmetric choice reduction at 1 with 148 rule applications. Total rules 1159 place count 1174 transition count 3090
Iterating global reduction 1 with 148 rules applied. Total rules applied 1307 place count 1174 transition count 3090
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1407 place count 1174 transition count 2990
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1421 place count 1160 transition count 2962
Iterating global reduction 2 with 14 rules applied. Total rules applied 1435 place count 1160 transition count 2962
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1448 place count 1147 transition count 2936
Iterating global reduction 2 with 13 rules applied. Total rules applied 1461 place count 1147 transition count 2936
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1474 place count 1134 transition count 2910
Iterating global reduction 2 with 13 rules applied. Total rules applied 1487 place count 1134 transition count 2910
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1500 place count 1121 transition count 2884
Iterating global reduction 2 with 13 rules applied. Total rules applied 1513 place count 1121 transition count 2884
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1526 place count 1108 transition count 2858
Iterating global reduction 2 with 13 rules applied. Total rules applied 1539 place count 1108 transition count 2858
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1550 place count 1097 transition count 2836
Iterating global reduction 2 with 11 rules applied. Total rules applied 1561 place count 1097 transition count 2836
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1571 place count 1087 transition count 2816
Iterating global reduction 2 with 10 rules applied. Total rules applied 1581 place count 1087 transition count 2816
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 1614 place count 1054 transition count 2696
Iterating global reduction 2 with 33 rules applied. Total rules applied 1647 place count 1054 transition count 2696
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1693 place count 1008 transition count 2512
Iterating global reduction 2 with 46 rules applied. Total rules applied 1739 place count 1008 transition count 2512
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1785 place count 962 transition count 2380
Iterating global reduction 2 with 46 rules applied. Total rules applied 1831 place count 962 transition count 2380
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 1876 place count 917 transition count 2290
Iterating global reduction 2 with 45 rules applied. Total rules applied 1921 place count 917 transition count 2290
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 1965 place count 873 transition count 2202
Iterating global reduction 2 with 44 rules applied. Total rules applied 2009 place count 873 transition count 2202
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 2053 place count 829 transition count 2114
Iterating global reduction 2 with 44 rules applied. Total rules applied 2097 place count 829 transition count 2114
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 2138 place count 788 transition count 2032
Iterating global reduction 2 with 41 rules applied. Total rules applied 2179 place count 788 transition count 2032
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 2198 place count 769 transition count 1994
Iterating global reduction 2 with 19 rules applied. Total rules applied 2217 place count 769 transition count 1994
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 2 with 36 rules applied. Total rules applied 2253 place count 769 transition count 1958
Applied a total of 2253 rules in 1581 ms. Remains 769 /1628 variables (removed 859) and now considering 1958/5962 (removed 4004) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1582 ms. Remains : 769/1628 places, 1958/5962 transitions.
Incomplete random walk after 10042 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :1
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-12 16:47:08] [INFO ] Flow matrix only has 1326 transitions (discarded 632 similar events)
// Phase 1: matrix 1326 rows 769 cols
[2023-03-12 16:47:08] [INFO ] Computed 2 place invariants in 23 ms
[2023-03-12 16:47:08] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 16:47:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 16:47:08] [INFO ] After 643ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 16:47:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 16:47:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 16:47:10] [INFO ] After 1062ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 16:47:10] [INFO ] State equation strengthened by 325 read => feed constraints.
[2023-03-12 16:47:11] [INFO ] After 967ms SMT Verify possible using 325 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 16:47:11] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 1 ms to minimize.
[2023-03-12 16:47:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2023-03-12 16:47:12] [INFO ] After 1944ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 593 ms.
[2023-03-12 16:47:12] [INFO ] After 3840ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 112 ms.
Support contains 36 out of 769 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 769/769 places, 1958/1958 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 768 transition count 1956
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 768 transition count 1956
Applied a total of 2 rules in 141 ms. Remains 768 /769 variables (removed 1) and now considering 1956/1958 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 768/769 places, 1956/1958 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :1
FORMULA FunctionPointer-PT-c064-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 16:47:13] [INFO ] Flow matrix only has 1323 transitions (discarded 633 similar events)
// Phase 1: matrix 1323 rows 768 cols
[2023-03-12 16:47:13] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-12 16:47:13] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 16:47:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 16:47:13] [INFO ] After 642ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 16:47:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 16:47:14] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-12 16:47:15] [INFO ] After 941ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 16:47:15] [INFO ] State equation strengthened by 323 read => feed constraints.
[2023-03-12 16:47:15] [INFO ] After 706ms SMT Verify possible using 323 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 16:47:15] [INFO ] Deduced a trap composed of 131 places in 103 ms of which 2 ms to minimize.
[2023-03-12 16:47:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2023-03-12 16:47:16] [INFO ] After 1490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 458 ms.
[2023-03-12 16:47:17] [INFO ] After 3097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 84 ms.
Support contains 22 out of 768 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 768/768 places, 1956/1956 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 758 transition count 1932
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 758 transition count 1932
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 26 place count 758 transition count 1926
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 748 transition count 1904
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 748 transition count 1904
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 55 place count 739 transition count 1878
Iterating global reduction 1 with 9 rules applied. Total rules applied 64 place count 739 transition count 1878
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 74 place count 729 transition count 1850
Iterating global reduction 1 with 10 rules applied. Total rules applied 84 place count 729 transition count 1850
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 94 place count 719 transition count 1830
Iterating global reduction 1 with 10 rules applied. Total rules applied 104 place count 719 transition count 1830
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 113 place count 710 transition count 1812
Iterating global reduction 1 with 9 rules applied. Total rules applied 122 place count 710 transition count 1812
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 131 place count 701 transition count 1794
Iterating global reduction 1 with 9 rules applied. Total rules applied 140 place count 701 transition count 1794
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 149 place count 692 transition count 1776
Iterating global reduction 1 with 9 rules applied. Total rules applied 158 place count 692 transition count 1776
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 166 place count 684 transition count 1760
Iterating global reduction 1 with 8 rules applied. Total rules applied 174 place count 684 transition count 1760
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 178 place count 680 transition count 1752
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 680 transition count 1752
Applied a total of 182 rules in 291 ms. Remains 680 /768 variables (removed 88) and now considering 1752/1956 (removed 204) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 291 ms. Remains : 680/768 places, 1752/1956 transitions.
Incomplete random walk after 10027 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) 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 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 193935 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 193935 steps, saw 125896 distinct states, run finished after 3002 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-12 16:47:20] [INFO ] Flow matrix only has 1180 transitions (discarded 572 similar events)
// Phase 1: matrix 1180 rows 680 cols
[2023-03-12 16:47:20] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-12 16:47:20] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 16:47:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-12 16:47:21] [INFO ] After 582ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 16:47:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 16:47:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 16:47:22] [INFO ] After 805ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 16:47:22] [INFO ] State equation strengthened by 292 read => feed constraints.
[2023-03-12 16:47:22] [INFO ] After 622ms SMT Verify possible using 292 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 16:47:23] [INFO ] After 1222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 464 ms.
[2023-03-12 16:47:23] [INFO ] After 2675ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 80 ms.
Support contains 22 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 1752/1752 transitions.
Applied a total of 0 rules in 83 ms. Remains 680 /680 variables (removed 0) and now considering 1752/1752 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 680/680 places, 1752/1752 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 1752/1752 transitions.
Applied a total of 0 rules in 80 ms. Remains 680 /680 variables (removed 0) and now considering 1752/1752 (removed 0) transitions.
[2023-03-12 16:47:24] [INFO ] Flow matrix only has 1180 transitions (discarded 572 similar events)
[2023-03-12 16:47:24] [INFO ] Invariant cache hit.
[2023-03-12 16:47:24] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-03-12 16:47:24] [INFO ] Flow matrix only has 1180 transitions (discarded 572 similar events)
[2023-03-12 16:47:24] [INFO ] Invariant cache hit.
[2023-03-12 16:47:24] [INFO ] State equation strengthened by 292 read => feed constraints.
[2023-03-12 16:47:26] [INFO ] Implicit Places using invariants and state equation in 1576 ms returned []
Implicit Place search using SMT with State Equation took 1966 ms to find 0 implicit places.
[2023-03-12 16:47:26] [INFO ] Redundant transitions in 96 ms returned []
[2023-03-12 16:47:26] [INFO ] Flow matrix only has 1180 transitions (discarded 572 similar events)
[2023-03-12 16:47:26] [INFO ] Invariant cache hit.
[2023-03-12 16:47:26] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2726 ms. Remains : 680/680 places, 1752/1752 transitions.
Graph (trivial) has 1011 edges and 680 vertex of which 186 / 680 are part of one of the 62 SCC in 3 ms
Free SCC test removed 124 places
Drop transitions removed 310 transitions
Ensure Unique test removed 448 transitions
Reduce isomorphic transitions removed 758 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 556 transition count 980
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 542 transition count 979
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 541 transition count 979
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 31 place count 541 transition count 887
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 215 place count 449 transition count 887
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 276 place count 388 transition count 826
Iterating global reduction 3 with 61 rules applied. Total rules applied 337 place count 388 transition count 826
Ensure Unique test removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Iterating post reduction 3 with 122 rules applied. Total rules applied 459 place count 388 transition count 704
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 4 with 258 rules applied. Total rules applied 717 place count 259 transition count 575
Discarding 60 places :
Symmetric choice reduction at 4 with 60 rule applications. Total rules 777 place count 199 transition count 455
Iterating global reduction 4 with 60 rules applied. Total rules applied 837 place count 199 transition count 455
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 838 place count 199 transition count 454
Discarding 57 places :
Symmetric choice reduction at 5 with 57 rule applications. Total rules 895 place count 142 transition count 340
Iterating global reduction 5 with 57 rules applied. Total rules applied 952 place count 142 transition count 340
Discarding 57 places :
Symmetric choice reduction at 5 with 57 rule applications. Total rules 1009 place count 85 transition count 226
Iterating global reduction 5 with 57 rules applied. Total rules applied 1066 place count 85 transition count 226
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 5 with 55 rules applied. Total rules applied 1121 place count 85 transition count 171
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 6 with 2 rules applied. Total rules applied 1123 place count 84 transition count 170
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1139 place count 76 transition count 179
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 1148 place count 76 transition count 170
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1150 place count 76 transition count 168
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1152 place count 74 transition count 168
Applied a total of 1152 rules in 87 ms. Remains 74 /680 variables (removed 606) and now considering 168/1752 (removed 1584) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 168 rows 74 cols
[2023-03-12 16:47:26] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 16:47:26] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 16:47:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 16:47:26] [INFO ] After 39ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-12 16:47:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 16:47:26] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 16:47:26] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 16:47:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 16:47:26] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 16:47:27] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 16:47:27] [INFO ] After 54ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 16:47:27] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-12 16:47:27] [INFO ] After 299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-12 16:47:27] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2023-03-12 16:47:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 680 places, 1752 transitions and 7134 arcs took 11 ms.
[2023-03-12 16:47:27] [INFO ] Flatten gal took : 153 ms
Total runtime 31333 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/513/inv_0_ --invariant=/tmp/513/inv_1_ --invariant=/tmp/513/inv_2_ --invariant=/tmp/513/inv_3_ --invariant=/tmp/513/inv_4_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15386328 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16091984 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-c064"
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-c064, 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-167838856400759"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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