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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.5M
-rw-r--r-- 1 mcc users 7.7K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 11:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 11:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 12:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 38K Feb 25 12:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 11:59 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-c004-ReachabilityFireability-00
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-01
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-02
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-03
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-04
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-05
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-06
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-07
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-08
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-09
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-10
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-11
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-12
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-13
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-14
FORMULA_NAME FunctionPointer-PT-c004-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678628429917

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-c004
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 13:40:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 13:40:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:40:31] [INFO ] Load time of PNML (sax parser for PT used): 342 ms
[2023-03-12 13:40:31] [INFO ] Transformed 2826 places.
[2023-03-12 13:40:31] [INFO ] Transformed 8960 transitions.
[2023-03-12 13:40:31] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 450 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 29 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 632 ms. (steps per millisecond=15 ) properties (out of 13) seen :2
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :1
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) 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 10) seen :1
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-12 13:40:32] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2023-03-12 13:40:32] [INFO ] Computed 4 place invariants in 84 ms
[2023-03-12 13:40:33] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-12 13:40:33] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-12 13:40:34] [INFO ] After 899ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 13:40:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 13:40:34] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:40:37] [INFO ] After 2596ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-12 13:40:37] [INFO ] State equation strengthened by 479 read => feed constraints.
[2023-03-12 13:40:39] [INFO ] After 2457ms SMT Verify possible using 479 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-12 13:40:41] [INFO ] Deduced a trap composed of 131 places in 823 ms of which 7 ms to minimize.
[2023-03-12 13:40:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1146 ms
[2023-03-12 13:40:43] [INFO ] After 5794ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1360 ms.
[2023-03-12 13:40:44] [INFO ] After 10428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 32 ms.
Support contains 27 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.14 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 290 places :
Symmetric choice reduction at 0 with 290 rule applications. Total rules 291 place count 1321 transition count 3816
Iterating global reduction 0 with 290 rules applied. Total rules applied 581 place count 1321 transition count 3816
Ensure Unique test removed 440 transitions
Reduce isomorphic transitions removed 440 transitions.
Iterating post reduction 0 with 440 rules applied. Total rules applied 1021 place count 1321 transition count 3376
Discarding 147 places :
Symmetric choice reduction at 1 with 147 rule applications. Total rules 1168 place count 1174 transition count 3082
Iterating global reduction 1 with 147 rules applied. Total rules applied 1315 place count 1174 transition count 3082
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 1415 place count 1174 transition count 2982
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1429 place count 1160 transition count 2954
Iterating global reduction 2 with 14 rules applied. Total rules applied 1443 place count 1160 transition count 2954
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1457 place count 1146 transition count 2926
Iterating global reduction 2 with 14 rules applied. Total rules applied 1471 place count 1146 transition count 2926
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1485 place count 1132 transition count 2898
Iterating global reduction 2 with 14 rules applied. Total rules applied 1499 place count 1132 transition count 2898
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1513 place count 1118 transition count 2870
Iterating global reduction 2 with 14 rules applied. Total rules applied 1527 place count 1118 transition count 2870
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1541 place count 1104 transition count 2842
Iterating global reduction 2 with 14 rules applied. Total rules applied 1555 place count 1104 transition count 2842
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1568 place count 1091 transition count 2816
Iterating global reduction 2 with 13 rules applied. Total rules applied 1581 place count 1091 transition count 2816
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1594 place count 1078 transition count 2790
Iterating global reduction 2 with 13 rules applied. Total rules applied 1607 place count 1078 transition count 2790
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 1654 place count 1031 transition count 2616
Iterating global reduction 2 with 47 rules applied. Total rules applied 1701 place count 1031 transition count 2616
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 1753 place count 979 transition count 2408
Iterating global reduction 2 with 52 rules applied. Total rules applied 1805 place count 979 transition count 2408
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 1857 place count 927 transition count 2280
Iterating global reduction 2 with 52 rules applied. Total rules applied 1909 place count 927 transition count 2280
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 1961 place count 875 transition count 2176
Iterating global reduction 2 with 52 rules applied. Total rules applied 2013 place count 875 transition count 2176
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 2065 place count 823 transition count 2072
Iterating global reduction 2 with 52 rules applied. Total rules applied 2117 place count 823 transition count 2072
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 2169 place count 771 transition count 1968
Iterating global reduction 2 with 52 rules applied. Total rules applied 2221 place count 771 transition count 1968
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 2272 place count 720 transition count 1866
Iterating global reduction 2 with 51 rules applied. Total rules applied 2323 place count 720 transition count 1866
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2333 place count 710 transition count 1846
Iterating global reduction 2 with 10 rules applied. Total rules applied 2343 place count 710 transition count 1846
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 2367 place count 710 transition count 1822
Applied a total of 2367 rules in 1496 ms. Remains 710 /1628 variables (removed 918) and now considering 1822/5962 (removed 4140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1497 ms. Remains : 710/1628 places, 1822/5962 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) 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 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :1
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :1
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-06 FALSE 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 7) seen :1
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) 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 6) seen :0
Running SMT prover for 6 properties.
[2023-03-12 13:40:46] [INFO ] Flow matrix only has 1226 transitions (discarded 596 similar events)
// Phase 1: matrix 1226 rows 710 cols
[2023-03-12 13:40:46] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-12 13:40:46] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:40:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:40:47] [INFO ] After 1439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 13:40:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:40:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:40:49] [INFO ] After 1134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 13:40:49] [INFO ] State equation strengthened by 301 read => feed constraints.
[2023-03-12 13:40:50] [INFO ] After 808ms SMT Verify possible using 301 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 13:40:50] [INFO ] After 1631ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 618 ms.
[2023-03-12 13:40:51] [INFO ] After 3596ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 15 ms.
Support contains 24 out of 710 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 710/710 places, 1822/1822 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 708 transition count 1818
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 708 transition count 1818
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 706 transition count 1814
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 706 transition count 1814
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 705 transition count 1810
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 705 transition count 1810
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 704 transition count 1808
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 704 transition count 1808
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 703 transition count 1806
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 703 transition count 1806
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 702 transition count 1804
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 702 transition count 1804
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 701 transition count 1802
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 701 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 700 transition count 1800
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 700 transition count 1800
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 699 transition count 1798
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 699 transition count 1798
Applied a total of 22 rules in 238 ms. Remains 699 /710 variables (removed 11) and now considering 1798/1822 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 699/710 places, 1798/1822 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) 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 6) seen :1
FORMULA FunctionPointer-PT-c004-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) 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
Running SMT prover for 5 properties.
[2023-03-12 13:40:51] [INFO ] Flow matrix only has 1210 transitions (discarded 588 similar events)
// Phase 1: matrix 1210 rows 699 cols
[2023-03-12 13:40:51] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-12 13:40:52] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-12 13:40:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:40:53] [INFO ] After 1360ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 13:40:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:40:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:40:54] [INFO ] After 955ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 13:40:54] [INFO ] State equation strengthened by 298 read => feed constraints.
[2023-03-12 13:40:55] [INFO ] After 949ms SMT Verify possible using 298 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 13:40:55] [INFO ] Deduced a trap composed of 131 places in 162 ms of which 1 ms to minimize.
[2023-03-12 13:40:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2023-03-12 13:40:56] [INFO ] After 1903ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 532 ms.
[2023-03-12 13:40:56] [INFO ] After 3565ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 12 ms.
Support contains 23 out of 699 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 699/699 places, 1798/1798 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 698 transition count 1796
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 698 transition count 1796
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 697 transition count 1794
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 697 transition count 1794
Applied a total of 4 rules in 121 ms. Remains 697 /699 variables (removed 2) and now considering 1794/1798 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 697/699 places, 1794/1798 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) 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 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 18 ms. (steps per millisecond=555 ) 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
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 230543 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 230543 steps, saw 151296 distinct states, run finished after 3002 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-12 13:41:00] [INFO ] Flow matrix only has 1208 transitions (discarded 586 similar events)
// Phase 1: matrix 1208 rows 697 cols
[2023-03-12 13:41:00] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-12 13:41:00] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:41:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:41:01] [INFO ] After 1371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 13:41:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-12 13:41:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-12 13:41:02] [INFO ] After 971ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 13:41:02] [INFO ] State equation strengthened by 298 read => feed constraints.
[2023-03-12 13:41:03] [INFO ] After 869ms SMT Verify possible using 298 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 13:41:04] [INFO ] Deduced a trap composed of 131 places in 151 ms of which 2 ms to minimize.
[2023-03-12 13:41:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2023-03-12 13:41:04] [INFO ] After 1901ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 728 ms.
[2023-03-12 13:41:05] [INFO ] After 3772ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 15 ms.
Support contains 23 out of 697 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 697/697 places, 1794/1794 transitions.
Applied a total of 0 rules in 90 ms. Remains 697 /697 variables (removed 0) and now considering 1794/1794 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 697/697 places, 1794/1794 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 697/697 places, 1794/1794 transitions.
Applied a total of 0 rules in 97 ms. Remains 697 /697 variables (removed 0) and now considering 1794/1794 (removed 0) transitions.
[2023-03-12 13:41:05] [INFO ] Flow matrix only has 1208 transitions (discarded 586 similar events)
[2023-03-12 13:41:05] [INFO ] Invariant cache hit.
[2023-03-12 13:41:05] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-12 13:41:05] [INFO ] Flow matrix only has 1208 transitions (discarded 586 similar events)
[2023-03-12 13:41:05] [INFO ] Invariant cache hit.
[2023-03-12 13:41:06] [INFO ] State equation strengthened by 298 read => feed constraints.
[2023-03-12 13:41:07] [INFO ] Implicit Places using invariants and state equation in 1671 ms returned []
Implicit Place search using SMT with State Equation took 1986 ms to find 0 implicit places.
[2023-03-12 13:41:07] [INFO ] Redundant transitions in 108 ms returned []
[2023-03-12 13:41:07] [INFO ] Flow matrix only has 1208 transitions (discarded 586 similar events)
[2023-03-12 13:41:07] [INFO ] Invariant cache hit.
[2023-03-12 13:41:08] [INFO ] Dead Transitions using invariants and state equation in 613 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2811 ms. Remains : 697/697 places, 1794/1794 transitions.
Graph (trivial) has 1037 edges and 697 vertex of which 192 / 697 are part of one of the 64 SCC in 4 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 458 transitions
Reduce isomorphic transitions removed 778 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 569 transition count 1002
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 555 transition count 1002
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 29 place count 555 transition count 907
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 219 place count 460 transition count 907
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 282 place count 397 transition count 844
Iterating global reduction 2 with 63 rules applied. Total rules applied 345 place count 397 transition count 844
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 471 place count 397 transition count 718
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 737 place count 264 transition count 585
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 798 place count 203 transition count 463
Iterating global reduction 3 with 61 rules applied. Total rules applied 859 place count 203 transition count 463
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 861 place count 203 transition count 461
Discarding 57 places :
Symmetric choice reduction at 4 with 57 rule applications. Total rules 918 place count 146 transition count 347
Iterating global reduction 4 with 57 rules applied. Total rules applied 975 place count 146 transition count 347
Discarding 57 places :
Symmetric choice reduction at 4 with 57 rule applications. Total rules 1032 place count 89 transition count 233
Iterating global reduction 4 with 57 rules applied. Total rules applied 1089 place count 89 transition count 233
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 4 with 57 rules applied. Total rules applied 1146 place count 89 transition count 176
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 1148 place count 88 transition count 175
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1164 place count 80 transition count 186
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 1173 place count 80 transition count 177
Applied a total of 1173 rules in 74 ms. Remains 80 /697 variables (removed 617) and now considering 177/1794 (removed 1617) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 177 rows 80 cols
[2023-03-12 13:41:08] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 13:41:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 13:41:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 13:41:08] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 13:41:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 13:41:08] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 13:41:08] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 13:41:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 13:41:08] [INFO ] After 53ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 13:41:08] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-12 13:41:08] [INFO ] After 305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-12 13:41:08] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-12 13:41:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 697 places, 1794 transitions and 7302 arcs took 18 ms.
[2023-03-12 13:41:09] [INFO ] Flatten gal took : 144 ms
Total runtime 37955 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/521/inv_0_ --invariant=/tmp/521/inv_1_ --invariant=/tmp/521/inv_2_ --invariant=/tmp/521/inv_3_ --invariant=/tmp/521/inv_4_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393228 kB
MemFree: 336232 kB
After kill :
MemTotal: 16393228 kB
MemFree: 16092984 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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-c004"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is FunctionPointer-PT-c004, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838856300727"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c004.tgz
mv FunctionPointer-PT-c004 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;