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.r171-tall-167838859000743.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 smartxred
Input is FunctionPointer-PT-c016, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r171-tall-167838859000743
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.0K Feb 25 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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 11K Feb 25 12:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 12:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 12:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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-c016-ReachabilityFireability-00
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-01
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-02
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-03
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-04
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-05
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-06
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-07
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-08
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-09
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-10
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-11
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-12
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-13
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-14
FORMULA_NAME FunctionPointer-PT-c016-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679505953004

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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c016
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 17:25:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 17:25:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 17:25:54] [INFO ] Load time of PNML (sax parser for PT used): 294 ms
[2023-03-22 17:25:54] [INFO ] Transformed 2826 places.
[2023-03-22 17:25:54] [INFO ] Transformed 8960 transitions.
[2023-03-22 17:25:54] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 486 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1198 places in 37 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10010 steps, including 2 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :1
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-10 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 5) 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 5) seen :0
Running SMT prover for 5 properties.
[2023-03-22 17:25:55] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2023-03-22 17:25:55] [INFO ] Computed 4 place invariants in 97 ms
[2023-03-22 17:25:56] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-22 17:25:56] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 17:25:58] [INFO ] After 2564ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 17:25:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-22 17:25:58] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 17:26:00] [INFO ] After 1805ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 17:26:00] [INFO ] State equation strengthened by 479 read => feed constraints.
[2023-03-22 17:26:02] [INFO ] After 1333ms SMT Verify possible using 479 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 17:26:03] [INFO ] Deduced a trap composed of 131 places in 724 ms of which 6 ms to minimize.
[2023-03-22 17:26:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 906 ms
[2023-03-22 17:26:04] [INFO ] Deduced a trap composed of 133 places in 643 ms of which 5 ms to minimize.
[2023-03-22 17:26:05] [INFO ] Deduced a trap composed of 133 places in 630 ms of which 1 ms to minimize.
[2023-03-22 17:26:05] [INFO ] Deduced a trap composed of 133 places in 648 ms of which 3 ms to minimize.
[2023-03-22 17:26:06] [INFO ] Deduced a trap composed of 133 places in 629 ms of which 2 ms to minimize.
[2023-03-22 17:26:07] [INFO ] Deduced a trap composed of 133 places in 638 ms of which 1 ms to minimize.
[2023-03-22 17:26:08] [INFO ] Deduced a trap composed of 133 places in 639 ms of which 1 ms to minimize.
[2023-03-22 17:26:08] [INFO ] Deduced a trap composed of 133 places in 626 ms of which 2 ms to minimize.
[2023-03-22 17:26:09] [INFO ] Deduced a trap composed of 133 places in 594 ms of which 2 ms to minimize.
[2023-03-22 17:26:10] [INFO ] Deduced a trap composed of 133 places in 588 ms of which 1 ms to minimize.
[2023-03-22 17:26:10] [INFO ] Deduced a trap composed of 133 places in 635 ms of which 1 ms to minimize.
[2023-03-22 17:26:11] [INFO ] Deduced a trap composed of 133 places in 594 ms of which 1 ms to minimize.
[2023-03-22 17:26:11] [INFO ] Trap strengthening procedure interrupted after too many repetitions 7797 ms
[2023-03-22 17:26:11] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 7802 ms
[2023-03-22 17:26:12] [INFO ] After 11162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 766 ms.
[2023-03-22 17:26:12] [INFO ] After 14214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 110 ms.
Support contains 33 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1611 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.13 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 287 places :
Symmetric choice reduction at 0 with 287 rule applications. Total rules 288 place count 1324 transition count 3850
Iterating global reduction 0 with 287 rules applied. Total rules applied 575 place count 1324 transition count 3850
Ensure Unique test removed 458 transitions
Reduce isomorphic transitions removed 458 transitions.
Iterating post reduction 0 with 458 rules applied. Total rules applied 1033 place count 1324 transition count 3392
Discarding 144 places :
Symmetric choice reduction at 1 with 144 rule applications. Total rules 1177 place count 1180 transition count 3104
Iterating global reduction 1 with 144 rules applied. Total rules applied 1321 place count 1180 transition count 3104
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 1 with 104 rules applied. Total rules applied 1425 place count 1180 transition count 3000
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1439 place count 1166 transition count 2972
Iterating global reduction 2 with 14 rules applied. Total rules applied 1453 place count 1166 transition count 2972
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1466 place count 1153 transition count 2946
Iterating global reduction 2 with 13 rules applied. Total rules applied 1479 place count 1153 transition count 2946
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1492 place count 1140 transition count 2920
Iterating global reduction 2 with 13 rules applied. Total rules applied 1505 place count 1140 transition count 2920
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1518 place count 1127 transition count 2894
Iterating global reduction 2 with 13 rules applied. Total rules applied 1531 place count 1127 transition count 2894
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1544 place count 1114 transition count 2868
Iterating global reduction 2 with 13 rules applied. Total rules applied 1557 place count 1114 transition count 2868
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1568 place count 1103 transition count 2846
Iterating global reduction 2 with 11 rules applied. Total rules applied 1579 place count 1103 transition count 2846
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1589 place count 1093 transition count 2826
Iterating global reduction 2 with 10 rules applied. Total rules applied 1599 place count 1093 transition count 2826
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 1629 place count 1063 transition count 2718
Iterating global reduction 2 with 30 rules applied. Total rules applied 1659 place count 1063 transition count 2718
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 1700 place count 1022 transition count 2554
Iterating global reduction 2 with 41 rules applied. Total rules applied 1741 place count 1022 transition count 2554
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 1782 place count 981 transition count 2436
Iterating global reduction 2 with 41 rules applied. Total rules applied 1823 place count 981 transition count 2436
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 1864 place count 940 transition count 2354
Iterating global reduction 2 with 41 rules applied. Total rules applied 1905 place count 940 transition count 2354
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 1945 place count 900 transition count 2274
Iterating global reduction 2 with 40 rules applied. Total rules applied 1985 place count 900 transition count 2274
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 2025 place count 860 transition count 2194
Iterating global reduction 2 with 40 rules applied. Total rules applied 2065 place count 860 transition count 2194
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 2104 place count 821 transition count 2116
Iterating global reduction 2 with 39 rules applied. Total rules applied 2143 place count 821 transition count 2116
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 2161 place count 803 transition count 2080
Iterating global reduction 2 with 18 rules applied. Total rules applied 2179 place count 803 transition count 2080
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 2 with 46 rules applied. Total rules applied 2225 place count 803 transition count 2034
Applied a total of 2225 rules in 2061 ms. Remains 803 /1628 variables (removed 825) and now considering 2034/5962 (removed 3928) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2062 ms. Remains : 803/1628 places, 2034/5962 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) 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 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :1
FORMULA FunctionPointer-PT-c016-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 17:26:15] [INFO ] Flow matrix only has 1376 transitions (discarded 658 similar events)
// Phase 1: matrix 1376 rows 803 cols
[2023-03-22 17:26:15] [INFO ] Computed 2 place invariants in 21 ms
[2023-03-22 17:26:15] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-22 17:26:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 17:26:16] [INFO ] After 1019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 17:26:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-22 17:26:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 17:26:17] [INFO ] After 745ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 17:26:17] [INFO ] State equation strengthened by 333 read => feed constraints.
[2023-03-22 17:26:17] [INFO ] After 568ms SMT Verify possible using 333 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 17:26:18] [INFO ] After 1036ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 440 ms.
[2023-03-22 17:26:18] [INFO ] After 2419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 34 ms.
Support contains 6 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 2034/2034 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 784 transition count 1992
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 784 transition count 1992
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 784 transition count 1986
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 62 place count 766 transition count 1948
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 766 transition count 1948
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 84 place count 766 transition count 1944
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 101 place count 749 transition count 1892
Iterating global reduction 2 with 17 rules applied. Total rules applied 118 place count 749 transition count 1892
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 135 place count 732 transition count 1854
Iterating global reduction 2 with 17 rules applied. Total rules applied 152 place count 732 transition count 1854
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 171 place count 713 transition count 1810
Iterating global reduction 2 with 19 rules applied. Total rules applied 190 place count 713 transition count 1810
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 209 place count 694 transition count 1772
Iterating global reduction 2 with 19 rules applied. Total rules applied 228 place count 694 transition count 1772
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 246 place count 676 transition count 1734
Iterating global reduction 2 with 18 rules applied. Total rules applied 264 place count 676 transition count 1734
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 280 place count 660 transition count 1702
Iterating global reduction 2 with 16 rules applied. Total rules applied 296 place count 660 transition count 1702
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 310 place count 646 transition count 1674
Iterating global reduction 2 with 14 rules applied. Total rules applied 324 place count 646 transition count 1674
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 330 place count 640 transition count 1662
Iterating global reduction 2 with 6 rules applied. Total rules applied 336 place count 640 transition count 1662
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 340 place count 636 transition count 1654
Iterating global reduction 2 with 4 rules applied. Total rules applied 344 place count 636 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 345 place count 635 transition count 1652
Iterating global reduction 2 with 1 rules applied. Total rules applied 346 place count 635 transition count 1652
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 347 place count 634 transition count 1650
Iterating global reduction 2 with 1 rules applied. Total rules applied 348 place count 634 transition count 1650
Applied a total of 348 rules in 306 ms. Remains 634 /803 variables (removed 169) and now considering 1650/2034 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 634/803 places, 1650/2034 transitions.
Incomplete random walk after 10014 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) 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 4) 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 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 228540 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :{}
Probabilistic random walk after 228540 steps, saw 148353 distinct states, run finished after 3002 ms. (steps per millisecond=76 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-22 17:26:22] [INFO ] Flow matrix only has 1104 transitions (discarded 546 similar events)
// Phase 1: matrix 1104 rows 634 cols
[2023-03-22 17:26:22] [INFO ] Computed 2 place invariants in 17 ms
[2023-03-22 17:26:22] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-22 17:26:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 17:26:23] [INFO ] After 815ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 17:26:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-22 17:26:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-22 17:26:23] [INFO ] After 575ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 17:26:23] [INFO ] State equation strengthened by 273 read => feed constraints.
[2023-03-22 17:26:24] [INFO ] After 452ms SMT Verify possible using 273 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 17:26:24] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 0 ms to minimize.
[2023-03-22 17:26:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2023-03-22 17:26:24] [INFO ] After 1076ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 309 ms.
[2023-03-22 17:26:25] [INFO ] After 2111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 31 ms.
Support contains 6 out of 634 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 634/634 places, 1650/1650 transitions.
Applied a total of 0 rules in 77 ms. Remains 634 /634 variables (removed 0) and now considering 1650/1650 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 634/634 places, 1650/1650 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 634/634 places, 1650/1650 transitions.
Applied a total of 0 rules in 79 ms. Remains 634 /634 variables (removed 0) and now considering 1650/1650 (removed 0) transitions.
[2023-03-22 17:26:25] [INFO ] Flow matrix only has 1104 transitions (discarded 546 similar events)
[2023-03-22 17:26:25] [INFO ] Invariant cache hit.
[2023-03-22 17:26:25] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-22 17:26:25] [INFO ] Flow matrix only has 1104 transitions (discarded 546 similar events)
[2023-03-22 17:26:25] [INFO ] Invariant cache hit.
[2023-03-22 17:26:25] [INFO ] State equation strengthened by 273 read => feed constraints.
[2023-03-22 17:26:27] [INFO ] Implicit Places using invariants and state equation in 1530 ms returned []
Implicit Place search using SMT with State Equation took 1850 ms to find 0 implicit places.
[2023-03-22 17:26:27] [INFO ] Redundant transitions in 99 ms returned []
[2023-03-22 17:26:27] [INFO ] Flow matrix only has 1104 transitions (discarded 546 similar events)
[2023-03-22 17:26:27] [INFO ] Invariant cache hit.
[2023-03-22 17:26:27] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2535 ms. Remains : 634/634 places, 1650/1650 transitions.
Graph (trivial) has 972 edges and 634 vertex of which 192 / 634 are part of one of the 64 SCC in 5 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 738 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 506 transition count 903
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 497 transition count 903
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 19 place count 497 transition count 824
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 177 place count 418 transition count 824
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 240 place count 355 transition count 761
Iterating global reduction 2 with 63 rules applied. Total rules applied 303 place count 355 transition count 761
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 429 place count 355 transition count 635
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 1 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 691 place count 224 transition count 504
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 755 place count 160 transition count 376
Iterating global reduction 3 with 64 rules applied. Total rules applied 819 place count 160 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 820 place count 160 transition count 375
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 883 place count 97 transition count 249
Iterating global reduction 4 with 63 rules applied. Total rules applied 946 place count 97 transition count 249
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1009 place count 34 transition count 123
Iterating global reduction 4 with 63 rules applied. Total rules applied 1072 place count 34 transition count 123
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1135 place count 34 transition count 60
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1135 place count 34 transition count 59
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 1137 place count 33 transition count 59
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 1139 place count 32 transition count 58
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1145 place count 29 transition count 58
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 1150 place count 29 transition count 53
Applied a total of 1150 rules in 88 ms. Remains 29 /634 variables (removed 605) and now considering 53/1650 (removed 1597) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 53 rows 29 cols
[2023-03-22 17:26:27] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-22 17:26:27] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-22 17:26:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 17:26:27] [INFO ] After 18ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-22 17:26:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 17:26:27] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 17:26:27] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 17:26:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-22 17:26:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-22 17:26:27] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 17:26:28] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 17:26:28] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-22 17:26:28] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-22 17:26:28] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2023-03-22 17:26:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 634 places, 1650 transitions and 6726 arcs took 13 ms.
[2023-03-22 17:26:28] [INFO ] Flatten gal took : 130 ms
Total runtime 33887 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running FunctionPointer (PT), instance c016
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 634 places, 1650 transitions, 6726 arcs.
Final Score: 79702.234
Took : 99 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679506089247

--------------------
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
ERROR in file model.sm near line 9018:
syntax error

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-c016"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is FunctionPointer-PT-c016, 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 r171-tall-167838859000743"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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